BIBLIOGRAPHY

Aho et al. 74 Alfred V. Aho, John E. Hopcroft, and Jeffery D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mas­sachusetts, 1974.

Bailey-Cuny 86 Duane A. Bailey and Janice E. Cuny, "An efficient embedding of large trees in processor grids," Proceedings of 1986 International Confer­ence on Parallel Processing, pp. 819-822, August, 1986.

Barnes et al. 68 G. Barnes, R. Brown, M. Katz, D. Kuck, D. Slot­nick, and R. Stoker, "The Illiac-IV computer," IEEE Transactions on Computers, vol. C-17, pp. 746-757, 1968.

Batcher 80 K. Batcher, "Design of a massively parallel pro­cessor," IEEE Transactions on Computers, vol. C-29, pp. 836-840, September 19~0.

Berge 73 Claude Berge, Graphs and Hypergraphs, North­Holland, Amsterdam, 1973.

Berger-Bokhari 85 Marsha J. Berger and Shahid H. Bokhari" "A partitioning strategy for PDEs across multiproces­sors," Proceedings of the 1985 International Conference on Parallel Processing, pp. 166-170, August 1985.

Berger-Bokhari 87 Marsha J. Berger and Shahid H. Bokhari, "A par­titioning Strategy for non-uniform problems across multiprocessors," IEEE Transactions on

140

Computers, vol. C-36, pp. 570-580, May 1987.

Berman et al. 85 Francine Berman, Michael Goodrich, Charles Koelbel, W. J. Robison III, and Karen Showell, "Prep-P: A mapping preprocessor for CHiP archi­tectures," Proceedings of the 1985 International Conference on Parallel Processing, pp. 731-733, August 1985.

Berman-Snyder 84 Francine Berman and Lawrence Snyder, "On mapping parallel algorithms into parallel architec­tures," Proceedings of the 1984 International Conference on Parallel Processing, pp. 307-309, August 1984.

Bokhari 79 Shahid H. Bokhari, "Dual processor scheduling with dynamic reassignment," IEEE Transactions on Software Engineering, vol. SE-5, no. 5, pp. 341-349, July 1979.

Bokhari 81a Shahid H. Bokhari, "On the mapping problem," IEEE Transactions on Computers, vol. C-30, pp. 207-214, March 1981.

Bokhari 81b Shahid H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor system," IEEE Transactions on Software Engineering, vol. SE-7, no. 6, pp. 583-589, November 1981.

Bokhari 87 Shahid H. Bokhari, "Partitioning problems in parallel, pipelined and distributed computing," IEEE Transactions on Computers, to appear in 1987.

Bolch et al. 83 G. Bolch, F. Hofmann, B. Hoppe, H. J. Kolb, C. U. Linster, R. Polzer, W. Schussler, G.

Bibliography

Bollobas 79

Burr 82

Carstensen 83

Chughtai 85

Coffman 76

Corne iI-Read 77

Deo 74

Dijkstra 59

141

Wackersreuther, and F. X. Wurm, "A multipro­cessor system for simulating data transmission systems (MUPSI)," Microprocessing and Microprogramming, vol. 12, no. 5, pp. 267-277, December 1983.

Bela Bollobas, Graph Theory: An Introductory Course, Springer-Verlag, New York, 1979.

Stefan A. Burr (ed.), The Mathematics of Net­works, American Mathematical Society­Proceedings of Symposia in Applied Mathematics, Providence, 1982.

Patricia J. Carstensen, The Complexity of Some Problems in Parametric Linear and Combina­torial Programming, Ph.D. Thesis, Department of Mathematics, University of Michigan, 1983.

M. Ashraf Chughtai, "Complete binary spanning trees of the eight nearest neighbor array," IEEE Transactions on Computers, vol. C-34, pp. 547-549, June 1985.

Edward G. Coffman (ed.), Computer and Job­Shop Scheduling Theory, Wiley, New York, 1976.

