Structured Parallel Programming

Structured Parallel Programming

Volumn , Issue , 2012, Pages

  McCool, Michael ^a   Reinders, James ^a   Robison, Arch ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85013784259     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/C2011-0-04251-5     Document Type: Book

References (113)

1. Akra M., Bazzi L. On the solution of linear recurrence equations. Computational Optimization and Applications 1998, 10(2):195-210.
2. Anderson E., Bai Z., Bischof C., Blackford S., Demmel J., Dongarra J., Du Croz J., Greenbaum A., Hammarling S., McKenney A., Sorensen D. LAPACK User's Guide 1999, SIAM, Philadelpha, PA, http://www.netlib.org/lapack/lug, 3rd ed.
3. K. Asanovic, R. Bodik, B. C. Catanzaro, J. J. Gebis, P. Husbands, K. Keutzer, D. A. Patterson, W. L. Plishker, J. Shalf, S. W. Williams, and K. A. Yelick. The Landscape of Parallel Computing Research: A View from Berkeley, Technical Report EECS-2006-183. EECS Department, University of California, Berkeley, 2006.
4. Arge L., Brodal G.S., Fagerberg R. Cache-oblivious data structures. Handbook of Data Structures and Applications 2005, 27. CRC Press, Boca Raton, FL, Chapter 34. D. Mehta, S. Sahni (Eds.).
5. Aldinucci M., Danelutto M. Skeleton-based parallel programming: functional and parallel semantics in a single shot. Computer Languages, Systems, and Structures 2007, 33(3-4):179-192.
6. Adve S. Data races are evil with no exceptions: technical perspective. Communications of the ACM 2010, 53(11):84.
7. Aviram A., Ford B. Deterministic OpenMP for race-free parallelism. Proceedings of 3rd USENIX Workshop on Hot Topics in Parallelism (HotPar '11) 2011, USENIX Association, Berkeley, CA.
8. Alexander C. A Pattern Language: Towns, Buildings, Construction 1977, Oxford University Press, Oxford, UK.
9. Agarwal A., Lim B.-H., Kranz D., Kubiatowicz J. APRIL: a processor architecture for multiprocessing. Proceedings of 17th Annual International Symposium on Computer Architecture 1990, 104-114. IEEE Press, Piscataway, NJ.
10. Amdahl G.M. Validity of the single-processor approach to achieving large scale computing capabilities. Proceedings of the American Federation of Information Processing Societies Spring Joint Computer Conference 1967, 483-485. AFIPS Press, Montvale, NJ.
11. J. Alglave, L. Maranget, S. Sarkar, and P. Sewell. Fences in weak memory models. In T. Touili, B. Cook, and P. Jackson, Eds., Computer Aided Verification, Lecture Notes in Computer Science, Vol. 6174. Springer, Berlin, 2010, pp. 258-272.
12. Blelloch G.E., Hardwick J.C., Chatterjee S., Sipelstein J., Zagha M. Implementation of a portable nested data-parallel language. PPOPP '93: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming 1993, 102-111. ACM Press, New York.
13. Blelloch G.E. Vector Models for Data-Parallel Computing 1990, MIT Press, Cambridge, MA.
14. Blelloch G.E. Prefix sums and their applications. Synthesis of Parallel Algorithms 1993, Morgan Kaufmann, San Francisco, CA. J.H. Reif (Ed.).
15. Blelloch G.E. Programming parallel algorithms. Communications of the ACM 1996, 39(3):85-97.
16. Blelloch G.E., Leiserson C.E., Maggs B.M., Plaxton C.G., Smith S.J., Zagha M. An experimental analysis of parallel sorting algorithms. Theory of Computing Systems 1998, 31:135-167.
17. Bentley J.L., McIlroy M.D. Engineering a sort function. Software: Practice and Experience 1993, 23:1249-1265.
18. Buschmann F., Meunier R., Rohnert H., Sommerlad P., Stal M. Pattern-Oriented Software Architecture: A System of Patterns 1996, Wiley, New York.
19. Billeter M., Olsson O., Assarson U. Efficient stream compaction on wide SIMD many-core architectures. High-Performance Graphics August 2009, 159-166.
20. OpenMP Application Program Interface: Version 3.1 July 2011, OpenMP Architecture Review Board.
21. Boehm H.-J. How to miscompile programs with "benign" data races. Proceedings of 3rd USENIX Workshop on Hot Topics in Parallelism (HotPar '11) 2011, USENIX Association, Berkeley, CA.
22. ™-A Step-by-Step Tutorial October 2009, AMD Developer Central, http://developer.amd.com/sdks/amdappsdk/documentation/imageconvolutionopencl/pages/ImageConvolutionUsingOpenCL_3.aspx.
23. Brent R.P. The parallel evaluation of general arithmetic expressions. Journal of the Association for Computing Machinery 1974, 21(2):201-206.
24. Bentley J.L., Sleator D.D., Tarjan R.E., Wei V.K. A locally adaptive data compression scheme. Communications of the ACM 1986, 29:320-330.
25. M. Burrows and D. J. Wheeler. A Block-Sorting Lossless Data Compression Algorithm, Technical Report 124. Digital Systems Research Center, Palo Alto, CA, 1994.
26. Butler M., Yeh T.-Y., Patt Y., Alsup M., Scales H., Shebanow M. Single instruction stream parallelism is greater than two. Proceedings of the 18th Annual International Symposium on Computer Architecture (ISCA '91) 1991, 276-286. ACM Press, New York.
27. ™ Optimization Case Study: Simple Reductions August 2010, AMD Developer Central, http://developer.amd.com/documentation/articles/Pages/OpenCL-Optimization-Case-Study-Simple-Reductions.aspx.
28. Culler D.E., Karp R.M., Patterson D., Sahay A., Santos E.E., Schauser K.E., Subramonian R., von Eicken T. LogP: a practical model of parallel computation. Communications of the ACM 1996, 39:78-85.
29. Chandramowlishwaran A., Knobe K., Vuduci R.W. Performance evaluation of concurrent collections on high-performance multicore computing systems. Proceedings of the IEEE International Parallel & Distributed Processing Symposium (IPDPS) 2010, 1-12. IEEE Press, Piscataway, NJ.
30. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms 2009, MIT Press, Cambridge, MA. 3rd ed.
31. Cohen J. A History of ALGOL 68 1996, ACM Press, New York, pp. 27-96.
32. Cole M. Algorithmic Skeletons: Structured Management of Parallel Computation 1989, Pitman/MIT Press, Cambridge, MA.
33. ® 64 and IA-32 Architectures Software Developer's Manual 2011, Intel, Intel Corporation, Santa Clara, CA.
34. ® Cilk Plus Language Extension Specification, Version 1.1 2011, Intel, Intel Corporation, Santa Clara, CA.
35. ™ i5 Desktop Processor Turbo Boost Frequency Table 2011, Intel, Intel Corporation, Santa Clara, CA, http://www.intel.com/support/processors/corei5/sb/CS-032278.htm.
36. Crow F.C. Summed-area tables for texture mapping. SIGGRAPH '84: Proceedings of the 11th Annual Conference on Computer Graphics and Interactive Techniques 1984, 207-212. ACM Press, New York.
37. Dubey P.K., Flynn Michael J. Optimal pipelining. Journal of Parallel and Distributed Computing 1990, 8:10-19.
38. Dean J., Ghemawat S. MapReduce: simplified data processing on large clusters. Proceedings of the 6th Symposium on Operating Systems Design and Implementation 2004, USENIX Association, Berkeley, CA.
39. S. Dawson-Haggerty, A. Krioukov, and D. E. Culler. Power Optimization-A Reality Check, Technical Report UCB/EECS-2009-140. EECS Department, University of California, Berkeley, 2009.
40. Dijkstra E. Go To statement considered harmful. Communications of the ACM 1968, 11(3):147-148.
41. Etsion Y., Ramirez A., Badia R.M., Ayguade E., Labarta J., Valero M. Task superscalar: using processors as functional units. Proceedings of 3rd USENIX Workshop on Hot Topics in Parallelism (HotPar '11) 2011, USENIX Association, Berkeley, CA.
42. Fisher A.L., Ghuloum A.M. Parallelizing complex scans and reductions. Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation 1994, 135-146. ACM Press, New York.
43. Frigo M., Halpern P., Leiserson C.E., Lewin-Berlin S. Reducers and other Cilk++ hyperobjects. Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '09) 2009, 79-90. ACM Press, New York.
44. Flynn M.J. Some computer organizations and their effectiveness. IEEE Transactions on Computers 1972, C-21(9):948-960.
45. Gendron B., Crainic T.G. Parallel branch-and-bound algorithms: survey and synthesis. Operations Research 1994, 42(6):1042-1066.
46. Grigori L., Demmel J.W., Xiang H. Communication avoiding Gaussian elimination. Proceedings of the 2008 ACM/IEEE Conference on Supercomputing 2008, 29:1-29:12. IEEE Press, Piscataway, NJ.
47. Gamma E., Helm R., Johnson R., Vlissides J. Design Patterns: Elements of Reusable Object-Oriented Software 1995, Addison-Wesley, Boston, MA.
48. Garanzha K., Pantaleoni J., McAllister D. Simpler and faster HLBVH with work queues. High Performance Graphics August 2011, 59-64.
49. Gustafson J.L. Reevaluating Amdahl's law. Communications of the ACM 1988, 31:532-533.
50. P. Hung and M. J. Flynn. Optimum Instruction-Level Parallelism (ILP) for Superscalar and VLIW Processors, Technical Report CSL-TR-99-783. Stanford University, Stanford, CA, 1999.
51. Hoberock J., Lu V., Jia Y., Hart J.C. Stream compaction for deferred shading. Proceedings of the Conference on High Performance Graphics 2009 2009, 173-180. ACM Press, New York.
52. He Y., Leiserson C.E., Leiserson W.M. The Cilkview scalability analyzer. Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '10) 2010, 145-156. ACM Press, New York.
53. Hennessy J.L., Patterson D.A. Computer Architecture: A Quantitative Approach 2007, Morgan Kaufmann, San Francisco, CA.
54. Herlihy M., Shavit N. The Art of Multiprocessor Programming 2008, Morgan Kaufmann, San Francisco, CA.
55. Hillis W.D., Steele G.L. Data parallel algorithms. Communications of the ACM 1986, 29:1170-1183.
56. Hinnant H.E., Stroustrup B., Kozicki B. A Brief Introduction to rvalue References 2008, Artima Developer, Walnut Creek, CA.
57. Global Optimization Using Interval Analysis 2004, CRC Press, Boca Raton, FL. E.R. Hansen, G.W. Walster (Eds.).
58. OpenCL Parallel Prefix Sum (aka Scan) Example 2009, Apple, Mac OS X Developer Library, Apple, Inc., Cupertino, CA.
59. OpenCL Parallel Reduction Example 2009, Apple, Mac OS X Developer Library, Apple, Inc., Cupertino, CA.
60. Jouppi N.P., Wall D.W. Available instruction-level parallelism for superscalar and superpipelined machines. International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '89) 1989, 290-302. ACM Press, New York.
61. Kamiya T. Japanese Sentence Patterns for Effective Communication 2005, Kodansha USA, New York.
62. Kay A. The Early History of Smalltalk 1996, ACM Press, New York, pp. 511-598.
63. Kurzak J., Ltaief H., Dongarra J., Badia R.M. Scheduling linear algebra operations on multicore processors. Concurrency and Computation: Practice and Experience 2010, 22(1):15-44.
64. Koufaty D., Marr D.T. Hyperthreading technology in the netburst microarchitecture. IEEE Micro 2003, 23(2):56-65.
65. Knuth D.E. Big omicron and big omega and big theta. SIGACT News 1976, 8:18-24.
66. Konstantin S.V. Apache Hadoop: The scalability update. ;login:, The USENIX Magazine 2011, 36(3):7-13.
67. Kjolstad F.B., Snir M. Ghost cell pattern. Proceedings of the 2010 Workshop on Parallel Programming Patterns (ParaPLoP '10) 2010, 4:1-4:9. ACM Press, New York.
68. Kroese D.P., Taimre T., Botev Z.I. Handbook of Monte Carlo Methods 2011, John Wiley & Sons, New York.
69. Lamport L. The parallel execution of DO loops. Communications of the ACM 1974, 17(2):83-93.
70. E. A. Lee. The Problem with Threads, Technical Report UCB/EECS-2006-1. EECS Department, University of California, Berkeley, 2006 (a published version of this paper is in IEEE Computer, 39(5):33-42, 2006).
71. G. Lashari, O. Lhoták, and M. McCool. Control flow emulation on tiled SIMD architectures. In L. J. Hendren, Ed., Compiler Construction, 17th International Conference, Lecture Notes in Computer Science, Vol. 4959. Springer, Berlin, 2008, pp. 100-115.
72. Lloyd S.P. Least squares quantization in PCM. IEEE Transactions on Information Theory 1982, 28(2):129-137.
73. MacDonald S., Anvik J., Bromling S., Szafron D., Schaeffer J., Tan K. From patterns to frameworks to parallel programs. Parallel Computing 2002, 28(12):1663-1683.
74. MacQueen J. Some methods for classification and analysis of multivariate observations. Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability 1967, 281-297. University of California Press, Berkeley.
75. Michael M.M. Hazard pointers: safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems 2004, 15:491-504.
76. Massingill B.L., Mattson T.G., Sanders B.A. Reengineering for parallelism: an entry point for PLPP (Pattern Language for Parallel Programming) for legacy applications. Proceedings of the Twelfth Pattern Languages of Programs Workshop 2005.
77. Mattson T.G., Sanders B.A., Massingill B.L. Patterns for Parallel Programming 2004, Addison Wesley, Reading, MA.
78. MacDonald S., Szfron D., Schaeffer J. Rethinking the pipeline as object-oriented states with transformations. Proceedings of the Ninth International Workshop on High-Level Parallel Programming Models and Supportive Environments 2004, 12-21. IEEE Press, Piscataway, NJ.
79. Naur P. The European Side of the Development of ALGOL 1981, ACM Press, New York, 92-139.
80. Pacheco P.S. Parallel Programming with MPI 1996, Morgan Kaufmann, San Francisco, CA.
81. Berkeley ParLab. A Pattern Language for Parallel Programming, Version 2.0. EECS Department, University of California, Berkeley. http://parlab.eecs.berkeley.edu/wiki/patterns/patterns.
82. Perlis A.J. The American Side of the Development of ALGOL 1981, ACM Press, New York, pp. 75-91.
83. Peierls T., Goetz B., Bloch J., Bowbeer J., Lea D., Holmes D. Java Concurrency in Practice 2005, Addison-Wesley, Boston, MA.
84. Plasmeijer M.J., van Eekelen M.C.J.D. Functional Programming and Parallel Graph Rewriting 1993, Addison-Wesley, Boston, MA.
85. Plasmeijer M.J., van Eekelen M.C.J.D. Keep it CLEAN: a unique approach to functional programming. SIGPLAN Notices 1999, 34(6):23-31.
86. Quinn M.J. Parallel Programming in C with MPI and OpenMP 2003, McGraw-Hill, New York.
87. Rauchwerger L., Dubey P.K., Nair R. Measuring limits of parallelism and characterizing its vulnerability to resource constraints. Proceedings of the 26th Annual International Symposium on Microarchitecture 1993, 105-117. IEEE Computer Society Press, Los Alamitos, CA.
88. O'Hallaron D.R., Bryant R.E. Computer Systems: A Programmer's Perspective 2011, Prentice Hall, Upper Saddle River, NJ.
89. Reinders J. Intel Threading Building Blocks 2007, O'Reilly & Associates, Inc., Sebastopol, CA.
90. Robison A.D., Johnson R.E. Three layer cake for shared-memory programming. Proceedings of the 2010 Workshop on Parallel Programming Patterns (ParaPLoP '10) 2010, 5:1-5:8. ACM Press, New York.
91. Robison A., Voss M., Kukanov A. Optimization via reflection on work stealing in TBB. IEEE International Symposium on Parallel and Distributed Processing 2008, 1-8. IEEE Press, Piscataway, NJ.
92. Snavely A., Carter L., Boisseau J., Majumdar A., Gatlin K.S., Mitchell N., Feo J., Koblenz B. Multi-processor performance on the Tera MTA. Supercomputer '98: Proceedings of the 1998 ACM/IEEE Conference on Supercomputing (CDROM) 1998, 1-8. IEEE Computer Society, Washington, DC.
93. Shin J. Introducing control flow into vectorized code. PACT '07: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques 2007, 280-291. IEEE Computer Society, Washington, DC.
94. Salmon J.K., Moraes M.A., Dror R.O., Shaw D.E. Parallel random numbers: as easy as 1, 2, 3. Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis 2011, 16:1-16:12. ACM Press, New York.
95. Schmidt D., Stal M., Rohnert H., Buschmann F. Pattern-Oriented Software Architecture: Patterns for Concurrent and Networked Objects 2000, Vol. 2. Wiley & Sons, New York.
96. Strassen V. Gaussian elimination is not optimal. Numerische Mathematik 1969, 14:354-356.
97. SPEC CPU2006 benchmark descriptions. Computer Architecture News 2006, 34(4):1-17. SPEC CPU Subcommittee, http://www.spec.org/cpu2006/publications/CPU2006benchmarks.pdf.
98. Sutter H. The free lunch is over: a fundamental turn towards concurrency in software. Dr. Dobbs Journal 2005, 30(3).
99. Smith T.F., Waterman M.S. Identification of common molecular subsequences. Journal of Molecular Biology 1981, 147:195-197.
100. Tate B.A. Seven Languages in Seven Weeks: A Pragmatic Guide to Learning Programming Languages 2010, Pragmatic Bookshelf, Flower Mound, TX.
101. Tejedor E., Badia R.M., Royo R., Gelpi J.L. Enabling HMMER for the grid with COMP superscalar. In Procedia Computer Science 2010, 1(1):2629-2638.
102. Tang Y., Chowdhury R.A., Kuszmaul B.C., Luk C.-K., Leiserson C.E. The Pochoir stencil compiler. Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '11). 2011, 117-128. ACM Press, New York.
103. Tullsen D.M., Eggers S.J., Levy H.M. Simultaneous multithreading: maximizing on-chip parallelism. SIGARCH Computer Architecture News 1995, 23:392-403.
104. Tomasi C., Manduchi R. Bilateral filtering for gray and color images. Proceedings of the Sixth International Conference on Computer Vision 1998, 839-846. IEEE Press, New York.
105. Trachsel O., von Praun C., Gross T.R. On the effectiveness of speculative and selective memory fences. Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS '06) 2006, IEEE Press, New York.
106. Valiant L.G. A bridging model for parallel computation. Communications of the ACM 1990, 33:103-111.
107. N. Vasilache, C. Bastoul, and A. Cohen. Polyhedral Code Generation in the Real World, Lecture Notes in Computer Science, Vol. 3923. Springer, Berlin, 2006, pp. 185-201.
108. Venkatachalam V., Franz M. Power reduction techniques for microprocessor systems. ACM Computing Surveys 2005, 37:195-237.
109. Vishkin U. Thinking in Parallel: Some Basic Data-Parallel Algorithms and Techniques 2010, University of Maryland, College Park, http://www.umiacs.umd.edu/users/vishkin/PUBLICATIONS/classnotes.pdf.
110. Vishkin U. Using simple abstraction to reinvent computing for parallelism. Communications of the ACM 2011, 54:75-85.
111. Vitter J.S. Algorithms and Data Structures for External Memory 2008, Foundations and Trends in Theoretical Computer Science. Now Publishers, Boston, MA.
112. Wald I. Active thread compaction for GPU path tracing. Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics (HPG '11) 2011, ACM Press, New York.
113. Wilson P.R., Johnstone M.S., Neely M., Boles D. Dynamic storage allocation: a survey and critical review. Proceedings of the 1995 International Workshop on Memory Management (IWMM '95) 1995, 1-116. Springer-Verlag, London.