作者: James Philbin , Suresh Jagannathan , Rajiv Mirani
DOI: 10.1007/BFB0014217
关键词:
摘要: We present a new concurrency abstraction and implementation technique for high-level (symbolic) parallel languages that allows significant programmer control over load-balancing mapping of fine-grained lightweight threads. Central to our proposal is the notion virtual topology. A topology defines relation collection processors, those processors set physical processors; processor topologies configured as trees, graphs, butterflies, meshes are some well-known examples. need not have any correlation with one; it intended capture interconnection structure best suited given algorithm. consider be an scheduling, migration policies threads executes. Thus, provide simple, expressive efficient framework defining complex thread/processor mappings abstracts low-level details interconnection.