D. Corneil and R. C. Read, "The graph isomor­phism disease," Journal of Graph Theory, vol. 1, pp. 339-363, Winter, 1977.

Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, New Jersey, 1974.

Edsger W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik,

142

vol. 1, pp. 269-271, 1959.

Dinic 70 E. A. Dinie, "Algorithm for the solution of a problem of maximum flow in a network with power estimation," Soviet Mathematics: Doklady, vol. 11, no. 5, pp. 1277-1280, 1970.

Doty et al. 82 K. W. Doty, P. L. McEntire, and J. G. O'Reilly, "Task allocation in a distributed computer sys­tem," Proceedings of the IEEE Infocom 82, pp. 33-38, 1982.

Edmonds-Karp 72 Jack Edmonds and Richard M. Karp, "Theoretical improvements in algorithmic efficiency for net­work flow algorithms," Journal of the ACM, vol. 19, no. 2, pp. 248-264, April 1972.

Eisner-Severance 76 Mark J. Eisner and Dennis G. Severance, "Mathematical techniques for efficient record seg­mentation in large databases," Journal of the ACM, vol. 23, no. 4, pp. 619-635, October 1976.

Even 73 Shimon Even, Algorithmic Combinatorics, Mac­millan, New York, 1973.

Even 79 Shimon Even, Graph Algorithms, Computer Sci­ence Press, Potomac, Maryland, 1979.

Foley-van Dam 82 James D. Foley and Andries van Dam, Funda­mentals of Interactive Computer Graphics, Addison-Wesley, Reading, Massachusetts, 1982.

Ford-Fulkerson 62 L. R. Ford and D. R. Fulkerson, Flows in Net­works, Princeton University Press, Princeton, New Jersey, 1962.

Bibliography 143

Garey-Johnson 79 Michael R. Garey and David S. Johnson, Comput­ers and Intractability, W. H. Freeman, New York, 1979.

Gursky 77 M. Gursky, Private Communication, 1977.

Gusfield 83 Dan Gusfield, "Parametric combinatorial comput­ing and a problem of program module distribu­tion," Journal of the ACM, vol. 30, no. 3, pp. 551-563, July 1983.

Harary 69 Frank Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts, 1969.

Hedlund-Snyder 82 Kye S. Hedlund and Lawrence Snyder, "Wafer scale integration of configurable highly parallel (CHiP) processors," Proceedings of the 1982 International Conference on Parallel Processing, pp. 262-264, August 1982.

Hoffman 82 Christoph M. Hoffmann, in Group-Theoretic Algorithms and Graph Isomorphism, Springer­Verlag, Berlin, 1982.

Hoshino et al. 83 T. Hoshino, T. Shirakawa, T. Kamimura, T. Kageyama, K. Takenouochi, H. Abe, S. Sekigu­chi, Y. Oyanagi, and K. Toshio, "Highly parallel processor array 'PAX' for wide scientific applica­tions," Proceedings of the 1983 International Conference on Parallel Processing, pp. 95-105, August 1983.

Hoshino 86 Tsutomo Hoshino, "An invitation to the world of PAX," IEEE Computer, vol. 19, pp. 68-79, May 1986.

144

Hu 82

Iqbal 86

Iqbal et aI. 86

Jordan 78

Karzanov 74

Larson et al. 82

Lawler 76

Leuker-Booth 79

Te Chiang Hu, in Combinatorial Algorithms, Addison-Wesley, Reading, MA, 1982.

M. Ashraf Iqbal, "Approximate algorithms for partitioning and assignment problems," ICASE Report 86-40 NASA Contractor Report 178130, June 1986.

M. Ashraf Iqbal, Joel H. Saltz, and Shahid H. Bokhari, "A comparative analysis of static and dynamic load balancing strategies," Proceedings of the 1986 International Conference on Parallel Processing, pp. 1040-1047, August 1986.

