Journal ArticleDOI
Task Allocation in Distributed Data Processing
Chu,Holloway,Min-Tsung Lan,Efe +3 more
Reads0
Chats0
TLDR
This research suggests that a programming approach is the task allocation strategy most likely to balance these conflicting factors.Abstract:
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.read more
Citations
More filters
Book
Distributed Operating Systems
TL;DR: What constitutes a distributed operating system and how it is distinguished from a computer network are discussed, and several examples of current research projects are examined in some detail.
Journal ArticleDOI
A taxonomy of scheduling in general-purpose distributed computing systems
Thomas L. Casavant,Jon G. Kuhl +1 more
TL;DR: A taxonomy of approaches to the resource management problem is presented in an attempt to provide a common terminology and classification mechanism necessary in addressing this problem.
Journal ArticleDOI
A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
G.C. Sih,Edward A. Lee +1 more
TL;DR: The authors present a compile-time scheduling heuristic called dynamic level scheduling, which accounts for interprocessor communication overhead when mapping precedence-constrained, communicating tasks onto heterogeneous processor architectures with limited or possibly irregular interconnection structures.
Journal ArticleDOI
Particle swarm optimization for task assignment problem
TL;DR: The effectiveness of the proposed PSO-based algorithm is demonstrated by comparing it with the genetic algorithm, which is well-known population-based probabilistic heuristic, on randomly generated task interaction graphs.
Journal ArticleDOI
Comparative Models of the File Assignment Problem
TL;DR: This perspective exposes the further research which is necessary in order to provide a truly satisfactory solution to the file assignment problem.
References
More filters
Journal ArticleDOI
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
TL;DR: Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper.
Journal ArticleDOI
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
TL;DR: This paper shows that this program module assignment problem can be solved efficiently by making use of the well-known Ford–Fulkerson algorithm for finding maximum flows in commodity networks as modified by Edmonds and Karp, Dinic, and Karzanov.
Journal ArticleDOI
Optimal File Allocation in a Multiple Computer System
TL;DR: In this paper, a model for allocating information files required in common by several computers is developed for allocation of information files in a distributed manner, which considers storage cost, transmission cost, file lengths, and request rates, as well as updating rates of files.
Journal ArticleDOI
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
Yuan-Chieh Chow,Kohler +1 more
TL;DR: Queueing models for a simple heterogeneous multiple processor system are presented, analyzed, and compared and each model is distinguished by a job routing strategy which is designed to reduce the average job turnaround time by balancing the total load among the processors.