Harnessing parallelism in multicore clusters with the All-Pairs, Wavefront, and Makeflow abstractions
暂无分享,去创建一个
[1] Douglas Thain,et al. All-pairs: An abstraction for data-intensive cloud computing , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.
[2] Srinivas Aluru,et al. Space and time optimal parallel sequence alignments , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..
[3] Yong Zhao,et al. Falkon: a Fast and Light-weight tasK executiON framework , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).
[4] Zhao Zhang,et al. Parallel Scripting for Applications at the Petascale and Beyond , 2009, Computer.
[5] Leslie G. Valiant,et al. Bulk synchronous parallel computing-a paradigm for transportable software , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.
[6] Charles E. Leiserson,et al. Cache-Oblivious Algorithms , 2003, CIAC.
[7] Wolfgang Gentzsch,et al. Sun Grid Engine: towards creating a compute power grid , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.
[8] M. Spence. The Learning Curve and Competition , 1981 .
[9] Mihaela M. Martis,et al. The Sorghum bicolor genome and the diversification of grasses , 2009, Nature.
[10] H. T. Kung. Why systolic architectures? , 1982, Computer.
[11] Yuan Yu,et al. Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.
[12] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[13] Francisco Vilar Brasileiro,et al. Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids , 2003, Euro-Par.
[14] Jennifer F. Reinganum. Dynamic games of innovation , 1981 .
[15] Jennifer F. Reinganum,et al. Oligopoly Extraction of a Common Property Natural Resource: The Importance of the Period of Commitment in Dynamic Games , 1985 .
[16] Bertil Schmidt,et al. Using reconfigurable hardware to accelerate multiple sequence alignment with ClustalW , 2005, Bioinform..
[17] M. Spence. Cost Reduction, Competition and Industry Performance , 1984 .
[18] Guang R. Gao,et al. An efficient parallel algorithm for all pairs examination , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[19] Richard D. Schlichting,et al. Tolerating failures in the bag-of-tasks programming paradigm , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.
[20] Nitesh V. Chawla,et al. Scaling up Classifiers to Cloud Computers , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[21] J. Mullikin,et al. SSAHA: a fast search method for large DNA databases. , 2001, Genome research.
[22] Francine Berman,et al. Overview of the Book: Grid Computing – Making the Global Infrastructure a Reality , 2003 .
[23] Stuart I. Feldman,et al. Make — a program for maintaining computer programs , 1979, Softw. Pract. Exp..
[24] Daniel S. Katz,et al. Pegasus: A framework for mapping complex scientific workflows onto distributed systems , 2005, Sci. Program..
[25] E. Myers,et al. Basic local alignment search tool. , 1990, Journal of molecular biology.
[26] Srinivas Aluru,et al. Parallel biological sequence alignments on the Cell Broadband Engine , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.
[27] Jennifer F. Reinganum. A DYNAMIC GAME OF R AND D: PATENT PROTECTION AND COMPETITIVE BEHAVIOR' , 1982 .
[28] Francine Berman,et al. Grid Computing: Making the Global Infrastructure a Reality , 2003 .
[29] U. Doraszelski. An R&D Race with Knowledge Accumulation , 2003 .
[30] S. B. Needleman,et al. A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.
[31] Miron Livny,et al. Condor and the Grid , 2003 .
[32] E. LESTER SMITH,et al. AND OTHERS , 2005 .
[33] M. Spence,et al. Learning Curve Spillovers and Market Performance , 1985 .