Harry F. Jordan, "A special purpose architecture for finite element analysis," Proceedings of the 1978 International Conference on Parallel Pro­cessing, pp. 263-266, August 1978.

A. V. Karzanov, "Determining the maximal flow in a network by the method of preflows," Soviet Mathematics: Doklady, vol. 15, no. 2, pp. 434-437, 1974.

Robert E. Larson, Paul E. McIntyre, and John G. O'Reilly, Tutorial: Distributed Control, IEEE Computer Society Press, Silver Spring, MD, 1982.

Eugene L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Wins­ton, New York, 1976.

George S. Leuker and Kellogg S. Booth, "A linear time algorithm for deciding interval graph isomorphism," Journal of the ACM, vol. 26, pp. 183-195, 1979.

Bibliography 145

Lo 84 Virginia M. Lo, "Heuristic algorithms for task assignments in distributed systems," Proceedings of the 4th International Conference on Distributed Processing Systems, pp. 30-39, May 1984.

Luks 80 Eugene M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time," Journal of Computers and System Sci­ences, vol. 25, pp. 42-65, 1980.

Matelan 85 Nicolas Matelan, "The FlexJ32 MultiComputer," Proceedings of the 12th International Symposium on Computer Architecture, pp. 209-213, June 1985.

Metcalfe-Boggs 76 Robert M. Metcalfe and David R. Boggs, "Ether­net: distributed packet switching for local com­puter networks," Communications of the ACM, vol. 19, pp. 395-404, July, 1976.

Michel-van Dam 76 Janet Michel and Andries van Dam, "Experience with distributed processing on a hosUsatellite sys­tem," Computer Graphics (SIGGRAPH Newsletter), vol. 10, no. 2, 1976.

Price-Pooch 82 Camille C. Price and Udo W. Pooch, "Search Techniques for a nonlinear multiprocessor scheduling problem," Naval Research Logistics Quarterly, vol. 29, no. 2, pp. 213-233, June 1982.

Rao et al. 79 Gururaj S. Rao, Harold S. Stone, and T. C. Hu, , 'Assignment of tasks in a distributed processor system with limited memory," IEEE Transactions on Computers, vol. C-28, no. 4, pp. 291-299, April 1979.

146

Roberts 78

Saltz 85

Snyder 82

Sternberg 83

Stone 77a

Stone 77b

Stone 78

Sun 86

Fred S. Roberts, Graph Theory and its Applica­tions to Problems of Society, SIAM CBMS-NSF Regional Conference Series in Applied Mathemat­ics, Philadelphia, 1978.

Joel H. Saltz, Parallel and Adaptive Algorithms for Problems in Scientific and Medical Comput­ing, Ph.D. Thesis, Dept. of Computer Science, Duke University, 1985.

Lawrence Snyder, "Introduction to the Configurable Highly Parallel Computer," IEEE Computer, vol. 15, pp. 47-56, January 1982.

Stanley R. Sternberg, "Biomedical image process­ing," IEEE Computer, vol. 16, no. 1, pp. 22-34, January 1983.

Harold S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms," IEEE Tran­sactions on Software Engineering, vol. SE-3, no. 1, pp. 85-93, January 1977.

Harold S. Stone, "Program assignment in three­processor systems and tricutset partitioning of graphs," Tech. Report No. ECE-CS-77-7, Depart­ment of Electrical & Computer Engineering, University of Massachusetts, Amherst, 1977.

Harold S. Stone, "Critical load factors in two­processor distributed systems," IEEE Transac­tions on Software Engineering, vol. SE-4, no. 3, pp. 254-258, May 1978.

Sun Microsystems, Sun System Overview, Sun Microsystems, Part No. 800-1300-02, Mountain View, California, February 1986.

Bibliography 147

Tarjan 83 Robert E. Tarjan, Data Structures and Network Algorithms, SIAM CBMS-NSF Regional Confer­ence Series in Applied Mathematics, Philadelphia, 1983.

