Solving Irregularly Structured Problems in Parallel(2005)
University of Paderborn
被引用13|浏览1
摘要
The Virtual Data Space is a standard C-library which automatically distributes the work-packets generated by parallel applications across the processing nodes. VDS is a universal system offering loadbalancing-mechanisms for applications which incorporate independent load-items and scheduling algorithms for those which comprise precedence-constraints between their different tasks. This paper presents the concepts of VDS and shows some performance results obtained by synthetic benchmark applications.