[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Optimization of Shared High-Performance Reconfigurable Computing Resources

Published: 01 July 2012 Publication History

Abstract

In the field of high-performance computing, systems harboring reconfigurable devices, such as field-programmable gate arrays (FPGAs), are gaining more widespread interest. Such systems range from supercomputers with tightly coupled reconfigurable hardware to clusters with reconfigurable devices at each node. The use of these architectures for scientific computing provides an alternative for computationally demanding problems and has advantages in metrics, such as operating cost/performance and power/performance. However, performance optimization of these systems can be challenging even with knowledge of the system’s characteristics. Our analytic performance model includes parameters representing the reconfigurable hardware, application load imbalance across the nodes, background user load, basic message-passing communication, and processor heterogeneity. In this article, we provide an overview of the analytical model and demonstrate its application for optimization and scheduling of high-performance reconfigurable computing (HPRC) resources. We examine cost functions for minimum runtime and other optimization problems commonly found in shared computing resources. Finally, we discuss additional scheduling issues and other potential applications of the model.

References

[1]
Alpha Data. 2012. http://www.alpha-data.com.
[2]
Atallah, M. J., Black, C. L., Marinescu, D. C., Segel, H. J., and Casavant, T. L. 1992. Models and algorithms for coscheduling compute-intensive tasks on a network of workstations. J. Parallel Distrib. Comput. 16, 319--327.
[3]
Basney, J., Raman, B., and Livny, M. 1999. High throughput Monte Carlo. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing.
[4]
BLAS. 2012. Basic Linear Algebra Subprograms. http://www.netlib.org/blas/.
[5]
Cantu-Paz, E. 1998. Designing efficient master-slave parallel genetic algorithms. In Proceedings of the 3rd Annual Conference on Genetic Programming.
[6]
Casavant, T. L. and Kuhl, J. G. 1988. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans. Softw. Eng. 14, 2, 141--154.
[7]
Celoxica. 2012. http://www.celoxica.com.
[8]
ClearSpeed. 2012. http://www.clearspeed.com.
[9]
Compton, K. and Hauck, S. 2002. Reconfigurable computing: A survey of systems and software. ACM Comput. Surv. 34, 171--210.
[10]
Cook, S. A. 1971. The complexity of theorem-proving procedures. In Proceedings of the ACM Symposium on Theory of Computing.
[11]
Cray. 2012. http://www.cray.com.
[12]
DRC. 2012. Reconfigurable Processing Unit, DRC Computer Corporation. http://www.drccomp.com.
[13]
El-Ghazawi, T., El-Araby, E., Huang, M., Gaj, K., Kindratenko, V., and Buell, D. 2008. The promise of high-performance reconfigurable computing. Comput. 41, 69--76.
[14]
El-Rewini, H. and Lewis, T. G. 1994. Task Scheduling in Parallel Distributed Systems. Prentice Hall, Upper Saddle River, NJ.
[15]
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.
[16]
Govindan, V. and Franklin, M. A. 1996. Application load imbalance on parallel processors. In Proceedings of the 10th International Parallel Processing Symposium (IPPS’96).
[17]
Holland, B., Nagarajan K., and George, A. 2009. RAT: RC amenability test for rapid performance prediction. ACM Trans. Reconfig. Technol. Syst. 1, 1--31.
[18]
Hou, E., Ansari, N., and Ren, H. 1994. A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 5, 113--120.
[19]
Kant, K. 1992. Introduction to Computer System Performance Evaluation. McGraw-Hill, Inc., New York.
[20]
Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. 1983. Optimization by simulated annealing. Sci. 220, 671--680.
[21]
Koehler, S., Curreri, J., and George, A. D. 2008. Performance analysis challenges and framework for high-performance reconfigurable computing. Parallel Comput. 34, 217--230.
[22]
Kwok, Y. 1999. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31, 406--471.
[23]
Leong, P. H. W., Leong, M. P., Cheung, O. Y. H., Tung, T., Kwok, C. M., Wong, M. Y., and Lee, K. H. 2001. Pilchard: A reconfigurable computing platform with memory slot interface. In Proceedings of the IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM).
[24]
Maxwell at EPCC. 2012. http://www.epcc.ed.ac.uk/facilities/maxwell.
[25]
Nallatech. 2012. http://www.nallatech.com.
[26]
NIST. 2005. Guideline for implementing cryptography in the federal government. Tech. rep. NIST SP800-21. http://csrc.nist.gov/publications.
[27]
Novo-G. 2012. http://www.chrec.org/facilities.html.
[28]
Peterson, G. D. 1994. Parallel application performance on shared, heterogeneous workstations. Ph.D. dissertation. Washington University Sever Institute of Technology, St. Louis, MO.
[29]
Saha, P. and El-Ghazawi, T. 2007. Software/hardware co-scheduling for reconfigurable computing systems. In Proceedings of the International Symposium on Field-Programmable Custom Computing Machines.
[30]
SGI RASC. 2012. http://www.sgi.com.
[31]
Smith, M. C. 2003. Analytical modeling of high performance reconfigurable computers: Prediction and analysis of system performance. Ph.D. dissertation, University of Tennessee.
[32]
Smith, M. C. and Peterson, G. D. 2005. Parallel application performance on shared high performance reconfigurable computing resources. Perform. Eval. 60, 1--4, 107--125.
[33]
SRC MAPstation. 2012. http://www.srccomp.com.
[34]
Topcuoglu, J., Hariri, S., and Wu, M. 2002. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13, 260--274.
[35]
XtremeData XD1000 Development System. 2012. http://www.xtremedata.com.

Cited By

View all
  • (2017)Design and implementation of a data-driven dynamical reconfigurable cell arrayJournal of Shanghai Jiaotong University (Science)10.1007/s12204-017-1862-022:4(493-503)Online publication date: 28-Jul-2017

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems
ACM Transactions on Embedded Computing Systems  Volume 11, Issue 2
July 2012
342 pages
ISSN:1539-9087
EISSN:1558-3465
DOI:10.1145/2220336
Issue’s Table of Contents
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

Publication History

Published: 01 July 2012
Accepted: 01 May 2011
Revised: 01 December 2010
Received: 01 June 2009
Published in TECS Volume 11, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Analytic performance modeling
  2. high-performance computing (HPC)
  3. reconfigurable computing (RC)
  4. scheduling

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2017)Design and implementation of a data-driven dynamical reconfigurable cell arrayJournal of Shanghai Jiaotong University (Science)10.1007/s12204-017-1862-022:4(493-503)Online publication date: 28-Jul-2017

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media