Partitioning Strategies for Concurrent Programming

This work presents four partitioning strategies, or design patterns, useful for decomposing a serial application into multiple concurrently executing parts. These partitioning strategies augment the commonly used task and data parallel design patterns by recognizing that applications are spatiotem...

وصف كامل

التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Hoffmann, Henry Christian, Agarwal, Anant, Devadas, Srinivas
مؤلفون آخرون: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
التنسيق: مقال
اللغة:en_US
منشور في: 2010
الوصول للمادة أونلاين:http://hdl.handle.net/1721.1/59845
https://orcid.org/0000-0001-8253-7714
https://orcid.org/0000-0002-7015-4262