research-article

An approximation algorithm for scheduling on heterogeneous reconfigurable resources

Authors:

Ani Nahapetian,

Majid SarrafzadehAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 9, Issue 1

Article No.: 5, Pages 1 - 20

https://doi.org/10.1145/1596532.1596537

Published: 29 October 2009 Publication History

Abstract

Dynamic reconfiguration imposes significant penalties in terms of performance and energy. Scheduling the execution of tasks on a dynamically reconfigurable device is therefore of critical importance. Likewise, other application domains have cost models that are effectively the same as dynamic reconfiguration; examples include: data transmission across multiprocessor systems; dynamic code updating and reprogramming of motes in sensor networks; and module allocation, wherein the sharing of resources effectively eliminates inherent reconfiguration costs. This article contributes a fully polynomial time approximation algorithm for the problem of scheduling independent tasks onto a fixed number of heterogeneous reconfigurable resources, where each task has a different hardware and software latency on each device; the reconfiguration latencies can also vary between resources. A general-purpose processor and a field programmable gate array were used to experimentally validate the proposed technique using a pair of encryption algorithms. The latencies of the schedules obtained by the approximation scheme were at most 1.1× longer than the optimal solution, which was found using integer linear programming; this result is better than the theoretical worst-case guarantee of the approximation algorithm, which was 1.999×. The length of the schedules obtained using list scheduling, a well-known polynomial time heuristic, were at most 2.6× longer than optimal.

References

[1]

