AbstractÐA computer configuration design problem where the objective is to configure a parallel processor to do processing in a cost effective manner is examined. The application envisioned is a specialized on-line service that rents time on its machine. The combinatorial optimization problem involved is examined analytically and a heuristic algorithm for its solution is provided. Lessons learned in this work appear in the conclusion. Index TermsÐCost, divisible load, economics, heuristic algorithm, local search, single-level tree network, star network. æ
The microprocessor chip designer must solve the problem of partitioning millions of transistors into...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
Many programming systems available on massively parallel processors (MPPs) today neglect the signifi...
Abstract—A bus oriented network where there is a charge for the amount of divisible load processed o...
If complex problems are to be solved in reasonable computation times, then large scale parallel proc...
In this paper divisible load scheduling theory is used to examine monetary cost and energy use optim...
Multiple combinations of hardware and network components can be selected to design an information t...
Designers of parallel computers have to decide how to apportion a machine's resources between p...
This thesis presents parallel algorithms to solve SAT problems in the domain of product configuratio...
If complex problems are to be solved in reasonable computation times, then large scale parallel proc...
Multiple combinations of hardware and network components can be selected to design an information te...
Consumer-electronics systems are becoming increasingly complex as the number of integrated applicati...
2013 27th International Symposium on Parallel and Distributed Processing, Boston, United States of A...
Many problems today need the computing power that is only available by using large scale parallel pr...
Abstract: The selection of a cost-minimizing combination of hardware and network components that sat...
The microprocessor chip designer must solve the problem of partitioning millions of transistors into...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
Many programming systems available on massively parallel processors (MPPs) today neglect the signifi...
Abstract—A bus oriented network where there is a charge for the amount of divisible load processed o...
If complex problems are to be solved in reasonable computation times, then large scale parallel proc...
In this paper divisible load scheduling theory is used to examine monetary cost and energy use optim...
Multiple combinations of hardware and network components can be selected to design an information t...
Designers of parallel computers have to decide how to apportion a machine's resources between p...
This thesis presents parallel algorithms to solve SAT problems in the domain of product configuratio...
If complex problems are to be solved in reasonable computation times, then large scale parallel proc...
Multiple combinations of hardware and network components can be selected to design an information te...
Consumer-electronics systems are becoming increasingly complex as the number of integrated applicati...
2013 27th International Symposium on Parallel and Distributed Processing, Boston, United States of A...
Many problems today need the computing power that is only available by using large scale parallel pr...
Abstract: The selection of a cost-minimizing combination of hardware and network components that sat...
The microprocessor chip designer must solve the problem of partitioning millions of transistors into...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
Many programming systems available on massively parallel processors (MPPs) today neglect the signifi...