Abstract
Partially reconfigurable FPGAs can be shared among multiple independent tasks. When partial reconfiguration is possible at runtime the FPGA controller can decide on-line were to place new tasks on the FPGA. Since on-line allocation suffers from fragmentation, tasks can end up waiting despite there being sufficient, albeit non-contiguous resources available to service them. Rearranging a subset of the tasks executing on the FPGA often allows the next pending task to be processed sooner. In this paper we study the problem of placing and rearranging tasks that are supplied by input streams which have constant data rates. When such tasks are rearranged, the arriving input data have to be buffered while the execution is suspended. We describe and evaluate a genetic algorithm for identifying and scheduling feasible rearrangements when moving tasks are reloaded from off-chip and buffer size is limited.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diessel, O.; ElGindy, H.; Middendorf, M.; Schmeck, H.; Schmidt. B.: Dynamic Scheduling of Tasks on Partially Reconfigurable FPGAs. IEE-Proceedings — Computer and Digital Techniques, Vol. 147, No. 3, 2000.
Diessel, O. and ElGindy, H.: ‘Run-Time Compaction of FPGA Designs’, Luk, W. and Cheung, P.Y.K. and Glesner, M. (Eds.), Proc. 7th International Workshop on Field-Programmable Logic and Applications (FPL’ 97), Springer-Verlag, Berlin, Germany, 1997, pp. 131–140.
Diessel, O. and ElGindy, H.: ‘Partial FPGA Rearrangement by Local Repacking.’ Technical Report 97-08, Department of Computer Science and Software Engineering, The University of Newcastle, 1997.
Li, K. and Cheng, K.H.: ‘Complexity of Resource Allocation and Job Scheduling Problems on Partitionable Mesh Connected Systems’, Proceedings 1st IEEE Symposium on Parallel and Distributed Processing, IEEE Computer Society, Los Alamitos, CA, 1989, pp. 358–365.
Mühlenbein, H. and Voigt, H.-M.: ‘Gene pool recombination in genetic algorithms’, Osman, I.H. and Kelly, J.P. (Eds.), Proc. Metaheuristics Int. Conf., Kluwer Academic Publishers, Norwell, 1995.
Teich, M.; Fekete, S. and Schepers, J.: ‘Compile-Time Optimization of Dynamic Hardware Reconfigurations’, Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA’99), Las Vegas, U.S.A., 1999.
Villasenor, J.; Jones, C. and Schoner, B.: ‘Video Communications Using Rapidly Reconfigurable Hardware,’ IEEE Transactions on Circuits and Systems for Video Technology, 1995, 5(6), pp. 565–567.
Vuillemin, J.E.; Bertin, P.; Roncin, D.; Shand, M.; Touati, H.H. and Boucard, P.: ‘Programmable Active Memories: Reconfigurable Systems Come of Age,’ IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1996, 4(1), pp. 56–69.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
ElGindy, H., Middendorf, M., Schmeck, H., Schmidt, B. (2000). Task Rearrangement on Partially Reconfigurable FPGAs with Restricted Buffer. In: Hartenstein, R.W., Grünbacher, H. (eds) Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing. FPL 2000. Lecture Notes in Computer Science, vol 1896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44614-1_41
Download citation
DOI: https://doi.org/10.1007/3-540-44614-1_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67899-1
Online ISBN: 978-3-540-44614-9
eBook Packages: Springer Book Archive