Software engineering for multicore systems - An experience report

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2008, Pages 53-60

  Pankratius, Victor ^a   Schaefer, Christoph ^a   Jannesari, Ali ^a   Tichy, Walter F ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Autotuning; Design patterns; Multicore systems; OpenMP

Indexed keywords

ARCHITECTURAL PATTERN; AUTOTUNING; CLOCK RATE; CRITICAL APPLICATIONS; DATA PARTITION; DESIGN PATTERNS; EMPIRICAL FINDINGS; ENGINEERING PRINCIPLES; ERROR PRONES; EXPERIENCE REPORT; FUTURE PERFORMANCE; MULTI CORE; MULTI-CORE SYSTEMS; MULTICORE CHIPS; OPENMP; PARALLEL COMPONENT; PARALLEL COMPUTER; PARALLELIZATIONS; REFACTORINGS; SEQUENTIAL PROGRAMS;

APPLICATION PROGRAMMING INTERFACES (API); COMPUTER SOFTWARE; ENGINEERING; SOFTWARE DESIGN;

MULTICORE PROGRAMMING;

EID: 79959405654     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Challenge benchmarks of the 9th DIMACS implementation challenge - shortest paths, 2006.
2. Agilent Technologies. MassHunter Metabolite ID software. http://www.chem.agilent.com/Scripts/PDS.asp?lPage=57806, 2008. last accessed January 17, 2008.
3. S. Akhter and J. Roberts. Multi-Core Programming. Intel Press, 2006.
4. S. L. Anderson. Random number generators on vector supercomputers and other advanced architectures. SIAM Review, 32(2):221-251, June 1990.
5. K. Asanovic et al. The landscape of parallel computing research: A view from Berkeley. Technical Report UCB/EECS-2006-183, EECS Department, University of California, Berkeley, December 18 2006.
6. R. Chandra, R. Menon, L. Dagum, D. Kohr, D. Maydan, and J. McDonald. Parallel Programming in OpenMP. Morgan Kaufmann, 2000.
7. W. Eatherton. The push of network processing to the top of the pyramid. Keynote address at Symposium on Architectures for Networking and Communications Systems, Oct. 26-28 2005.
8. C. Frommeyer. Parallelisierung von Kürzeste-Wege-Algorithmen für die Anwendung auf Straßengraphen. Master's thesis, IPD Institute, University of Karlsruhe, Germany, 2007.
9. M. I. Gordon, W. Thies, and S. Amarasinghe. Exploiting coarse-grained task, data, and pipeline parallelism in stream programs. In Proc. ASPLOS-XII, pages 151-162, New York, NY, USA, 2006. ACM Press.
10. D. E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley, 3rd edition, 1997.
11. A. Law and W. D. Kelton. Simulation Modeling and Analysis. McGraw-Hill, 3rd edition, 1999.
12. E. L. Lawler et al., editors. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, 1985.
13. K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak. Parallel shortest path algorithms for solving large-scale instances. In 9th DIMA CS Implementation Challenge - Shortest Paths, November 2006.
14. T. G. Mattson, B. A. Sanders, and B. L. Massingill. Patterns for Parallel Programming. Addison-Wesley Professional, 2004.
15. U. Meyer and P. Sanders. Δ-stepping: a parallelizable shortest path algorithm. J. Algorithms, 49(1):114-152, 2003.
16. D. A. Patterson. Computer science education in the 21st century. Communications of the ACM, 49(3):27-30, 2006.
17. J. R. Rattner. Tera-scale computing - a parallel path to the future, http://softwarecommunity.intel.com/articles/eng/1275.htm, May 15 2007.
18. J. Reinders. Intel Threading Building Blocks. O'Reilly, 2007.
19. E. M. Reingold, J. Nievergelt, and N. Deo. Combinatorial algorithms. Prentice-Hall, 1977.
20. N. Shavit and D. Touitou. Software transactional memory. Distributed Computing, V10(2):99-116, February 1997.
21. B. Smith. Reinventing computing. In Keynote at the Manycore Computing Workshop, Seattle, WA, June 20-21 2007.
22. The R Development Core Team. R: A language and environment for statistical computing. http://www.r-project.org, June 27 2007.
23. T. M. Warschko, J. M. Blum, and W. F. Tichy. The parastation project: using workstations as building blocks for parallel computing. Information Sciences, 106(3-4):277-292, 1998.
24. O. Werner-Kytölä and W. F. Tichy. Self-tuning parallelism. In Proc. 8th HPCN, volume 1823 of LNCS, pages 300-312, Amsterdam, The Netherlands, May 2000. Springer Verlag.
25. R. K. Yin. Case Study Research: Design and Methods. Sage Publications, 3rd edition, 2002.