A parallel algorithm manager for networked workstations

Annals of Operations Research

Volumn 71, Issue , 1997, Pages 229-258

  Mayer, Margaret K ^a   Plebani, Louis J ^b  

^a University of Virginia   (United States)

^b LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031523699     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018919531503     Document Type: Article

References (32)

1. S. Akl, The Design and Analysis of Parallel Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1989.
2. R. Barr and B. Hickman, Reporting computational experiments with parallel algorithms: Issues, measures, and experts' opinions, ORSA Journal on Computing 5(1993)2-18.
3. R. Butler and E. Lusk, Monitors, messages, and clusters: The p4 parallel programming system, Parallel Computing 20(1994)547-564.
4. C. Cap and V. Strumpen, Efficient parallel computing in distributed workstation environments, Parallel Computing 19(1993)1221-1234.
5. T. Crainic and M. Gendron, Parallel branch- and-bound algorithms: Survey and synthesis, Operations Research 42(1994)1042-1066.
6. P. Crandall and M. Quinn, Block data decomposition for data-parallel programming on a heterogeneous workstation network, Proceedings of th 2nd International Symposium on High Performance Distributed Computing, 1993, pp. 42-49.
7. J. Desbiens et al., CLAP: An object-oriented programming system for distributed memory parallel machines, Proceedings of the 1st Annual Object Oriented Numerics Conference, 1993, pp. 44-48.
8. R. Finkel and U. Manber, DIB - A distributed implementation of backtracking, Technical Report 588, Department of Computer Science, University of Wisconsin, Madison, 1985.
9. J. Flower and A. Kolawa, Express is not just a message passing system: Current and future directions in Express, Parallel Computing 20(1994)597-614.
10. D. Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems 7(1985)80-112.
11. B. Gendron and T. Crainic, Parallel implementations of a branch and bound algorithm for multi-commodity location with balancing requirements, INFOR 33(1993)151-165.
12. A. Grimshaw, W. Strayer and P. Narayan, Dynamic, object-oriented parallel processing, IEEE Parallel and Distributed Technology (May 1993) 33-47.
13. A. Grimshaw, Easy-to-use object-oriented parallel processing with Mental, Computer 26(1993) 39-51.
14. International Business Machines, Inc., AIX 3.2 Commands Reference, Armonk, New York, 1992.
15. L. Kale and S. Krishnan, Charm++: A portable concurrent object oriented system based on C++, Technical Report UIU-CDCS-R-93-1796, Department of Computer Science, University of Illinois Urbana-Champaign, March 1993.
16. A.H. Karp, Programming for parallelism, Computer 20(1987)43-57.
17. P. Larsen, Simple approaches to parallel branch and bound, Parallel Computing 19(1993)143-152.
18. G.-J. Li and B.W. Wah, Coping with anomalies in parallel branch and bound algorithms, IEEE Transactions on Computers 35(1986)568-573.
19. S. Lippman, C++ Primer, Addison-Wesley, Reading MA, 1991.
20. T.A. Marsland, T. Breikreutz and S. Sutphen, A network multi-processor for experiments in parallelism, Concurrency: Practice and Experience 3(1991)203-219.
21. M. Mayer, A parallel branch and bound algorithm for the multi-facility capacity expansion problem using networked RISC workstations, M.S. Thesis, Department of Industrial Engineering, Lehigh University, 1993.
22. M. Mayer, Management of networked workstations as a parallel machine for the solution of optimization problems, Ph.D. Dissertation, Department of Industrial Engineering, Lehigh University, 1995.
23. N. Nedeljkovic and M. Quinn, Data-parallel programming on a network of heterogeneous workstations, Proceedings of the 1st International Symposium on High-Performance Distributed Computing, 1992, pp. 28-36.
24. B. Neuman and S. Rao, The Prospero resource manager: A scalable framework for processor allocation in distributed systems, Concurrency: Practice and Experience 6(1994)339-355.
25. L. Plebani and M. Mayer, Implementing a parallel branch and bound algorithm using networked RISC workstations with Linda, Proceedings of the 4th Industrial Engineering Research Conference, May 1995.
26. E. Pruul, G. Nemhauser and R. Rushmeier, Branch and bound and parallel computation: A historical note, Operations Research Letters 7(1988)65-69.
27. J. Schaeffer et al., The enterprise model for developing distributed applications, IEEE Parallel and Distributed Technology (August 1993) 85-95.
28. Scientific Computing Associates, Inc., C-Linda User's Guide and Reference Manual, New Haven CT, 1993.
29. V. Sunderam, PVM: A framework for parallel distributed computing, Concurrency: Practice and Experience 2(1990)315-339.
30. V. Sunderam et al., The PVM concurrent computing system: Evolution, experiences and trends, Parallel Computing 20(1994)531-545.
31. W. Stevens, Unix Network Programming, Prentice-Hall, Englewood Cliffs, NJ, 1990.
32. L. Wilson, M. Gonzalez and M. Cruess, Experiences in high performance computing with Pleiades and ESP, 1st International Symposium on High Performance Distributed Computing, 1992, pp. 67-76.