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.
Supported by the U.S. Army Research Office.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Lorin, Parallelism in Hardware and Software: Real and Apparent Concurrency, Prentice-Hall, (1972).
E.G. Coffman, Jr., and P.J. Denning, Operating Systems Theory, Prentice-Hall, (1973).
IBM, "IBM System/360 Operating System Concepts and Facilities," Form. No. GC28-6535.
A. Lew, "Memory Allocation in Paging Systems," Proc. ACM Annual Conf., (1973), pp. 232–235.
A. Kaufmann, Graphs, Dynamic Programming, and Finite Games, Academic Press, (1967).
D.E. Knuth, Fundamental Algorithms, Addison-Wesley, (1968).
J. Kral, "One Way of Estimating Frequencies of Jumps in a Program," Comm. ACM, (1968) pp. 475–480.
IBM, "IBM System/360 Operating System Linkage Editor and Loader," Form No. C28-6538.
D.P. Bovet, and G. Estrin, "On Static Memory Allocation in Computer Systems," IEEE Trans. Comp., (1970), pp. 492–503.
S.E. Dreyfus, "An Appraisal of Some Shortest-path Algorithms," ORSA, (1969), pp. 395–412.
R.E. Bellman, and S.E. Dreyfus, Applied Dynamic Programming, Princeton U. Press, (1962).
M. Held and R.M. Karp, "The Construction of Discrete Dynamic Programming Algorithms," IBM Syst. J., (1965), pp. 136–147.
P.J. Denning, "The Working Set Model for Program Behavior", Comm. ACM, (1968), pp. 323–333.
P.J. Denning, "Thrashing: Its Causes and Prevention," Proc. AFIPS FJCC, (1968), pp. 915–922.
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.
G. Ingargiola and J.F. Korsh, "Finding Optimal Demand Paging Algorithms," J. ACM, (1974), pp. 40–53.
M.A. Franklin, and R.K. Gupta, "Computation of Page Fault Probability from Program Transition Diagram," Comm. ACM, (1974), pp. 186–191.
W.W. Chu, and H. Opderbeck, "The Page Fault Frequency Replacement Algorithm", Proc. AFIPS FJCC, (1972), pp. 597–609.
S. Even, A. Pnueli, and A. Lempel, "Permutation Graphs and Transitive Graphs," J. ACM, (1972), pp. 400–410.
E.W. Dijkstra, "Co-operating Sequential Processes," in Programming Languages (Ed. Genuys), Academic Press, (1968), pp. 43–112.
D.P. Gaver, Jr., and P.A.W. Lewis, "Probability Models for Buffer Storage Allocation Problems," J. ACM, (1971), pp. 186–198.
H. Hellerman, "Time-sharing Scheduler Strategies," IBM Syst. J., (1969), pp. 94–117.
R.W. Conway, W.L. Maxwell, and L.W. Miller, Theory of Scheduling, Addison-Wesley, (1967).
R.A. Howard, Dynamic Programming and Markov Processes, MIT Press, (1960).
R.L. Mattson, J. Gecsei, D.R. Slutz, and I.L. Traiger, "Evaluation Techniques for Storage Hierarchies," IBM Syst. J., (1970), pp. 78–117.
A. Lew, "Comments on ‘Finding Optimal Demand Paging Algorithms'," Dept. of Info. and Comp. Sci., Univ. of Hawaii, TR No. AR0-19, (1974).
J.L. Baer, "A Survey of Some Theoretical Aspects of Multiprocessing," ACM Comp. Surv., (1973), pp. 31–80.
IBM, "Direct Access Storage Devices and Organization Methods," Form No. C20-1649.
P.J. Denning, "Effects of Scheduling on File Memory Operations," Proc. AFIPS SJCC (1967), pp. 9–21.
T.J. Teorey, and T.B. Pinkerton, "A Comparative Analysis of Disk Scheduling Policies," Comm. ACM, (1972), pp. 177–184.
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.
E.G. Coffman, Jr., M.J. Elphick, and A. Shoshani, "System Deadlocks," ACM Comp. Surv., (1971), pp. 67–78.
R.C. Holt, "Some Deadlock Properties of Computer Systems," ACM Comp. Surv. (1972), pp. 179–196.
R. Bellman, and R. Kalaba, "On kth Best Policies," J. SIAM, (1960), pp. 582–588.
F.S. Hillier, and G.J. Lieberman, Introduction to Operations Research, Holden-Day, (1967).
R.G. Hamlet, "Efficient Multiprogramming Resource Allocation and Accounting," Comm. ACM, (1973), pp. 337–343.
A. Thesen, "Scheduling of Computer Programs for Optimal Machine Utilization," BIT, (1973), pp. 206–216.
R.M. Beeson, and W.S. Meisel, "Optimization of Complex Systems with Respect to Multiple Criteria," Proc. IEEE-SMC Symp., (1971), pp. 144–149.
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.
A. Lew, "Successive Approximations and Dynamic Programming," Proc. 5th Asilomar Conf. on Circuits and Systems, (1971), pp. 79–82.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lew, A. (1975). Optimal resource allocation and scheduling among parallel processes. In: Feng, Ty. (eds) Parallel Processing. SCC 1974. Lecture Notes in Computer Science, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07135-0_119
Download citation
DOI: https://doi.org/10.1007/3-540-07135-0_119
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07135-8
Online ISBN: 978-3-540-37408-4
eBook Packages: Springer Book Archive