Harnessing parallelism in multicore clusters with the all-pairs and wavefront abstractions

Proc. 18th ACM International Symposium on High Performance Distributed Computing, HPDC 09, Co-located with the 2009 International Symposium on High Performance Distributed Computing Conf., HPDC'09

Volumn , Issue , 2009, Pages 1-10

  Yu, Li ^a   Moretti, Christopher ^a   Emrich, Scott ^a   Judd, Kenneth ^b   Thain, Douglas ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Abstractions; Bioinformatics; Economics; Multicore

Indexed keywords

ABSTRACTIONS; DISTRIBUTED SYSTEMS; EXPERT PROGRAMMERS; HIGH-LEVEL ABSTRACTION; MULTI CORE; MULTI-CORE CLUSTER; MULTI-CORE SYSTEMS; ONE-MACHINE; PARALLEL COMPUTING; PARALLEL PROGRAM; PLUG-INS; PROBLEM SIZE; PROGRAMMING ENVIRONMENT; REGULAR STRUCTURE; ROBUST PERFORMANCE; SEQUENTIAL PROGRAMS; SINGLE CPU;

BIOINFORMATICS; COMPUTER PROGRAMMING; DIE CASTING; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS; WAVEFRONTS;

ABSTRACTING;

EID: 70449644842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1551609.1551613     Document Type: Conference Paper

References (27)

1. D. Bakken and R. Schlichting. Tolerating failures in the bag-of-tasks programming paradigm. In IEEE International Symposium on Fault Tolerant Computing, June 1991.
2. T. Cheatham, A. Fahmy, D. Siefanescu, and L. Valiani. Bulk synchronous parallel computing - a paradigm for transportable software. In Hawaii International Conference on Systems Sciences, 2005.
3. D. da Silva, W. Cirne, and F. Brasilero. Trading cycles for information: Using replication to schedule bag-of-tasks applications on computational grids. In Euro-Par, 2003.
4. J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large cluster. In Operating Systems Design and Implementation, 2004.
5. E. Deelman, G. Singh, M.-H. Su, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. Vahi, B. Berriman, J. Good, A. Laity, J. Jacob, and D. Katz. Pegasus: A framework for mapping complex scientific workflows onto distributed systems. Scientific Programming Journal, 13(3), 2005.
6. U. Doraszelski. An R&D race with knowledge accumulation. Bell Journal of Economics, 34:19-41, 2003.
7. M. Frigo, C. Leiserson, H. Prokop, and S. Ramachandran. Cache oblivious algorithms. In Foundations of Computer Science (FOCS), 1999.
8. W. Gentzsch. Sun grid engine: Towards creating a compute power grid. In CCGRID '01: Proceedings of the 1st International Symposium on Cluster Computing and the Grid, 2001.
9. P. Ghemawat and A. M. Spence. Learning curve spillovers and market performance. The Quarterly Journal of Economics, 100:839-852, 1985.
10. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed data parallel programs from sequential building blocks. In Proceedings of EuroSys, March 2007.
11. H. T. Kung. Why Systolic Architectures? IEEE Computer, 15:37-46, January 1982.
12. C. Moretti, J. Bulosan, P. Flynn, and D. Thain. All-pairs: An abstraction for data intensive cloud computing. In International Parallel and Distributed Processing Symposium (IPDPS), 2008.
13. C. Moretti, K. Steinhaeuser, D. Thain, and N. V. Chawla. Scaling up classifiers to cloud computers. In International Conference on Data Mining (ICDM), 2008.
14. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
15. T. Oliver, B. Schmidt, D. Nathan, R. Clemens, and D. Maskell. Using reconfigurable hardware to accelerate multiple sequence alignment with clustalw. Bioinformatics, 21:3431-3432, 2005.
16. I. Raicu, Y. Zhao, C. Dumitrescu, I. Foster, and M. Wilde. Falkon: a Fast and Light-weight tasK executiON framework. In IEEE/ACM Supercomputing, 2007.
17. S. Rajko and S. Aluru. Space and time optimal parallel sequence alignments. IEEE Transactions on Parallel and Distributed Systems, pages 1070-1081, 2004.
18. J. Reinganum. Dynamic games of innovation. Journal of Economic Theory, 25:21-41, 1981.
19. J. Reinganum. A dynamic game of R&D: Patent protection and competitive behavior. Econometrica, 50:671-688, 1982.
20. J. Reinganum. Corrigendum. Journal of Economic Theory, 35:196-197, 1985.
21. J. Reinganum and N. Stokey. Oligopoly extraction of a common property natural resource: The importance of the period of commitment in dynamic games. International Economic Review, 26:161-174, 1985.
22. A. Sarje and S. Aluru. Parallel biological sequence alignments on the cell broadband engine. In International Parallel and Distributed Processing Symposium (IPDPS), 2008.
23. A. M. Spence. The learning curve and competition. Bell Journal of Economics, 12:49-70, 1981.
24. A. M. Spence. Cost reduction, competition, and industry performance. Econometrica, 52:101-121, 1984.
25. D. Thain, T. Tannenbaum, and M. Livny. Condor and the grid. In F. Berman, G. Fox, and T. Hey, editors, Grid Computing: Making the Global Infrastructure a Reality. John Wiley, 2003.
26. K. B. Theobald and G. R. Gao. An efficient parallel algorithm for all pairs examination. In Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing, pages 742-753, New York, NY, USA, 1991. ACM.
27. Y. Zhao, J. Dobson, L. Moreau, I. Foster, and M. Wilde. A notation and system for expressing and executing cleanly typed workows on messy scientific data. In SIGMOD, 2005.