|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| 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, September, 2000. | |||
| BibTex | x | ||
| @article{ 10.1109/12.869332, author = {Saravut Charcranoon and Thomas G. Robertazzi and Serge Luryi}, title = {Parallel Processor Configuration Design with Processing/Transmission Costs}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {9}, issn = {0018-9340}, year = {2000}, pages = {987-991}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.869332}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Parallel Processor Configuration Design with Processing/Transmission Costs IS - 9 SN - 0018-9340 SP987 EP991 EPD - 987-991 A1 - Saravut Charcranoon, A1 - Thomas G. Robertazzi, A1 - Serge Luryi, PY - 2000 KW - Cost KW - divisible load KW - economics KW - heuristic algorithm KW - local search KW - single-level tree network KW - star network. VL - 49 JA - IEEE Transactions on Computers ER - | |||
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.