Towsley 86 Donald F. Towsley, "Allocating programs con­taining branches and loops within a multiple pro­cessor system," IEEE Transactions on Software Engineering, vol. SE-12, pp. 1018-1024, October 1986.

Turner 80 Joshua Turner, "The structure of modular pro­grams," Communications of the ACM, vol. 23, no. 5, pp. 272-277, May 1980.

van Dam et al. 74 Andries van Dam, George M. Stabler, and Richard 1. Harrington, "Intelligent satellites for interactive graphics," Proceedings of the IEEE, vol. 62, no. 4, pp. 483-492, April 1974.

Wu-Feng 84 Chuan-lin Wu and Tse-yun Feng, in Tutorial: Interconnection Networks for Parallel and Distri­buted Processing, IEEE Computer Society Press, Silver Spring, MD, 1984.

Yao 82 Frances Yao, "Maximum flows in networks," in The Mathematics of Networks, ed. Stefan A. Burr, American Mathematical Society-Proceedings of Symposia in Applied Mathematics, Providence, 1982.

INDEX

4 nearest-neighbor array, 118 8 nearest-neighbor array, 119 acyclic digraph, 13 Aho,20 algorithm, shortest tree, 54 allocation graph, 57, 63 apex, of a cone, 91 arborescence, 54, 24 ,50 array processors, 119 assembly line, 98 assignment, 27, 30, 31

across space, 49 global, 96, 109 graph, 29, 51, 61, 106 null, 79 polyhedron, 80, 86 tree, 54 Universal, 79 nested,74

Bailey, 133 Berge, 25 Berger, 127, 129 Bennan, 133 Boggs, 5 binary

dissection, 127 search, 88 tree, 24 tree, complete, 24

Bokhari, 27, 37, 38, 45, 48, 67, 69, 96, 98, 104, 107, 115, 127, 129

Bolch,99 Bollobas, 25

Booth, 125

bottleneck processor, 99 weight, 18, 96

branching, 50 breakpoint, 86 Brown Univ. Graphics System, 32 Burr, 25

C compiler, 43 cardinality

of a cut, 78 of a mapping,122 of a set, 12

Carstensen, 72, 85 chain, 59 chain limb, 62, 64 chain-connected computer system, 98 chain-structured program, 98 characteristics of computation, 33 CHiP, 132 Chughtai, 131 Coffman, 5 commodity, 20 commodity flow network, 20 communication

cost function, 51 cost, varying, 88 cost, interprocessor, 51 intennodule, 100 interprocessor, 3 link, 51 link speed, 48

complete

150

binary tree, 24 graph, 118

computation engineering, 66 real-time, 66

computer, personal, 5 computer system,

chain-connected, 98 conditional branches, 48 cones, 90 contiguity constraint, 98, 100 convex

hull, 75 polygon, 81 polyhedron, 80

Comeil,126 coroutines, 28 cost, financial, 3 CPU cycles, 73 critical

load factor, 75 load line, 85

Cuny, 133 cut, 16, 30, 31

cardinality of, 78 equation of, 78 minimum weight, 20 s-t, 17 weight, 19

cutset, 16, 27 minimum weight, 27

cycle, 13, 15, 48

deadlines, 48, 66 debugging, 32 degree, 14 Deo, 20, 25, 114, 124 depth, of a partitioning, 129 diameter, of an array,120

digraph, 12 acyclic, 13

Dijkstra, 20, 54, 98, 104 Dinie,23 directed

edge, 12 graph, 12, 51 path, 13 tree, 24

distributed system, 7, 28 Doty, 136 doubly weighted graph, 97 dual graph, 128 dual-processor, 28, 72 dynamic assignment graph, 35

edge capacity, 20 directed, 12 incident, 14 saturated, 20 weight, 17, 20 external,30 internal,30

