Provably good scheduling for parallel programs that use data structures through implicit batching
2014; Association for Computing Machinery; Volume: 49; Issue: 8 Linguagem: Inglês
10.1145/2692916.2555284
ISSN1558-1160
AutoresKunal Agrawal, Jeremy T. Fineman, Brendan Sheridan, Jim Sukha, Robert Utterback,
Tópico(s)Interconnection Networks and Systems
ResumoThis poster proposes an efficient runtime scheduler that provides provable performance guarantees to parallel programs that use data structures through the use of implicit batching.
Referência(s)