# Optimal resource allocation and scheduling among parallel processes

Session 5: Scheduling II

First Online:

## Abstract

The problem of optimally allocating limited resources among competing processes may be formulated as a problem in finding the shortest path in a directed graph, provided a quantitative measure of the performance of each process as a function of its resource allocation can be suitably defined. If this measure is also a function of time, scheduling problems arise so that optimal allocations become time-varying and may depend upon various precedence relations or constraints among the processes. Dynamic programming approaches to such allocation and scheduling problems are presented in the context of parallel processing.

## Keywords

Short Path Schedule Problem Allocation Problem Processor Utilization Allocation Cost
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]H. Lorin, Parallelism in Hardware and Software: Real and Apparent Concurrency, Prentice-Hall, (1972).Google Scholar
- [2]E.G. Coffman, Jr., and P.J. Denning, Operating Systems Theory, Prentice-Hall, (1973).Google Scholar
- [3]IBM, "IBM System/360 Operating System Concepts and Facilities," Form. No. GC28-6535.Google Scholar
- [4]A. Lew, "Memory Allocation in Paging Systems," Proc. ACM Annual Conf., (1973), pp. 232–235.Google Scholar
- [5]A. Kaufmann, Graphs, Dynamic Programming, and Finite Games, Academic Press, (1967).Google Scholar
- [6]D.E. Knuth, Fundamental Algorithms, Addison-Wesley, (1968).Google Scholar
- [7]J. Kral, "One Way of Estimating Frequencies of Jumps in a Program," Comm. ACM, (1968) pp. 475–480.Google Scholar
- [8]IBM, "IBM System/360 Operating System Linkage Editor and Loader," Form No. C28-6538.Google Scholar
- [9]D.P. Bovet, and G. Estrin, "On Static Memory Allocation in Computer Systems," IEEE Trans. Comp., (1970), pp. 492–503.Google Scholar
- [10]S.E. Dreyfus, "An Appraisal of Some Shortest-path Algorithms," ORSA, (1969), pp. 395–412.Google Scholar
- [11]R.E. Bellman, and S.E. Dreyfus, Applied Dynamic Programming, Princeton U. Press, (1962).Google Scholar
- [12]M. Held and R.M. Karp, "The Construction of Discrete Dynamic Programming Algorithms," IBM Syst. J., (1965), pp. 136–147.Google Scholar
- [13]P.J. Denning, "The Working Set Model for Program Behavior", Comm. ACM, (1968), pp. 323–333.Google Scholar
- [14]P.J. Denning, "Thrashing: Its Causes and Prevention," Proc. AFIPS FJCC, (1968), pp. 915–922.Google Scholar
- [15]E.G. Coffman, Jr., and T.A. Ryan, Jr., "A Study of Storage Partitioning Using a Mathematical Model of Locality," Comm. ACM, (1972), pp. 185–190.Google Scholar
- [16]G. Ingargiola and J.F. Korsh, "Finding Optimal Demand Paging Algorithms," J. ACM, (1974), pp. 40–53.Google Scholar
- [17]M.A. Franklin, and R.K. Gupta, "Computation of Page Fault Probability from Program Transition Diagram," Comm. ACM, (1974), pp. 186–191.Google Scholar
- [18]W.W. Chu, and H. Opderbeck, "The Page Fault Frequency Replacement Algorithm", Proc. AFIPS FJCC, (1972), pp. 597–609.Google Scholar
- [19]S. Even, A. Pnueli, and A. Lempel, "Permutation Graphs and Transitive Graphs," J. ACM, (1972), pp. 400–410.Google Scholar
- [20]E.W. Dijkstra, "Co-operating Sequential Processes," in Programming Languages (Ed. Genuys), Academic Press, (1968), pp. 43–112.Google Scholar
- [21]D.P. Gaver, Jr., and P.A.W. Lewis, "Probability Models for Buffer Storage Allocation Problems," J. ACM, (1971), pp. 186–198.Google Scholar
- [22]H. Hellerman, "Time-sharing Scheduler Strategies," IBM Syst. J., (1969), pp. 94–117.Google Scholar
- [23]R.W. Conway, W.L. Maxwell, and L.W. Miller, Theory of Scheduling, Addison-Wesley, (1967).Google Scholar
- [24]R.A. Howard, Dynamic Programming and Markov Processes, MIT Press, (1960).Google Scholar
- [25]R.L. Mattson, J. Gecsei, D.R. Slutz, and I.L. Traiger, "Evaluation Techniques for Storage Hierarchies," IBM Syst. J., (1970), pp. 78–117.Google Scholar
- [26]A. Lew, "Comments on ‘Finding Optimal Demand Paging Algorithms'," Dept. of Info. and Comp. Sci., Univ. of Hawaii, TR No. AR0-19, (1974).Google Scholar
- [27]J.L. Baer, "A Survey of Some Theoretical Aspects of Multiprocessing," ACM Comp. Surv., (1973), pp. 31–80.Google Scholar
- [28]IBM, "Direct Access Storage Devices and Organization Methods," Form No. C20-1649.Google Scholar
- [29]P.J. Denning, "Effects of Scheduling on File Memory Operations," Proc. AFIPS SJCC (1967), pp. 9–21.Google Scholar
- [30]T.J. Teorey, and T.B. Pinkerton, "A Comparative Analysis of Disk Scheduling Policies," Comm. ACM, (1972), pp. 177–184.Google Scholar
- [31]L.T. Reinwald, and R.M. Soland, "Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time," J. ACM, (1966), pp. 339–358.Google Scholar
- [32]E.G. Coffman, Jr., M.J. Elphick, and A. Shoshani, "System Deadlocks," ACM Comp. Surv., (1971), pp. 67–78.Google Scholar
- [33]R.C. Holt, "Some Deadlock Properties of Computer Systems," ACM Comp. Surv. (1972), pp. 179–196.Google Scholar
- [34]
- [35]F.S. Hillier, and G.J. Lieberman, Introduction to Operations Research, Holden-Day, (1967).Google Scholar
- [36]R.G. Hamlet, "Efficient Multiprogramming Resource Allocation and Accounting," Comm. ACM, (1973), pp. 337–343.Google Scholar
- [37]A. Thesen, "Scheduling of Computer Programs for Optimal Machine Utilization," BIT, (1973), pp. 206–216.Google Scholar
- [38]R.M. Beeson, and W.S. Meisel, "Optimization of Complex Systems with Respect to Multiple Criteria," Proc. IEEE-SMC Symp., (1971), pp. 144–149.Google Scholar
- [39]D. Michie, J.G. Fleming, and J.V. Oldfield, "A Comparison of Heuristic, Interactive, and Unaided Methods of Solving a Shortest-route Problem," in Machine Intelligence 3 (Ed. Michie), American Elsevier, (1968), pp. 245–255.Google Scholar
- [40]A. Lew, "Successive Approximations and Dynamic Programming," Proc. 5th Asilomar Conf. on Circuits and Systems, (1971), pp. 79–82.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1975