
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shanjiang Tang, Ce Yu, Jizhou Sun, BuSung Lee, Tao Zhang, Zhen Xu, Huabei Wu, "EasyPDP: An Efficient Parallel Dynamic Programming Runtime System for Computational Biology," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 5, pp. 862872, May, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.218, author = {Shanjiang Tang and Ce Yu and Jizhou Sun and BuSung Lee and Tao Zhang and Zhen Xu and Huabei Wu}, title = {EasyPDP: An Efficient Parallel Dynamic Programming Runtime System for Computational Biology}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {5}, issn = {10459219}, year = {2012}, pages = {862872}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.218}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  EasyPDP: An Efficient Parallel Dynamic Programming Runtime System for Computational Biology IS  5 SN  10459219 SP862 EP872 EPD  862872 A1  Shanjiang Tang, A1  Ce Yu, A1  Jizhou Sun, A1  BuSung Lee, A1  Tao Zhang, A1  Zhen Xu, A1  Huabei Wu, PY  2012 KW  Dynamic programming KW  Easypdp KW  DAG data driven model KW  fault tolerance KW  DAG pattern KW  multicore KW  block cycle. VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] J. Bowie, R. Luthy, and D. Eisenberg, "A Method to Identify Protein Sequences that Fold into a Known ThreeDimensional Structure," Science, vol. 253, no. 5016, pp. 164170, 1991.
[2] C. Ranger et al., "Evaluating MapReduce for MultiCore and Multiprocessor Systems," Proc. IEEE 13th Int'l Symp. High Performance Computer Architecture, pp. 1324, 2007.
[3] E. Kohler, R. Morris, and B. Chen, "Programming Language Optimizations for Modular Router Configurations," Proc. 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 251263, 2002.
[4] B.D. Carlstrom et al., "The ATOMO Transactional Programming Language," Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, pp. 113, June 2006.
[5] T. Harris and K. Fraser, "Language Support for Lightweight Transactions," Proc. 18th Ann. ACM Conf. ObjectOriented Programming, Systems, Languages, and Applications, Oct. 2003.
[6] S. Balakrishnan and G.S. Sohi, "Program Demultiplexing: DataFlow Based Speculative Parallelization of Methods in Sequential Programs," Proc. 33rd Ann. Int'l Symp. Computer Architecture (ISCA '06), June 2006.
[7] C. Ciressan, E. Sanchez, M. Rajman, and J.C. Chappelier, "An FPGABased Coprocessor for the Parsing of ContextFree Grammars," Proc. IEEE Symp. FieldProgrammable Custom Computing Machines, 2000.
[8] M. Farach and M. Thorup, "Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming," Proc. 35th Ann. Symp. Foundations of Computer Science, pp. 770779, 1994.
[9] W.G. Liu and B. Schmidt, "Parallel Design Pattern for Computational Biology and Scientific Computing Applications," Proc. IEEE Int'l Conf. Cluster Computing, pp. 456459, 2003.
[10] V. Kumar, A. Grama, A. Gupa, and G. Karypis, Introduction to Parallel Computing. Benjamin/Cummings Publishing Company, Inc., 1994.
[11] R.A. Chowdhury and V. Ramachandran, "CacheEfficient Dynamic Programming Algorithms for Multicores," Proc. 20th Ann. Symp. Parallelism in Algorithms and Architectures, pp. 207216, 2008.
[12] R.A. Chowdhury, H.S. Le, and V. Ramachandran, "CacheOblivious Dynamic Programming for Bioinformatics," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 7, no. 3, pp. 495510, JulySept. 2009.
[13] R.A. Chowdhury and V. Ramachandran, "CacheOblivious Dynamic Programming," Proc. 17th Ann. ACMSIAM Symp. Discrete Algorithms, pp. 591600, 2006.
[14] R.A. Chowdhury, H. Le, and V. Ramachandran, Efficient CacheOblivious String Algorithms for Bioinformatics, Technical Report TR0703, Dept. of Computer Sciences, Univ. of Texas, Feb. 2007.
[15] G. Blelloch, R. Chowdhury, P. Gibbons, V. Ramachandran, S. Chen, and M. Kozuch, "Provably Good Multicore Cache Performance for DivideandConquer Algorithms," Proc. 19th Ann. ACMSIAM Symp. Discrete Algorithms, pp. 501510, 2008.
[16] Z. Galil and K. Park, "Dynamic Programming with Convexity, Concavity and Sparsity," Theoretical Computer Science, vol. 92, pp. 4976, 1992.
[17] X. Huang and K.M. Chao, "A Generalized Global Alignment Algorithm," Bioinformatics, vol. 19, no. 2, pp. 228233, 2003.
[18] N. Futamura, S. Aluru, and X. Huang, "Parallel Syntenic Alignments," HiPC '02: Proc. Ninth Int'l Conf. High Performance Computing, pp. 420430, 2002.
[19] T. Smith and M. Waterman, "Identification of Common Molecular Subsequences," J. Molecular Biology, vol. 147, no. 1, pp. 195197, 1981.
[20] R. Durbin, S. Eddy, A. Krogh, and G. Mitchison, Biological Sequence Analysis: Probabilistic Models of Protein and Nucleic Acids. Cambridge Univ. Press, 1998.
[21] R. Nussinov, G. Pieczenik, J.R. Griggs, and D.J. Kleitman, "Algorithms for Loop Matchings," SIAM J. Applied Math., vol. 35, no. 1, pp. 6882, 1978.
[22] A. Viterbi, "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," IEEE Trans. Information Theory, vol. TIT13, no. 2, pp. 260269, Apr. 1967.
[23] D.W. Mount, BioinformaticsSequence and Genome Analysis. Cold Spring Harbor Laboratory Press, 2001.
[24] M.S. Gelfand, A.A. Mironov, and P.A. Pevzner, "Gene Recognition via Spliced Sequence Alignment," Proc. Nat'l Academy of Sciences of USA, vol. 93, no. 17, pp. 90619066, 1996.
[25] M. Zuker and P. Stiegler, "Optimal Computer Folding of Large RNA Sequences Using Thermodynamics and Auxiliary Information," Nucleic Acids Research, vol. 9, no. 1, pp. 133148, 1981.
[26] B. Lewis and D.J. Berg, Multithreaded Programming with Pthreads. Prentice Hall, 1998.
[27] S. Mitra, N. Seifert, M. Zhang, Q. Shi, and K.S. Kim, "Robust System Design with BuiltIn SoftError Resilience," Computer, vol 38, no. 2, pp. 4352, 2005.
[28] J.C. Smolens et al., "Fingerprinting: Bounding SoftError Detection Latency and Bandwidth," Proc. 11th Int'l Conf. Architectural Support for Programming, Languages and Operating Systems, pp. 224234, Oct. 2004.
[29] P. Edmonds, E. Chu, and A. George, "Dynamic Programming on a Shared Memory Multiprocessor," Parallel Computing, vol. 19, no. 1, pp. 922, 1993.
[30] Z. Galil and K. Park, "Parallel Algorithm for Dynamic Programming Recurrences with More than O(1) Dependency," J. Parallel and Distributed Computing, vol. 21, no. 2, pp. 213222, 1994.
[31] P.G. Bradford, "Efficient Parallel Dynamic Programming," Proc. 30th Ann. Allerton Conf. Comm. Control and Computing, pp. 185194, 1992.
[32] A. Mark and S. Ramesh, "PC Software Performance Tuning," Computer, vol. 29, no. 8, pp. 4754, 1996.
[33] G.M. Tan, H.N. Sun, and R.G. Gao, "A Parallel Dynamic Programming Algorithm on a MultiCore Architecture," Proc. 19th Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 135144, 2007.
[34] G.M. Tan et al., "Locality and Parallelism Optimization for Dynamic Programming Algorithm in Bioinformatics," Proc. ACM/IEEE Conf. Supercomputing (SC '06), pp. 1117, 2006.
[35] F. Almeida, R. Andonov, and D. Gonzalez, "Optimal Tiling for RNA Base Pairing Problem," Proc. 14th Ann. ACM Symp. Parallel Algorithm and Architecture (SPAA '02), pp. 173182, 2002.
[36] W. Zhou and D.K. Lowenthal, "A Parallel, OutofCore Algorithm for RNA Secondary Structure Prediction," Proc. Int'l Conf. Parallel Processing (ICPP '06), pp. 7481, 2006.
[37] J.S. Vitter, "External Memory Algorithms and Data Structures: Dealing with Massive Data," ACM Computing Surveys, vol. 33, no. 2, pp. 209271, 2001.
[38] W. Liu and B. Schmidt, "A Generic Parallel PatternBased System for Bioinformatics," Proc. EUROPAR, pp. 989996, 2004.
[39] W. Liu and B. Schmidt, "Parallel PatternBased Systems for Computational Biology: A Case Study," IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 8, pp. 750763, Aug. 2006.
[40] J. Dean and J. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," Comm. ACM, vol. 51, no. 1, pp. 107113, 2008.
[41] M.I. Gordon et al., "A Stream Compiler for CommunicationExposed Architectures," Proc. 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 291303, Oct. 2002.
[42] D. Hirschberg, "A Linear Space Algorithm for Computing Maximal Common Subsequences," Comm. ACM, vol. 18, no. 6, pp. 341343, 1975.
[43] X. Huang, "A SpaceEfficient Parallel Sequence Comparison Algorithm for a MessagePassing Multiprocessor," Int'l J. Parallel Programming, vol. 18, no. 3, pp. 223239, 1989.
[44] S. Rajko and S. Aluru, "Space and Time Optimal Parallel Sequence Alignments," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 12, pp. 10701081, Dec. 2004.
[45] U.A. Acar, G.E. Blelloch, and R.D. Blumofe, "The Data Locality of Work Stealing," Theory of Computing Systems, vol. 35, no. 3, pp. 321347, 2002.
[46] M. Frigo, C.E. Leiserson, and K.H. Randall, "The Implementation of the Cilk5 Multithreaded Language," Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, pp. 212223, 1998.
[47] G.E. Blelloch and P.B. Gibbons, "Effectively Sharing a Cache among Threads," Proc. 16th Ann. ACM Symp. Parallelism in Algorithms and Architectures, pp. 235244, 2004.
[48] G.E. Blelloch, P.B. Gibbons, and Y. Matias, "Provably Efficient Scheduling for Languages with FineGrained Parallelism," J. ACM, vol. 46, no. 2, pp. 281321, 1999.
[49] G.E. Blelloch, P.B. Gibbons, G.J. Narlikar, and Y. Matias, "SpaceEfficient Scheduling of Parallelism with Synchronization Variables," Proc. Ninth Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 1223, 1997.