Title :
Efficient partitioning of sequences
Author :
Olstad, Bjorn ; Manne, Fredrik
Author_Institution :
Div. of Comput. Syst. & Telematics, Norwegian Inst. of Technol., Trondheim, Norway
fDate :
11/1/1995 12:00:00 AM
Abstract :
We consider the problem of partitioning a sequence of n real numbers into p intervals such that the cost of the most expensive interval, measured with a cost function f is minimized. This problem is of importance for the scheduling of jobs both in parallel and pipelined environments. We develop a straightforward and practical dynamic programming algorithm that solves this problem in time O(p(n-p)), which is an improvement of a factor of log p compared to the previous best algorithm. A number of variants of the problem are also considered
Keywords :
dynamic programming; parallel algorithms; processor scheduling; scheduling; MinMax problem; cost function; dynamic programming; multiple regression; parallel environments; parallel processing,; partitioning; partitioning of sequences; pipelined environments; scheduling; Computer science; Cost function; Dynamic programming; Heuristic algorithms; Minimax techniques; Packaging; Parallel processing; Partitioning algorithms; Processor scheduling; Publishing;
Journal_Title :
Computers, IEEE Transactions on