editing, 32 Edmonds, 23, 98 Eisner, 76, 111 engineering computation, 66 enumeration, 33 envelope, 75 equation of a cut, 78 Even, 23, 25

FEM, 6, 119 Feng, 121 file server, 32 filter, 99 financial cost, 29 Finite Element Machine, 6, 119

Index

Flexl32,6 floating point

computation, 2 unit, 5, 28

Foley, 32 Ford, 20, 21 forknodes, 52 forkset, 53, 54 Fortran Compiler, 43 Fourier transform, 99 fringe regions, 84 Fulkerson, 20, 21

Garey, 33 global assignment, 96, 108 graph,

acyclic, 83 allocation, 57 assignment, 51, 61 complete,118 components, 16 connected, 16 directed, 12, 51, 83 disconnected, 16 doubly weighted, 97 dual, 114 dynamic assignment, 35 isomorphism, 124 of a partitioning, 130 partitioning, 7 planar, 83, 114 series-parallel, 58 sparse, 23 theory, 7 underlying, 15 undirected, 13 weighted, 17, 96 zero residence cost, 37, 38 series-parallel, 48

group theory, 134 Gursky, 45 Gusfield, 72, 85, 88, 91

Harary, 25 head, 12, 13 height, of a binary tree, 24 heuristic algorithm, 125 Hoffman, 125 Hoshino, 119 host-satellite system, 28, 104 Hu, 20, 23, 25 hypercube, 120

IBM,32 Illiac-IV, 6, 118 image analysis, 98, 100 indegree, 12 induced subgraph, 53, 64 industrial applications, 69 instruction set, 2, 6

151

intermodule communication, 100 overhead, 28

interprocessor communication, 3, 28, 104, 28, 101

costs, 51 intraprocessor communication, 102 invocation tree, 50 Iqbal, 136 iteration, 111

Johnson, 33

Karp, 23, 98 Karzanov, 23 knapsack problem, 33

Lawler, 20, 98 layer, 52

152

layered graph, 102 leaf node, 23, 24, 52 length, of a path, 13, 18 Leuker, 125 line printer, 42 Lo, 136 load, 3

factor, 72 factor, critical 75 plane, 79, 81, 82 point, 77 space, 88, 91 varying, 69

loading chain, 110 loops, 48 Luks, 134

mapping, 122 complete binary trees, 131 natural,129 problem, 121

Matelan,6 maxflow-mincut theorem, 21 maximal subtree, 113 maximum flow algorithm, 32 memory constraints, 33, 98, 104 mesh, 101 Metcalfe, 5 Michel, 110 mincut, 20, 32 minimal subset, 17 minimum weight cut, 20 module,

communication cost, 34 pivotal, 111 relocation, 34, 69 relocation, 69 relocation cost, 34 residence cost, 34

MPP, 6 multigraph, 25, 38, 58, 115

directed, 25 mUltiple satellite system, 108

NASA Ames Research Center, 118 Langley Research Center, 119

natural mapping, 129 nested

assignments, 74, 109 regions, 83

Nesting Theorem, 75, 81, 109 network, commodity flow, 20 network flow, 8,26 node, 12

adjacent, 14 leaf, 23, 24, 52 pseudoterminal, 54 source, 52 terminal, 52

nodes, disconnected, 17 NP-complete problem, 8, 33, 96 Null assignment, 79 number cruncher, 32

optimal Sum-Bottleneck path, 97 ordered pair, 12 outdegree, 12 out-tree, 24 overhead, communication, 3

pairwise interchanges, 125 parallel

processing, 101, 102 program, 96

PARALLEL-SHORT (procedure), 64 partial differential equations, 101 partition, optimal, 2

Index

path, 14 directed, 13 length, 13, 15, 18 optimal Sum-Bottleneck, 97 shortest, 20, 54 weight, 18, 96

PAX, 6, 119 perfect mapping, 122 personal computer, 32 phase, 34, 40, 67

