This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Partitioning Techniques for Large-Grained Parallelism
December 1988 (vol. 37 no. 12)
pp. 1627-1634
A model is presented for parallel processing in loosely coupled multiprocessing environments, such as networks of computer workstations, that are amenable to large-grained parallelism. The model takes into account the overhead involved in data communication to and from a remote processor and can be used to partition a large class of computations optimally, consisting of computations that can be

[1] R. Agrawal and A. K. Ezzat, "Processor sharing in NEST: A network of computer workstations," inProc. IEEE 1st Int. Conf. Computer Workstations, San Jose, CA, Nov. 1985, pp. 198-208.
[2] P. Agrawal and R. Agrawal, "Software implementation of a recursive fault tolerance algorithm on a network of computers," inProc. 13th Int. Symp. Comput. Architecture, Tokyo, Japan, June 1986, pp. 65- 72.
[3] R. Agrawal and A. K. Ezzat, "Location independent remote execution in NEST,"IEEE Trans. Software Eng., vol. SE-13, pp. 905-912, Aug. 1987.
[4] E. H. Baalbergen, "Parallel and distributed compilations in loosely-coupled systems: A case study," presented at IEEE Workshop Large Grained Parallelism, Providence, RI, Oct. 1986.
[5] F. H. Baskett, J. H. Howard, and J. T. Montague, "Task communication in DEMOS," inProc. 6th ACM Symp. Oper. Syst. Principles, Nov. 1977, pp. 23-31.
[6] M. Beck, D. Bitton, and W. K. Wilkinson, "Sorting large files on a backend multiprocessor," inProc. 1986 Int. Conf. Parallel Processing, St. Charles, IL, Aug. 1986.
[7] H. J. Boehm and W. Zwaenepoel, "Parallel attribute evaluation on a local network," presented at IEEE Workshop Large Grained Parallelism, Providence, RI, Oct. 1986.
[8] W. A. Burnette, R. H. Canaday, and D. H. Fishman, "MAX: A distributed system," Tech. Memo. AT&T Bell Lab., Murray Hill, NJ, 1983.
[9] G. B. Dantzig,Linear Programming and Extensions. Princeton, NJ: Princeton Univ. Press, 1963.
[10] D. J. DeWitt, R. Finkel, and M. Solomon, "The CRYSTAL multicomputer: Design and implementation experience,"IEEE Trans. Software Eng., vol. 13, Aug. 1987.
[11] F. Douglis and J. Ousterhout, "Process migration in the Sprite operating system," inProc. 7th Int. Conf. Distributed Comput. Syst., Berlin, West Germany, Sept. 1987, pp. 18-25.
[12] A. K. Ezzat and R. Agrawal, "Making oneself known in a distributed world," inProc. 1985 Int. Conf. Parallel Processing, St. Charles, IL, Aug. 1985, pp. 139-142.
[13] D. H. Fishman, M. Lai, and K. Wilkinson, "Overview of the Jasmin database machine," inProc. SIGMOD '84, alsoSIGMOD Rec., vol. 14, no. 2, pp. 234-238, 1984.
[14] E. J. Gilbert, "Algorithm partitioning tools for a high-performance multiprocessor," Ph.D. dissertation, STAN-CS-83-946, Comput. Sci. Dep., Stanford Univ., Stanford, CA, Feb. 1983.
[15] H. V. Jagadish, "Techniques for the design of parallel and pipelined VLSI systems for numerical computations," Ph.D. dissertation, Inform. Syst. Lab., Stanford Univ., 1985.
[16] H. V. Jagadish, S. K. Rao, and T. Kailath, "Multiprocessor architectures for iterative algorithms,"Proc. IEEE, Aug. 1987.
[17] L. Kleinrock, "Distributed systems,"IEEE Computer, vol. 18, pp. 90-103, Nov. 1985.
[18] D. Kuck, R. Kuhn, B. Leasure, and M. Wolfe, "The structure of an advanced retargettable vectorizer," inProc. COMPSAC '80, 1980.
[19] T. J. Leblanc, "The design and performance of high-level language primitives for distributed programming," Ph.D. dissertation, Comput. Sci. Dep., Univ. Wisconsin, Madison, 1982.
[20] O. L. Mangasarian,Non-Linear Programming. New York: Mc-Graw-Hill, 1969.
[21] T. A. Marsland, M. Olafsson, and J. Schaeffer, "Multiprocessor tree-search experiments," inAdvances in Computer Chess 4, D. Beal, Ed. Oxford, UK: Pergamon, 1985, pp. 37-51.
[22] D. A. Nichols, "Using idle workstations in a shared computing environment," inProc. 11th Symp. on Operating Syst. Principles, Nov. 1987, pp. 5-12.
[23] S. K. Rao, "Regular iterative algorithms and their implementations on processor arrays," Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1985.
[24] G. R. Sager, J. A. Melber, and K. T. Fong, "The Oryx/Pecos operating system,"AT&T Tech. J., vol. 64, pp. 251-268, Jan. 1985.
[25] S. Sahni, "Scheduling multipipeline and multiprocessor computers,"IEEE Trans. Comput., vol. C-33, pp. 637-645, July 1984.
[26] J. F. Shoch and J. A. Hupp, "The 'Worm' programs--early experience with a distributed computation,"Commun. ACM, vol. 25, no. 3, pp. 172-180, Mar. 1982.
[27] M. H. Solomon and R. A. Finkel, "The Roscoe distributed operating system," inProc. ACM-SIGOPS 7th Symp. Oper. Syst. Principles, Dec. 1979, pp. 108-114.
[28] M. Stumm and D. Cheriton, "Distributed parallel computations under V," presented atIEEE Workshop Large Grained Parallelism, Providence, RI, Oct. 1986.
[29] M. Theimer, K. Lantz, and D. Cheriton, "Preemptable Remote Execution Facilities for the V-System,"Proc. 10th Symp. Operating Syst. Principles, Dec. 1985, pp. 2-12.

Index Terms:
parallel processing; loosely coupled; multiprocessing environments; large-grained parallelism; model; optimal partition; parallel processing.
Citation:
R. Agrawal, H.V. Jagadish, "Partitioning Techniques for Large-Grained Parallelism," IEEE Transactions on Computers, vol. 37, no. 12, pp. 1627-1634, Dec. 1988, doi:10.1109/12.9739
Usage of this product signifies your acceptance of the Terms of Use.