This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Processor Configuration Design with Processing/Transmission Costs
September 2000 (vol. 49 no. 9)
pp. 987-991

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.

[1] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems.Los Alamitos, Calif.: IEEE CS Press, 1996.
[2] S. Charcranoon, T.G. Robertazzi, and S. Luryi, “Cost Efficient Processor Arrangement in Single Level Tree Networks,” State Univ. of New York at Stony Brook College of Eng. and Applied Science Technical Report 757, 30 Mar. 1998, available from T. Robertazzi.
[3] S. Charcranoon, T.G. Robertazzi, and S. Luryi, “Parallel Processor Configuration Design with Processor/Transmission Costs,” State Univ. of New York at Stony Brook College of Eng. and Applied Science Technical Report 782, 5 July 2000, available from T. Robertazzi.
[4] J. Sohn, T.G. Robertazzi, and S. Luryi, Optimizing Computing Costs Using Divisible Load Analysis IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 225-234, Mar. 1998.
[5] C.A. Tovey, “On the Number of Iterations of Local Improvement Algorithms,” Operations Research Letters, vol. 2, no. 5, pp. 231-238, Dec. 1983.

Index Terms:
Cost, divisible load, economics, heuristic algorithm, local search, single-level tree network, star network.
Citation:
Saravut Charcranoon, Thomas G. Robertazzi, Serge Luryi, "Parallel Processor Configuration Design with Processing/Transmission Costs," IEEE Transactions on Computers, vol. 49, no. 9, pp. 987-991, Sept. 2000, doi:10.1109/12.869332
Usage of this product signifies your acceptance of the Terms of Use.