alternative definition, 41 pipelined processing, 101 pipelining, 98 pivotal module, III pixel, 101 plotter, 42 polygon, convex, 81 polyhderon,

convex, 80 assignment, 80

Pooch, 136 precedence

graphs, 45 relationship, 48, 66 tree, 67

Price, 136 problem, NP-complete, 96 process,

control, 69, 113 monitoring, 69, 113

processor, bottleneck, 99 specialized, 2 time-shared, 28

production, environment, 66, 69 programs, 102

program, chain structured, 98

graph,29 parallel, 96 real-time, 69 serial, 2 tree structured, 48

pseudoterminal node, 54

Rao, 33 Read, 126 real-time,

computation, 66 environment, 104 programs, 69

regions, fringe, 84 nested, 83

relocation, 33 replication, 27

cost, 44 resource,

assignment, 27 binding, 43 partitioning, 42 replication, 27, 42

root, 24 node, 24

Saltz, 101, 136 satellite, 32 saturated edge, 20 SB,

path, 97 weight, 97, 107

scheduling, 48 series-parallel graph, 48, 58 Severance, 76, 111

153

SHORT (procedure), 54, 56, 64 shortest,

path, 20, 54

154

tree, 48 tree algorithm, 45, 54

signal processing, 99 single-host, multiple

satellite system, 108 sink, 20, 58

layer, 61 slope, 82, 86 Snyder, 133 source, 20, 58

layer, 61 node, 51

sparse graph, 23 spindle, 59

limb, 62, 64 s-t cut, 17 static assignment, 33 Sternberg, 100 Stone, 27, 29, 31,45, 72,

75, 81, 109 sub graph, 15, 53

generated, 15 induced, 15, 54, 64

subroutines, 28 sum-bottleneck weight, 97 subtree, maximal, 113 super node, 110 symbol manipulation, 2

tail, 12, 13 Tarjan, 20, 23, 25 tenninal node, 51 three processor systems, 44 three way partition, 44 time-dependent loads, 66 time-shared processor, 28 , 72 Towsley, 45, 48, 57, 60,

69, 136 tree, 23, 59

binary, 24 directed, 24 precedence, 67 undirected, 23

tree-structured program, 48, 113 Tsukuba University, 119 Turner, 48

undirected path, 14 Universal assignment, 79 unordered pair, 13

van Dam, 32, 110 varying load, 69 vertex, 12

weather calculations, 126 weight,

bottleneck, 18, 96 of a cut, 19 of a path, 18, 96 SB,97 sum-bottleneck, 97

weighted graph, 17, 96 workstations,S, 32 WU,121

Yao, 23

zero residence cost graph, 37, 38

ABOUT THE AUTHOR

Shahid H. Bokhari was born in Lahore, Pakistan in 1953. He received the B.Sc. degree in Electrical Engineering from the Pakistan University of Engineering & Technology, Lahore, in 1974, and the M.S. and Ph.D. degrees in Electrical & Computer Engineering from the University of Massachusetts, Amherst, in 1976 and 1978 respectively.

He was a Research Assistant at the Department of Electrical & Computer Engineering, University of Massachusetts, from 1975 to 1978. From 1978 to 1979 and again from 1984 to 1986, he was a scientist at the Institute for Computer Applications in Science & Engineering (lCASE) at NASA Langley Research Center. Since 1980 he has been on the faculty of the Department of Electrical Engineering, University of Engineering & Technology, Lahore, Pakistan, where he is currently Associate Professor. His research interests include performance evalua­tion, computer architecture, and parallel and distributed computing. He has published many research papers on these topics, mostly in the IEEE Transactions on Computers and the IEEE Transactions on Software Engineering.

Dr. Bokhari is a Member of the ACM and a Senior Member of the IEEE. He received the Best Presentation Award at the 1981 Interna­tional Conference on Parallel Processing.