Angermeier, J. and Teich, J. 2008. Heuristics for scheduling reconfigurable devices while respecting reconfiguration overheads. In Proceedings of 22nd IEEE International Parallel and Distributed Processing Symposium (ISDPS'08). IEEE, Los Alamitos, CA.

[2]

Bondalapati, K. and Prasanna, 2002. Reconfigurable computing systems. Proc. IEEE 90, 7, 1201--1217.

[3]

Bazargan, K., Kastner, R., and Sarrafzadeh, M. 2000. Fast template placement for reconfigurable computings. IEEE Des. Test 17, 1, 68--83.

Digital Library

[4]

Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms 2nd Ed. MIT Press, Cambridge, MA.

Digital Library

[5]

Daeman, J. and Rijmen, V. 1998. AES proposal: Rijndael. In Proceedings of the 1st Advanced Encryption Standard Conference. IEEE, Los Alamitos, CA.

[6]

Dittmann, F. and Frank, S. 2007. Hard real-time reconfiguration port scheduling. In Proceedings of the Design Automation Conference (DAC'07). IEEE, Los Alamitos, CA.

Digital Library

[7]

Follcarelli, I., Kluther, T. J., Susu, A. E., Acquaviva, A., and De Micheli, G. 2006. An opportunistic reconfiguration strategy for environmentally powered devices. In Proceedings of the 3rd ACM International Conference on Computing Frontiers (CF'06). ACM, New York.

Digital Library

[8]

Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.

Digital Library

[9]

Ghiasi, S., Nahapetian, A., and Sarrafzadeh, M. 2004. An optimal algorithm for minimizing run-time reconfiguration delay. ACM Trans. Embed. Comput. Syst. 3, 2, 237--256.

Digital Library

[10]

Heysters, P. M., Smit, G. J. M., and Molenkamp, E. 2004. Energy-efficiency of the MONTIUM reconfigurable tile processor. In Proceedings of Engineering of Reconfigurable Systems and Algorithms (ERSA'04). CSREA Press.

[11]

Hochbaum, D. S. 1997. Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston.

Digital Library

[12]

Horowitz, E. and Sahni, S. 1976. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM. 23, 2, 317--327.

Digital Library

[13]

Jansen, K. and Porkolab, L. 1999. Improved approximation schemes for scheduling unrelated parallel machines. In Proceedings of the 31st ACM Symposium on Theory of Computing (STOC'99). ACM, New York.

Digital Library

[14]

Kogekar, S., Neema, S., and Koutsoukos, X. 2005. Dynamic software reconfiguration in sensor networks. In Proceedings of the Systems Communications (SC'05). IEEE, Los Alamitos, CA.

Digital Library

[15]

Kogekar, S. Neema, S., Eames, B., Koutsoukos, X., and Ledeczi, A. and Maroti, M. 2004. Constraint-guided dynamic reconfiguration in sensor networks. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN'04). ACM, New York.

Digital Library

[16]

Lenstra, J. K., Shmoys, D. B., and Tardos, E. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46.

Digital Library

[17]

Li, Z. and Hauck, S. 2002. Configuration prefetching techniques for partial reconfigurable coprocessor with relocation and defragmentation. In Proceedings of the International Symposium on FPGA (FPGA'02). ACM, New York.

Digital Library

[18]

Moreano, N., Borin, E., de Souza, C. C., and Araujo, G. 2005. Efficient data path merging for partially reconfigurable architectures. IEEE Trans. Comput.-Aid. Des. Integr. Circuits Syst. 24, 7, 969--980.

Digital Library

[19]

Moser, C., Brunelli, D., Thiele, L., and Benini, L. 2006. Real-time scheduling with regenerative energy. In Proceedings of the 18th Euromicro Conference on Real-Time Systems (ECRTS '06). IEEE, Los Alamitos, CA.

Digital Library

[20]

Nahapetian, A., Ghiasi, S., and Sarrafzadeh, M. 2003. Task scheduling on heterogeneous resources with heterogeneous reconfiguration costs. In Proceedings of Parallel and Distributed Computing and Systems (PDCS) (Special Session on Synthesis of Programmable Systems). IEEE, Los Alamitos, CA.

[21]

Nahapetian, A., Lombardo, P., Acquaviva, A., Benini, L., and Sarrafzadeh, M. 2007. Dynamic reconfiguration in sensor networks with regenerative energy sources. In Proceedings of Design Automation and Test Europe (DATE'07). IEEE, Los Alamitos, CA.

Digital Library

[22]

Potts, N. 1985. Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Appl. Math. 10.

[23]

Resano, J., Mozos, D., Verkest, D., Catthour, F., and Vernalde, S. 2004. Specific scheduling support to minimize the reconfiguration overhead of dynamically reconfigurable hardware. In Proceedings of the Design Automation Conference (DAC'04). IEEE, Los Alamitos, CA.

Digital Library

[24]

Resano, J., Mozos, D., Verkest, D., Vernalde, S., and Catthoor, F. 2003. Runtime minimization of reconfiguration overhead in dynamically reconfigurable systems. In Proceedings of the 13th International Conference on Field-Programmable Logic and Application (FPL'03). Springer, Berlin.

[25]

Roy, S., Belkhale, K., and Banerjee, P. 1999. An α-approximate algorithm for delay-constraint technology mapping. In Proceedings of the Design Automation Conference (DAC'99). IEEE, Los Alamitos, CA.

Digital Library

[26]

Rusu, C., Melhem, R. and Mosse, D. 2003. Multi-version scheduling in rechargeable energy-aware real-time systems. In Proceedings of Euromicro Conference on Real-Time Systems (ECRTS '03). IEEE, Los Alamitos, CA.

[27]

Schneier, B. 1996. Applied Cryptography. John Wiley and Sons, Inc, New York.

[28]

Shenoy, U. N., Banerjee, P., and Choudhary, A. 2003. A system-level synthesis algorithm with guaranteed solution quality. In Proceedings of Design Automation and Test in Europe (DATE '03). IEEE, Los Alamitos, CA.

Digital Library

[29]

Verbauwhede, I., Schaumont, P., and Kuo, H. 2003. Design and performance testing of a 2.29GB/s Rijndael processor. IEEE J. Solid-State Circuits 38, 3, 569--572.

[30]

Yang, P. and Catthoor, F. 2003. Pareto-optimization based runtime task scheduling for embedded systems. In Proceedings of the International Symposium on Software Synthesis (ISSS'03). IEEE, Los Alamitos, CA.

Digital Library

Cited By

Li YSi JMa SHu X(2019)Using Energy-Aware Scheduling Weather Forecast Based Harvesting for Reconfigurable HardwareIEEE Transactions on Sustainable Computing10.1109/TSUSC.2018.28007174:1(109-117)Online publication date: 1-Jan-2019
https://doi.org/10.1109/TSUSC.2018.2800717
Zhou ZPlishker WBhattacharyya SDesnos KPelcat MNezan J(2016)Scheduling of Parallelized Synchronous Dataflow Actors for Multicore Signal ProcessingJournal of Signal Processing Systems10.1007/s11265-014-0956-283:3(309-328)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s11265-014-0956-2
Navin Karthi PRajasekaran C(2015)Energy garnering sensor networks hardware vivaciously reconfigurable by HW core algorithm2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS)10.1109/ICIIECS.2015.7192955(1-5)Online publication date: Mar-2015
https://doi.org/10.1109/ICIIECS.2015.7192955
Show More Cited By

Index Terms

An approximation algorithm for scheduling on heterogeneous reconfigurable resources
1. Hardware
  1. Hardware validation

Recommendations

Pipeline Reconfigurable DSP for Dynamically Reconfigurable Architectures

Dynamically reconfigurable architectures, such as NATURE, achieve high logic density and low reconfiguration latency compared to traditional field-programmable gate arrays. Unlike fine-grained NATURE, reconfigurable DSP block incorporated NATURE ...
Task graph scheduling for reconfigurable architectures driven by reconfigurations hiding and resources reuse
GLSVLSI '09: Proceedings of the 19th ACM Great Lakes symposium on VLSI

This paper is focused on the scheduling of tasks on partially dynamically reconfigurable FPGA s in order to minimize the overall latency of the application. We propose a novel approach to the partitioning of a system specification by detecting recurrent ...
A Reconfigurable Processor Architecture Combining Multi-core and Reconfigurable Processing Unit
CIT '10: Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology

It’s a promising way to improve performance significantly by adding reconfigurable processing unit to a general purpose processor. In this paper, a Reconfigurable Multi-Core (RMC) architecture combining general multi-core and reconfigurable logic is ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 9, Issue 1

October 2009

184 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/1596532

Issue’s Table of Contents

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 29 October 2009

Accepted: 01 February 2009

Revised: 01 January 2009

Received: 01 June 2008

Published in TECS Volume 9, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
491
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li YSi JMa SHu X(2019)Using Energy-Aware Scheduling Weather Forecast Based Harvesting for Reconfigurable HardwareIEEE Transactions on Sustainable Computing10.1109/TSUSC.2018.28007174:1(109-117)Online publication date: 1-Jan-2019
https://doi.org/10.1109/TSUSC.2018.2800717
Zhou ZPlishker WBhattacharyya SDesnos KPelcat MNezan J(2016)Scheduling of Parallelized Synchronous Dataflow Actors for Multicore Signal ProcessingJournal of Signal Processing Systems10.1007/s11265-014-0956-283:3(309-328)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s11265-014-0956-2
Navin Karthi PRajasekaran C(2015)Energy garnering sensor networks hardware vivaciously reconfigurable by HW core algorithm2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS)10.1109/ICIIECS.2015.7192955(1-5)Online publication date: Mar-2015
https://doi.org/10.1109/ICIIECS.2015.7192955
Clemente JResano JMozos D(2014)An approach to manage reconfigurations and reduce area cost in hard real-time reconfigurable systemsACM Transactions on Embedded Computing Systems10.1145/256003713:4(1-24)Online publication date: 10-Mar-2014
https://dl.acm.org/doi/10.1145/2560037
Li YJia ZXie SLiu F(2013)Dynamically Reconfigurable Hardware With a Novel Scheduling Strategy in Energy-Harvesting Sensor NetworksIEEE Sensors Journal10.1109/JSEN.2013.224703813:5(2032-2038)Online publication date: May-2013
https://doi.org/10.1109/JSEN.2013.2247038

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents