Bounds on multiprocessing anomalies and related packing algorithms

It has been known for some time that certain rather general models of multiprocessing systems frequently exhibit behavior which could be termed "anomalous," e.g., an increase in the number of processors of the system can cause an increase in the time used to complete a job. In order to fully realize the potential benefits afforded by parallel processing, it becomes important to understand the underlying causes of this behavior and the extent to which the resulting system performance may be degraded.

[1]  Henry Wallace Clark,et al.  The Gantt Chart , 1947 .

[2]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[3]  R. Bellman.  MATHEMATICAL ASPECTS OF SCHEDULING THEORY , 1956 .

[4]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[5]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[6]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[7]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[8]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[9]  M. Held,et al.  Assembly-Line Balancing---Dynamic Programming with Precedence Constraints , 1963 .

[10]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[11]  Shimon Even,et al.  Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[12]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[13]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[14]  D R Fulkerson.  SCHEDULING IN PROJECT NETWORKS , 1964 .

[15]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[16]  James G. Root.  Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .

[17]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[18]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[19]  Glenn K. Manacher,et al.  Production and Stabilization of Real-Time Task Schedules , 1967, JACM.

[20]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[21]  M. Fujii,et al.  Optimal Sequencing of Two Equivalent Processors , 1969 .

[22]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[23]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[24]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[25]  Nicos Christofides,et al.  The Loading Problem , 1971 .

[26]  Robert E. Tarjan,et al.  Planarity Testing in V log V Steps: Extended Abstract , 1971, IFIP Congress.

[27]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[28]  M. Fujii,et al.  Erratum “Optimal Sequencing of Two Equivalent Processors” , 1971 .

[29]  John Michael Robson,et al.  An Estimate of the Store Size Necessary for Dynamic Storage Allocation , 1971, JACM.

[30]  Martin J. Krone,et al.  Heuristic programming applied to scheduling problems , 1971 .

[31]  E. M. Reingold.  Establishing lower bounds on algorithms: a survey , 1971, AFIPS '72 (Spring).

[32]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.