论文信息 - Task Allocation in Distributed Data Processing - 字舞流文

Task Allocation in Distributed Data Processing

Load balancing increases throughput but creates interprocessor overhead. This research suggests that a programming approach is the task allocation strategy most likely to balance these conflicting factors.

Wesley W. Chu | Kemal Efe | Leslie J. Holloway | Min-Tsung Lan | W. Chu | K. Efe | L. J. Holloway | M. Lan

[1] Shahid H. Bokhari,et al. Control of Distributed Processes , 1978, Computer.

[2] Sang M. Lee,et al. Goal programming for decision analysis , 1972 .

[3] Harold S. Stone,et al. Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[4] David Lee,et al. A distributed processing system for naval data communication networks , 1899, AFIPS National Computer Conference.

[5] Andrew Whinston,et al. An Algorithm for the Quadratic Assignment Problem , 1970 .

[6] Wesley W. Chu,et al. Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[7] Harold S. Stone,et al. Assignment of Tasks in a Distributed Processor System with Limited Memory , 1979, IEEE Transactions on Computers.

[8] K. Mani Chandy,et al. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[9] Walter H. Kohler,et al. Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System , 1979, IEEE Transactions on Computers.

[10] 花田収悦,et al. Optimal File Allocation in a Multiple Computer System , 1970 .

[11] Perry L Price,et al. Analysis and use of an Integer Programming Model for Optimally Allocating Files in a Multiple Computer System. , 1978 .