Euro-Par 2015: Parallel Processing

As they allow processes to communicate and synchronize, concurrent objects are, de facto, the most important objects of concurrent programming. This paper presents and illustrates two important notions associated with concurrent objects. The first one, which is related to their implementation, is the notion of a hybrid implementation. The second one, which is related to their definition, is the notion of an abortable object.

[1]  Mahmut T. Kandemir,et al.  A framework for interprocedural locality optimization using both loop and data layout transformations , 1999, Proceedings of the 1999 International Conference on Parallel Processing.

[2]  Hai Jin,et al.  Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays , 2002 .

[3]  Erez Zadok,et al.  A Versatile and User-Oriented Versioning File System , 2004, FAST.

[4]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[5]  Sandya Mannarswamy,et al.  Structure Layout Optimization for Multithreaded Programs , 2007, International Symposium on Code Generation and Optimization (CGO'07).

[6]  Chentao Wu,et al.  HDP code: A Horizontal-Diagonal Parity Code to Optimize I/O load balancing in RAID-6 , 2011, 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN).

[7]  Robert Strzodka.  Data layout optimization for multi-valued containers in OpenCL , 2012, J. Parallel Distributed Comput..

[8]  Tao Yang,et al.  The Panasas ActiveScale Storage Cluster - Delivering Scalable High Bandwidth Storage , 2004, Proceedings of the ACM/IEEE SC2004 Conference.

[9]  Rastislav Bodík,et al.  An efficient profile-analysis framework for data-layout optimizations , 2002, POPL '02.

[10]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[11]  F. Black,et al.  The Pricing of Options and Corporate Liabilities , 1973, Journal of Political Economy.

[12]  Alex Ramírez,et al.  The low-power architecture approach towards exascale computing , 2011, ScalA '11.

[13]  Sandra Gesing,et al.  SAMPO: an agent-based mosquito point model in OpenCL , 2014, SpringSim.

[14]  Mendel Rosenblum,et al.  The design and implementation of a log-structured file system , 1991, SOSP '91.

[15]  A. Varga,et al.  THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM , 2003 .

[16]  Geng Liu,et al.  Algorithm and Data Optimization Techniques for Scaling to Massively Threaded Systems , 2012, Computer.

[17]  Kevin Skadron,et al.  Dymaxion++: A Directive-Based API to Optimize Data Layout and Memory Mapping for Heterogeneous Systems , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[18]  Mateo Valero,et al.  Supercomputing with commodity CPUs: Are mobile SoCs ready for HPC? , 2013, 2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[19]  William J. Dally,et al.  Scaling the Power Wall: A Path to Exascale , 2014, SC14: International Conference for High Performance Computing, Networking, Storage and Analysis.

[20]  Frank B. Schmuck,et al.  GPFS: A Shared-Disk File System for Large Computing Clusters , 2002, FAST.

[21]  Deok-Hwan Kim,et al.  Reliability and performance enhancement technique for SSD array storage system using RAID mechanism , 2009, 2009 9th International Symposium on Communications and Information Technology.

[22]  Stefan Savage,et al.  AFRAID - A Frequently Redundant Array of Independent Disks , 1996, USENIX Annual Technical Conference.

[23]  Wei-keng Liao,et al.  A case study for scientific I/O: improving the FLASH astrophysics code , 2012 .

[24]  Kevin Skadron,et al.  Dymaxion: Optimizing memory access patterns for heterogeneous systems , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).