Actas JP2011 - Universidad de La Laguna

Actas XXII Jornadas de Paralelismo (JP2011) , La Laguna, Tenerife, 7-9 septiembre 2011TABLE IVRunning times of the RAP for several SkeletonsSkeleton OpenMP MPI MPI+ULL CALIBRATESize# cores # cores # cores2 4 8 16 20 2 4 8 16 20 2 4 8 16 201000 15 9 4 2.4 2 14 9 4 2.4 2 11 5 3 1.7 1.52000 126 73 39 20 16 119 70 37 19 16 81 44 23 12 105000 1993 1153 616 311 257 1882 1093 591 311 255 1304 700 399 180 141TABLE VRunning times for MPP, TCP, KP and GCPProblem MPP TCPSize# cores # cores2 4 8 16 20 2 4 8 16 201000 17 8 3.9 1.9 1.6 18 9 3.7 1.9 1.52000 146 73 41 22 21 143 72 36 22 205000 2659 1358 669 349 386 2596 1344 669 349 373Problem KP GCPSize# cores # cores2 4 8 16 20 2 4 8 16 201000 0.22 0.11 0.06 0.08 0.07 57 32 17 7.3 7.52000 0.86 0.44 0.23 0.24 0.24 480 271 193 74 695000 5.7 2.7 1.4 1.3 1.1 8772 4858 2559 1309 1517References[1] Isaac Dooley, “Automated source-to-source translationsto assist parallel programmers,” M.S. thesis,Dept. of Computer Science, University of Illinois, 2006,http://charm.cs.uiuc.edu/papers/DooleyMSThesis06.shtml.[2] Sain zee Ueng, Melvin Lathara, Sara S. Baghsorkhi, andWen mei W. Hwu, “W.m.w.: Cuda-lite: Reducing gpuprogramming complexity,” in In: LCPC08. Volume 5335of LNCS. 2008, pp. 1–15, Springer.[3] Fred V. Lionetti, Andrew D. McCulloch, and Scott B.Baden, “Source-to-source optimization of cuda c for gpuaccelerated cardiac cell modeling,” in Proceedings of the16th international Euro-Par conference on Parallel processing:Part I, Berlin, Heidelberg, 2010, EuroPar’10,pp. 38–49, Springer-Verlag.[4] Kiminori Matsuzaki and Hideya Iwasaki, “A library ofconstructive skeletons for sequential style of parallel programming,”in In InfoScale 06: Proceedings of the 1st internationalconference on Scalable information systems,volume 152 of ACM International Conference ProceedingSeries. 2006, p. 13, ACM Press.[5] Horacio González-Vélez and Mario Leyton, “A survey ofalgorithmic skeleton frameworks: high-level structuredparallel programming enablers,” Softw. Pract. Exper.,vol. 40, pp. 1135–1160, November 2010.[6] ROSE, “www.rosecompiler.org,” .[7] Siegfried Benkner, Eduard Mehofer, and Sabri Pllana,“Towards an intelligent environment for programmingmulti-core computing systems,” in Proceedings of the2nd Workshop on Highly Parallel Processing on a Chip(HPPC 2008), in conjunction with Euro-Par 2008, August2008.[8] Juliana Nascimento and Warren Powell, “Dynamic programmingmodels and algorithms for the mutual fundcash balance problem,” Manage. Sci., vol. 56, pp. 801–815, May 2010.[9] Alexander Erdelyi and Huseyin Topaloglu, “A dynamicprogramming decomposition method for making overbookingdecisions over an airline network,” INFORMSJ. on Computing, vol. 22, pp. 443–456, July 2010.[10] O. de Moor, “Dynamic programming as a software component,”in Proc. 3rd WSEAS Int. Conf. Circuits, Systems,Communications and Computers, N. Mastorakis,Ed., 1999.JP2011-92[11] R. Andonov, S. Balev, S. Rajopadhye, and N. Yanev,“Otimal semi-oblique tiling and its application to sequencecomparison,” in 13th ACM Symposium on ParallelAlgorithms and Architectures (SPAA), 2001.[12] R. Andonov and S. Rajopadhye, “Optimal OrthogonalTiling of 2-D Iterations,” Journal of Parallel andDistributed Computing, vol. 45, pp. 159–165, September1997.[13] Morales D., ALmeida F., Rodríguez C., Roda J., andDelgado A. Coloma I., “Parallel dynamic programmingand automata theory,” Parallel Computing, 2000.[14] T. Ibaraki, Enumerative Approaches to CombinatorialOptimization, Part II, Annals of Operations Research.Volume 11, 1-4, 1988.[15] J. Eckstein, C. A. Phillips, and W. E. Hart, “PICO:An object-oriented framework for parallel branch andbound,” Tech. Rep., RUTCOR, 2000.[16] B. Le Cun, “Bob++ library illustrated by VRP,” in EuropeanOperational Research Conference (EURO’2001),Rotterdam, 2001, p. 157.[17] B. C. Lubow, “SDP: Generalized software for solvingstochastic dynamic optimization problems.,” Wildlife SocietyBulletin, vol. 23, pp. 738–742, September 1997.[18] P. Lohmander, “Deterministic andstochastic dynamic programming.,”www.sekon.slu.se/ PLO/diskreto/dynp.htm.[19] I. Peláez, F. Almeida, and F. Suárez, “Dpskel: A skeletonbased tool for parallel dynamic programming,” inSeventh International Conference on Parallel Processingand Applied Mathematics, PPAM2007, 2007.[20] Ignacio Peláez, Francisco Almeida, and Daniel González,“An xml specification for automatic parallel dynamicprogramming,” in International Conference on ComputationalScience (1), 2006, pp. 872–875.[21] I. Galindo, F. Almeida, V. Blanco, and J.M. Badía, “Dynamicload balancing on dedicated heterogeneous systems,”in Recent Advances in Parallel Virtual Machineand Message Passing Interface. EuroPVM/MPI 2009,Alexey Lastovetsky, Tahar Kechadi, and Jack Dongarra,Eds., Dublin, Ireland, Sept. 2008, vol. 5205 of LectureNotes in Computer Science, pp. 64–74, Springer Verlag.