Document Type

Article

Publication Date

10-8-1987

Publication Title

Dept. of Computer Science, Duke University report: CS-1987-30

Abstract

In a parallel environment, requests for allocation and deallocation of resources or assignment of tasks should be served in a fashion that helps to balance the load and minimize the total parallel runtime. It is important to perform this allocation in a manner that preserves locality and by avoiding remote references (and hence interference with other processes). Concurrent pools, as described by Manber, provide an appropriate data structure for addressing these goals. This paper eveluates the effectiveness of the pool structure under a variety of stressful workloads. It was found that the simpler algorithm than that described by Manber may actually provide better performance.

Comments

Dept. of Computer Science, Duke University report: CS-1987-30

Share

COinS