Advanced Computer Architecture and Parallel Processing

Advanced Computer Architecture and Parallel Processing

Volumn , Issue , 2005, Pages 1-272

  El Rewini, Hesham ^a   Abd El Barr, Mostafa ^b  

^a SOUTHERN METHODIST UNIVERSITY   (United States)

^b KUWAIT UNIVERSITY   (Kuwait)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956270612     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471478385     Document Type: Book

References (184)

1. Abraham, S. and Padmanabhan, K. Performance of the direct binary n-cube network for multiprocessors. IEEE Transactions on Computers, 38 (7), 1000-1011 (1989).
2. Agrawal, P., Janakiram, V. and Pathak, G. Evaluating the performance of multicomputer configurations. IEEE Transaction on Computers, 19 (5), 23-27 (1986).
3. Almasi, G. and Gottlieb, A. Highly Parallel Computing, Benjamin Cummings, 1989.
4. Al-Tawil, K., Abd-El-Barr, M. and Ashraf, F. A survey and comparison of wormhole routing techniques in mesh networks. IEEE Network, March/April 1997, 38-45 (1997).
5. Bhuyan, L. N. (ed.) Interconnection networks for parallel and distributed processing. Computer (Special issue), 20 (6), 9-75 (1987).
6. Bhuyan, L. N., Yang, Q. and Agrawal, D. P. Performance of multiprocessor interconnection networks. Computer, 22 (2), 25-37 (1989).
7. Chen, W.-T. and Sheu, J.-P. Performance analysis of multiple bus interconnection networks with hierarchical requesting model. IEEE Transactions on Computers, 40 (7), 834-842 (1991).
8. Dasgupta, S. Computer Architecture: A Modern Synthesis, vol. 2; Advanced Topics, John Wiley, 1989.
9. Decegama, A. The Technology of Parallel Processing: Parallel Processing Architectures and VLSI Hardware, Vol. 1, Prentice-Hall, 1989.
10. Dongarra, J. Experimental Parallel Computing Architectures, North-Holland, 1987.
11. Duncan, R. A survey of parallel computer architectures. Computer, 23 (2), 5-16 (1990).
12. El-Rewini, H. and Lewis, T. G. Distributed and Parallel Computing, Manning & Prentice Hall, 1998.
13. Flynn. Computer Architecture: Pipelined and Parallel Processor Design, Jones and Bartlett, 1995.
14. Goodman, J. R. Using cache memory to reduce processor-memory traffic. Proceedings 10th Annual Symposium on Computer Architecture, June 1983, pp. 124-131.
15. Goyal, A. and Agerwala, T. Performance analysis of future shared storage systems. IBM Journal of Research and Development, 28 (1), 95-107 (1984).
16. Hennessy, J. and Patterson, D. Computer Architecture: A Quantitative Approach, Morgan Kaufmann, 1990.
17. Hwang, K. and Briggs, F. A. Computer Architecture and Parallel Processing, McGraw-Hill, 1984.
18. Ibbett, R. N. and Topham, N. P. Architecture of High Performance Computers II, Springer-Verlag, 1989.
19. Juang, J.-Y. and Wah, B. A contention-based bus-control scheme for multiprocessor systems. IEEE Transactions on Computers, 40 (9), 1046-1053 (1991).
20. Lewis, T. G. and El-Rewini, H. Introduction to Parallel Computing, Prentice-Hall, 1992.
21. Linder, D. and Harden, J. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, 40 (1), 2-12 (1991).
22. Moldovan, D. Parallel Processing, from Applications to Systems, Morgan Kaufmann Publishers, 1993.
23. Ni, L. and McKinely, P. A survey of wormhole routing techniques in direct networks. IEEE Computer, February 1993, 62-76 (1993).
24. Patel, J. Performance of processor-memory interconnections for multiprocessor computer systems. IEEE Transactions, 28 (9), 296-304 (1981).
25. Reed, D. and Fujimoto, R. Multicomputer Networks: Message-Based Parallel Processing, MIT Press, 1987.
26. Serlin, O. The Serlin Report On Parallel Processing, No. 54, pp. 8-13, November 1991.
27. Sima, E., Fountain, T. and Kacsuk, P. Advanced Computer Architectures: A Design Space Approach, Addison-Wesley, 1996.
28. Stone, H. High-Performance Computer Architecture, 3rd ed., Addison-Wesley, 1993.
29. The Accelerated Strategic Computing Initiative Report, Lawrence Livermore National Laboratory, 1996.
30. Wilkinson, B. Computer Architecture: Design and Performance, 2nd ed., Prentice-Hall, 1996.
31. Yang, Q. and Zaky, S. Communication performance in multiple-bus systems. IEEE Transactions on Computers, 37 (7), 848-853 (1988).
32. Youn, H. and Chen, C. A comprehensive performance evaluation of crossbar networks. IEEE Transactions on Parallel and Distribute Systems, 4 (5), 481-489 (1993).
33. Zargham, M. Computer Architecture: Single and Parallel Systems, Prentice-Hall, 1996.
34. Abraham, S. and Padmanabhan, K. Performance of the direct binary n-cube network for multiprocessors. IEEE Transactions on Computers, 38 (7), 1000-1011 (1989).
35. Agrawal, P., Janakiram, V. and Pathak, G. Evaluating the performance of multicomputer configurations. IEEE Transaction on Computers, 19 (5), 23-27 (1986).
36. Almasi, G. and Gottlieb, A. Highly Parallel Computing, Benjamin Cummings, 1989.
37. Al-Tawil, K., Abd-El-Barr, M. and Ashraf, F. A survey and comparison of wormhole routing techniques in mesh networks. IEEE Network, March/April 1997, 38-45 (1997).
38. Bhuyan, L., Yang, Q. and Agrawal, D. Performance of multiprocessor interconnection networks. IEEE Computer, 25-37 (1989).
39. Chen, W.-T. and Sheu, J.-P. Performance analysis of multiple bus interconnection networks with hierarchical requesting model. IEEE Transactions on Computers, 40 (7), 834-842, (1991).
40. Dasgupta, S. Computer Architecture: A Modern Synthesis, Vol. 2: Advanced Topics, John Wiley, 1989.
41. Decegama, A. The Technology of Parallel Processing: Parallel Processing Architectures and VLSI Hardware, Vol. 1, Prentice-Hall, 1989.
42. Dongarra, J. Experimental Parallel Computing Architectures, North-Holland, 1987.
43. Goyal, A. and Agerwala, T. Performance analysis of future shared storage systems. IBM Journal of Research and Development, 28 (1), 95-107 (1984).
44. Juang, J.-Y. and Wah, B. A contention-based bus-control scheme for multiprocessor systems, IEEE Transactions on Computers, 40 (9), 1046-1053 (1991).
45. Linder, D. and Harden, J. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, 40 (1), 2-12 (1991).
46. Ni, L. and McKinely, P. A survey of wormhole routing techniques in direct networks. IEEE Computer, February 1993, 62-76 (1993).
47. Patel, J. Performance of processor-memory interconnections for multiprocessor computer systems. IEEE Transactions, 28 (9), 296-304 (1981).
48. Reed, D. and Fujimoto, R. Multicomputer Networks: Message-Based Parallel Processing, MIT Press, 1987.
49. Sima, E., Fountain, T. and Kacsuk, P. Advanced Computer Architectures: A Design Space Approach, Addison-Wesley, 1996.
50. Stone, H. High Performance Computer Architecture, 3rd edition, Addison Wesley, 1993.
51. Wilkinson, B. Computer Architecture: Design and Performance, 2nd edition, Prentice-Hall, 1996.
52. Yang, Q. and Zaky, S. Communication performance in multiple-bus systems. IEEE Transactions on Computers, 37 (7), 848-853 (1988).
53. Youn, H. and Chen, C. A comprehensive performance evaluation of crossbar networks. IEEE Transactions on Parallel and Distribute Systems, 4 (5), 481-489 (1993).
54. Zargham, M. Computer Architecture: Single and Parallel Systems, Prentice-Hall, 1996.
55. Abraham, S. and Padmanabhan, K. Performance of the direct binary n-cube network for multiprocessors. IEEE Transactions on Computers, 38 (7), 1000-1011 (1989).
56. Agrawal, P., Janakiram, V. and Pathak, G. Evaluating the performance of multicomputer configurations. IEEE Transaction on Computers, 19 (5), 23-27 (1986).
57. Al-Tawil, K., Abd-El-Barr, M. and Ashraf, F. A survey and comparison of wormhole routing techniques in mesh networks. IEEE Network, March/April 1997, 38-45 (1997).
58. Almasi, G. and Gottlieb, A. Highly Parallel Computing, Benjamin Cummings, 1989.
59. Bell, G. Why there won't be apps: The problem with MPPs. IEEE Parallel and Distribute Technology, Fall 1994, 5-6 (1994).
60. Bhuyan, L., Yang, Q. and Agrawal, D. Performance of multiprocessor interconnection networks. IEEE Computer, 25-37 (1989).
61. Chan, Y., Sudarsanam, A. and Wolf, A. The effect of compiler flag tuning on SPEC benchmark performance. Computer Architecture News, 22 (4), 60-70 (1994).
62. Chen, W.-T. and Sheu, J.-P. Performance analysis of multiple bus interconnection networks with hierarchical requesting model. IEEE Transactions on Computers, 40 (7), 834-842 (1991).
63. Cosnard, M., Robert, Y. and Toourancheau, B. Evaluating speedups on distributed memory architectures. Parallel Computing, 10, 247-253 (1989).
64. Cosnard, M. and Trystram, D. Parallel Algorithms and Architectures, International Thomson Computer Press, 1995.
65. Curnow, H. and Wichmann, B. A synthestic benchmark. The Computer Journal, 19 (1), 43-49 (1976).
66. Dasgupta, S. Computer Architecture: A Modern Synthesis, Vol. 2: Advanced Topics, John Wiley, 1989.
67. Decegama, A. The Technology of Parallel Processing: Parallel Processing Architectures and VLSI Hardware, Vol. 1, Prentice-Hall, 1989.
68. Dixit, K. and Reilly, J. SPEC developing new component benchmark suits. SPEC Newsletter, 3 (4), 14-17 (1991).
69. Dixit, K. The SPEC benchmarks. Parallel Computing, 17, 1195-1209 (1991).
70. Dongarra, J. Experimental Parallel Computing Architectures, North-Holland, 1987.
71. Eager, D., Zahorjan, J. and Lazowska, E. Speedup versus efficiency in parallel systems. IEEE Transactions on Computers, 38 (3), 408-423 (1989).
72. Ein-Dor, P. Grosch's law revisited: CPU power and the cost of computation. Communications of the ACM, 28 (2), 142-151 (1985).
73. Gee, J., Hill, M., Pnevmatikatos, D. and Smith, A. Cache performance of the SPEC92 benchmark suite. IEEE Micro, 15 (4), 17-27 (1993).
74. Giladi, R. and Ahituv, N. SPEC as a performance evaluation measure. Computer 28 (8), 33-42 (1995).
75. Goyal, A. and Agerwala, T. Performance analysis of future shared storage systems. IBM Journal of Research and Development, 28 (1), 95-107 (1984).
76. Grama, A., Gupta, A. and Kumar, V. Isoefficiency: Measuring the scalability of parallel algorithms and architectures. IEEE Parallel & Distribute Technology, 12-21 (1993).
77. Gupta, A. and Kumar, V. Performance properties of large scale parallel systems. Journal of Parallel and Distribute Computing, 19, 234-244 (1993).
78. Gustafson, J. Reevaluating Amdahl's law. Communications of the ACM, 31 (5), 532-533 (1988).
79. Henning, J. L. SPEC CPU2000: Measuring CPU performance in the new millennium. IEEE Computer, July 2000, 28-34 (2000).
80. Hill, M. What is scalability? Computer Architecture News, 18 (4), 18-21 (1990).
81. Juang, J.-Y. and Wah, B. A contention-based bus-control scheme for multiprocessor systems. IEEE Transactions on Computers, 40 (9), 1046-1053 (1991).
82. Kumar, V. and Gupta, A. Analyzing scalability of parallel algorithms and architectures. Journal of Parallel and Distributed Computing, 22, 379-391 (1994).
83. Linder, D. and Harden, J. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, 40 (1), 2-12 (1991).
84. Lubeck, O., Moore, J. and Mendez, R. A benchmark comparison of three supercomputers. Computer, 18 (12), 10-24 (1985).
85. Mirghafori, N., Jacoby, M. and Patterson, D. Truth in SPEC benchmarks. Computer Architecture News, 23 (5), 34-42 (1995).
86. Ni, L. and McKinely, P. A survey of wormhole routing techniques in direct networks. IEEE Computer, 62-76 (1993).
87. Patel, J. Performance of processor-memory interconnections for multiprocessor computer systems. IEEE Transactions, 28 (9), 296-304 (1981).
88. Reed, D. and Fujimoto, R. Multicomputer Networks: Message-Based Parallel Processing, MIT Press, 1987.
89. Sima, E., Fountain, T. and Kacsuk, P. Advanced Computer Architectures: A Design Space Approach, Addison Wesley, 1996.
90. Smith, J. Characterizing computer performance with a single number. Communications of the ACM, 31 (10), 1202-1206 (1988). SPEC Newsletters, 1-10, 1989-1998.
91. Stone, H. High Performance Computer Architecture, 3rd edition, Addison Wesley, 1993.
92. Wilkinson, B. Computer Architecture: Design and Performance, 2nd edition, Prentice-Hall, 1996.
93. Yang, Q. and Zaky, S. Communication performance in multiple-bus systems. IEEE Transactions on Computers, 37 (7), 848-853 (1988).
94. Youn, H. and Chen, C. A comprehensive performance evaluation of crossbar networks. IEEE Transactions on Parallel and Distribute Systems, 4 (5), 481-489 (1993).
95. Zargham, M. Computer Architecture: Single and Parallel Systems, Prentice-Hall, 1996.
96. Bhuyan, L. N. (ed.) Interconnection networks for parallel and distributed processing. Computer (Special issue), 20 (6), 9-75 (1987).
97. Bhuyan, L. N., Yang, Q. and Agrawal, D. P. Performance of multiprocessor interconnection networks. Computer, 22 (2), 25-37 (1989).
98. Dubois, M. and Thakkar, S. Cache architectures in tightly coupled multiprocessors. Computer, 23 (6), 9-85 (1990).
99. Duncan, R. A survey of parallel computer architectures. Computer, 23 (2), 5-16 (1990).
100. El-Rewini, H. and Lewis, T. G. Distributed and Parallel Computing, Manning and Prentice Hall, 1998.
101. Flynn, M. Computer Architecture: Pipelined and Parallel Processor Design, Jones and Bartlett, 1995.
102. Goodman, J. R. Using cache memory to reduce processor-memory traffic. Proceedings 10th Annual Symposium on Computer Architecture, June 1983, pp. 124-131.
103. Hennessy, J. and Patterson, D. Computer Architecture: A Quantitative Approach, Morgan Kaufmann, 1990.
104. Hwang, K. and Briggs, F. A. Computer Architecture and Parallel Processing, McGraw-Hill, 1984.
105. Ibbett, R. N. and Topham, N. P. Architecture of High Performance Computers II, Springer-Verlag, 1989.
106. Lewis, T. G. and El-Rewini, H. Introduction to Parallel Computing, Prentice-Hall, 1992.
107. Stone, H. High-Performance Computer Architecture, 3rd edition, Addison-Wesley, 1993.
108. Al-Tawil, K., Abd-El-Barr, M. and Ashraf, F. A survey and comparison of wormhole routing techniques in mesh networks. IEEE Network, 38-45 (1997).
109. Almasi/Gottlieb. Highly Parallel Computing, 1989.
110. Ashraf, F. Routing in Multicomputer Networks: A Classification and Comparison, MS thesis, Department of Information and Computer Science, College of Computer Science and Engineering, King Fahd University of Petroleum and Minerals (KFUPM), June 1996.
111. Dally, W. and Seitz, C. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36 (5), 547-553 (1987).
112. Dikaiakos, M. D., Steiglits, K. and Rogers, A. A Comparison of Techniques Used for Mapping Parallel Algorithms to Message-Passing Multiprocessors, Department of Aston, Washington University, Seattle, WA, USA, 1994, pp. 434-442.
113. Eicken, T., Culler, D., Goldstein, S. and Schauser, K. Active Messages: A Mechanism for Integrated Communication and Computation, Proceedings 19th International Symposium on Computer Architecture, ACM Press, May 1992, Gold Coast, Australia.
114. Elnozahy, M., Alvisi, L., Wang, Y.-M. and Johnson, D. A Survey of Rollback-Recovery Protocols in Message Massing Systems.
115. Hsu, J.-M. and Banerjee, P. A Message Passing Coprocessor for Distributed Memory Multicomputers, Coordinated Scientific Lab., Illinois Univ., Urbana, IL, USA, 1990, pp. 720-729.
116. Johnson, S. and Ho, C.-T. High performance communications in processor networks. Proceedings of the 16th ACM Annual International Symposium on Computer Architecture, 150-157 (1989).
117. Klaiber, A. C. and Levy, H. M. Comparison of Message Passing and Shared Memory Architecture for Data Parallel Program, Department of Computer Science and Engineering, Washington University, Seattle, WA, USA, 1994, pp. 94-105.
118. Morin, S. Implementing the Message Passing Interface Standard in Java, MSc thesis, Electrical and Computing Engineering Department, University of Massachusetts, September 2000.
119. Ni, L. and McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer Magazine, 26 (2), 62-76 (1993).
120. PACT. Message Passing Fundamentals, PACT Training Group, NCSA 2001, University of Illinois, 2001.
121. Panda, D. Issues in designing efficient and practical algorithms for collective communication on wormhole-routed systems, Proceedings of the 1995 ICCP Workshop on Challenges for Parallel Processing, Vol. I, 8-15 (1995).
122. Pierce, P. The NX message passing interface. Parallel Computing, 20 (4), 463-480 (1994).
123. Richard, Y. KAIN, Advanced Computer Architecture, A System Design Approach, Prentice-Hall, 1995.
124. Stone. High-Performance Computer Architecture, 3rd edition, Addison-Wesley, 1993.
125. Suanya, R. and Birtwistle, G. (editors) VLSI and Parallel Computation, Morgan Kaufmann Publishing Co., 1990.
126. Wrllkinsen, B. Computer Architecture: Design and Performance, Prentice-Hall, 1996.
127. Agrawal, A., Chandra, and Snir, M. Communication complexity of PRAM. Theory of Computer Science, 71, 3-28 (1990).
128. Akl, S. G. Parallel Computation: Models and Methods, Prentice-Hall, 1997.
129. Angluin, D. Local and global properties in networks of processors, Proc. of the 12th ACM Symposium on Theory of Computing, pp. 82-93.
130. Baase, S. Computer Algorithms: Introduction to Design and Analysis, 2nd edition, Addison-Wesley, 1988.
131. Borodian and Hopcroft, J. E. Routing, merging and sorting on parallel models of computation. Journal of Computer System. Science, 30, 130-145 (1985).
132. Brent, R. P. The parallel evaluation of general arithmetic expression. Journal of ACM, 21, 201-206 (1974).
133. Chang and Roberts, R. An improved algorithm for decentralized extrema-finding in circular configurations of processes. Communication of the ACM, 22 (5), 281-283 (1979).
134. Cosnard, M. and Trystram, D. Parallel Algorithms and Architecture, International Thomson Computer Press, 1996.
135. Hirschberg, D. and Sinclair, J. Decentralized extrema-finding in circular configuration of process, Communication of the ACM, 23, 627-628, (1980).
136. JaJa, J. An Introduction to Parallel Algorithms, Addison-Wesley, 1992.
137. Kronsjo, L. PRAM Models, in A. Y. Zomaya, Ed., Handbook of Parallel and Distributed Computing, McGraw-Hill, Chapter 6, 1996, pp. 163-191.
138. Kumar, V., Grama, A., Gupta, A. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin Cumming, 1994.
139. Lakshmivarahan, S. and Dhall, S. Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems, McGraw-Hill, 1990.
140. Le Lann, G. Distributed Systems-Towards A Formal Approach, Information Processing 77 (Toronto, August 1977), Vol. 7 of Proceedings of IFIP Congress, North-Holland, Amsterdam, 1977, pp. 155-160.
141. Lynch, N. Distributed Algorithms, Morgan Kaufmann, 1996.
142. Becker, D. J., Sterling, T., Savarese, D., Dorband, J. E., Ranawake, U. A. and Packer, C. V. BEOWULF: A parallel workstation for scientific computation. Proceedings of the 1995 International Conference on Parallel Processing (ICPP), 1995, pp. 11-14.
143. Boden, N. J., Cohen, D., Felderman, R. E., Kulawik, A. E., Seitz, C. L., Seizovic, J. N. and Su, W.-K. Myrinet-A gigabit-per-second local-area network. IEEE Micro (1995).
144. Comer, D. E. Internetworking with TCP/IP: Principle, Protocols, and Architectures, 4th edition, Prentice-Hall, 2000.
145. Douglis, F. and Foster, I. The Grid Grows Up. IEEE Internet Computing (2003).
146. Foster, I. The Grid: A new infrastructure for 21st century science. Physics Today, 55 (2), 42-47 (2002).
147. Foster, I., Kesselman, C. and Tuecke, S. The anatomy of the Grid: Enabling scalable virtual organizations. International Journal of Supercomputer Applications, 15 (3) (2001).
148. Hwang, K. et al. Designing SSI clusters with hierarchical checkpoints and single I/O space. IEEE Concurrency, 7 (1), (1999).
149. Petrini, F., Feng, W.-C., Hoisie, A., Coll, S. and Frachtenberg, E. The Quadrics network: High performance clustering technology. IEEE Micro (2002).
150. Warren, M. S., Germann, T. C., Lomdahl, P. S., Beazley, D. M. and Salmon, J. K. Avalon: An Alpha/Linux cluster achieves 10 Gflops for $150k. In Supercomputing'98, Los Alamitos, 1998, IEEE Comp. Soc.
151. Geist, A. and Sunderam, V. Network-based concurrent computing on the PVM system. Concurrency: Practice & Experience, 4 (4), 293-311 (1992).
152. Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R. and Sunderam, V. PVM: Parallel Virtual Machine-A User's Guide and Tutorial for Network Parallel Computing, MIT Press, 1994.
153. Lundell, S., Smith, D. and El-Rewini, H. Synchronous Communication for PVM. Proceedings of the 8th IASTED International Conference on Parallel and Distributed Computing and Systems, Chicago, October 1996, pp. 278-282.
154. Sunderam, V. PVM: A framework for parallel distributed computing. Concurrency: Practice & Experience, 2 (4), 1990.
155. Geist, A., Gropp, W., Huss-Lederman, S., Lumsdaine, A., Lusk, E., Saphir, W., Skjellum, A. and Snir, M. MPI-2: Extending the Message-Passing Interface, Euro-Par'96 Parallel Processing, Lecture Notes in Computer Science, Vol. 1, No. 1123, Springer Verlag, 1996, pp. 128-135.
156. Gropp, W. and Lusk, E. User's Guide for MPICH, a Portable Implementation of MPI. Technical Report ANL-96/6, Argonne National Laboratory, 1994.
157. Gropp, W., Lusk, E. and Skjellum, A. Using MPI: Portable Parallel Programming with the Message-Passing Interface. MIT Press, Cambridge, 1994.
158. Gropp, W., Lusk, E., Doss, N. and Skjellum, A. A high-performance, portable implementation of the MPI message passing interface standard. Parallel Computing Journal, 22, 789-828 (1996).
159. Message Passing Interface Forum. MPI: A message-passing interface standard. International Journal of Supercomputer Applications, 8 (3/4), 165-416 (1994).
160. Pacheco, P. Parallel Programming with MPI, Morgan Kaufmann, 1997.
161. Snir, M., Otto, S., Huss-Lederman, S., Walker, D. and Dongarra, J. MPI: The Complete Reference, MIT Press, Cambridge, 1995.
162. Ali, H. and El-Rewini, H. An optimal algorithm for scheduling interval ordered tasks with communication on N processors. Journal of Computer and System Sciences, 51 (2), (1995).
163. Ali, H. and El-Rewini, H. Task allocation in distributed systems: A split graph model. Journal of Combinatorial Mathematics and Combinatorial Computing, 14, 1993, 15-32 (1993).
164. Ali, H. and El-Rewini, H. On the intractability of task allocation in distributed systems. Parallel Processing Letters (1994).
165. Bokhari, S. A shortest tree algorithm for optimal assignments across space and time in distributed processor system. IEEE Transaction on Software Engineering, SE-7 (6) (1981).
166. Chen, S. et al. A Selection Theory and Methodology for Heterogeneous Supercomputing, Proc. Workshop on Heterogeneous Processing, IEEE CS Press, Los Alamitos, CA, Order No. 3532-02, 1993.
167. Coffman, E. G. Computer and Job-Shop Scheduling Theory, John Wiley, 1976.
168. El-Rewini, H. and Lewis, T. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, 138-153, 1990.
169. El-Rewini, H. and Ali, H. On considering communication in scheduling task graphs on parallel processors. Journal of Parallel Algorithms and Applications, 3, 177-191 (1994).
170. El-Rewini, H., Lewis, T. and Ali, H. Task Scheduling in Parallel and Distributed Systems, Prentice-Hall, 1994.
171. El-Rewini, H. and Ali, H. Static scheduling of containing conditional branching in parallel programs. Journal of Parallel and Distributed Computing, 41-54, 1995.
172. Freund, R. and Siegel, H. Heterogeneous processing. IEEE Computer, 26, 13-17 (1993).
173. Fujii, M., Kasami, T. and Ninomiya, K. Optimal sequencing of two equivalent processors. SIAM Journal of Applied Mathematics, 17 (4) (1969).
174. Gabow, H. An almost linear algorithm for two-processor scheduling. Journal of ACM, 29 (3), 766-780 (1982).
175. Gerasoulis and Yang, T. A comparison of clustering heuristics for scheduling DAGs on multiprocessors. Journal of Parallel and Distributed Computing, 16 (4), 276-291 (1992).
176. Hu, T. C. Parallel sequencing and assembly line problems. Operations Research, 9 (6), 841-848 (1961).
177. Lewis, T. and El-Rewini, H. Parallax: A tool for parallel program scheduling. IEEE Parallel and Distributed Technology: Systems and Applications, 1 (2), 62-72 (1993).
178. Lee, D. and Kim, M. Optimal task assignment in linear array networks. IEEE Transactions on Computers, 41 (7), 877-880 (1992).
179. Lo, V. Heuristic algorithms for task assignment in distributed systems. IEEE Transactions on Computers, 37 (11), 1384-1397 (1988).
180. Papadimitriou, H. and Yannakakis, M. Scheduling interval-ordered tasks. SIAM Journal of Computing, 8, 405-409 (1979).
181. Sarkar, V. Automatic partitioning of a program dependence graph into parallel tasks. IBM Journal Res. Develop., 35 (5/6), (1991).
182. Sethi, R. Scheduling graphs on two processors. SIAM Journal of Computing, 5 (1), 73-82 (1976).
183. Stone, H. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transaction on Software Engineering, 85-93 (1977).
184. Ullman, J. NP-complete scheduling problems. Journal of Computer and System Sciences, 10, 384-393 (1975).