George Tzenakis
ABSTRACT
No abstract available.
- E. Ayguade, N. Copty, A. Duran, J. Hoeflinger, Y. Lin, F. Massaioli, X. Teruel, P. Unnikrishnan, and G. Zhang. The Design of OpenMP Tasks. IEEE TPDS, 20(3):404--418, 2009. Google Scholar
Digital Library
- M. J. Best, S. Mottishaw, C. Mustard, M. Roth, A. Fedorova, and A. Brownsword. Synchronization via Scheduling: Techniques for Efficiently Managing Shared State. In PLDI, 2011. Google ScholarDigital Library
- R. Bocchino, V. S. Adve, D. Dig, S. V. Adve, S. Heumann, R. Komuravelli, J. Overbey, P. Simmons, H. Sung, and M. Vakilian. A Type and Effect System for Deterministic Parallel Java. In OOPSLA, 2009. Google ScholarDigital Library
- K. Fatahalian, D. R. Horn, T. J. Knight, L. Leem, M. Houston, J. Y. Park, M. Erez, M. Ren, A. Aiken, W. J. Dally, and P. Hanrahan. Sequoia: Programming the Memory Hierarchy. In SC, 2006. Google ScholarDigital Library
- J. C. Jenista, Y. H. Eom, and B. Demsky. OoOJava: Software Out-of-Order Execution. In PPoPP, 2011. Google ScholarDigital Library
- C. E. Leiserson. The Cilk++ Concurrency Platform. The Journal of Supercomputing, 51(3):244--257, 2010. Google ScholarDigital Library
- Concurrency J. M. Perez, P. Bellens, R. M. Badia, and J. Labarta. CellSs: Making it Easier to Program the Cell Broadband Engine Processor. IBM Journal of Research and Development, 51(5):593--604, 2007. Google ScholarDigital Library
- J. Planas, R. M. Badia, E. Ayguade, and J. Labarta. Hierarchical Task-Based Programming With StarSs. International Journal of High Perfomance Computing Applications, 23(3):284--299, 2009. Google ScholarDigital Library
Index Terms
- BDDT:: block-level dynamic dependence analysisfor deterministic task-based parallelism
Recommendations
BDDT: Block-Level Dynamic Dependence Analysis for Task-Based Parallelism
APPT 2013: Revised Selected Papers of the 10th International Symposium on Advanced Parallel Processing Technologies - Volume 8299We present BDDT, a task-parallel runtime system that dynamically discovers and resolves dependencies among parallel tasks. BDDT allows the programmer to specify detailed task footprints on any memory address range, multidimensional array tile or dynamic ...
Concurrent, parallel garbage collection in linear time
ISMM '14This paper presents a new concurrent garbage collection algorithm based on two types of reference, strong and weak, to link the graph of objects. Strong references connect the roots to all the nodes in the graph but do not contain cycles. Weak ...
Comments