Abstract
Given a resource system of a finite capacity and a set of independent processes, this paper is concerned with the generation of sequences of allocation steps which are deadlock-free and optimal with respect to total completion time. Processes are defined as partially-ordered sets of phases, each being a single or joint request for resources.
A priori knowledge of the duration of phases is assumed to be available. The approach followed is that of combining processes together into a new process which correctly embeds the former. Combination is carried out by the addition of ordering relations between the phases of the original processes. Properties of the new graph model used for process representation permit a short-cut procedure to be introduced to obtain the optimal solution in a nonexhausive way.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bovet, D. P., Iazeolla, G. G.;A new technique for scheduling processes in a multiprogramming environment, Report 1-11, (1971), Istituto di Automatica, University of Rome, Italy.
Bruno, J., Coffman, E. G., Sethi, R.;Algorithms for minimizing mean flow time, Proc. IFIP Congr. 1974, North Holland Publ. Co. Amsterdam, 504–510.
Bruno, J., Coffman, E. G., Sethi, R.;Scheduling independent tasks to reduce mean finishing time, Comm. ACM, 17, 7, (July 1974), 382–387.
Coffman, E. G., Graham, R. L.;Optimal scheduling for two processor systems, Acta Informatica, 1 (1972), 200–213.
Conway, Maxwell, Miller;Theory of Scheduling, (1967), Addison Wesley.
Haberman, A. N.;Prevention of system deadlocks, Comm. ACM, Vol. 12, No. 7, (July 1969), 373–385.
Havender, J. W.;Avoiding deadlock in multitasking systems, IBM Sys. J., No. 2, (1968), 74–78.
Hebalkar, P. G.;Deadlock-free sharing of resources in asynchronous systems, Ph. D. Thesis, MIT, Project MAC TR 75, (Sep. 1970).
Heller, J.;Sequencing aspects of multiprogramming, JACM, Vol. 8, (July 1961), 462–439.
Holt, R. C.;Some deadlock properties of computer systems, Computing Surveys, Vol. 4, No. 3 (Sept. 1972), 179–196.
Hu, T. C.;Parallel sequencing and assembly lines problems, J. Oper. Res. Soc. Am., Vol. 9, No. 6 (Nov. 1961) 841–848.
Karp, R. M.;Reducibility among combinatorial problems, Complexity of Computer Computations, R. E. Miller and J. W. Thatcher eds, (1972) Plenum Press, New York.
Iazeolia, G. G.;Deadlock-free sequencing for multiple resources allocation in multiprocess systems: optimization perspectives, Report 1-02, (Jan. 1971), Istituto di Automatica, University of Rome, Italy.
Lomnicki, Z. A.;A branch-and-bound algorithm for the solution of the three-machine scheduling problem, Oper. Res. Quart. Vol. 16, (1965), 89–100.
Lomnicki, Z. A., Brown, A. P. G.;Some applications of the branch-and-bound algorithm to the machine scheduling problem, Oper. Res. Quart., Vol. 17, (1966), 173–185.
Muntz, R. R., Coffman, E. G. Jr.;Preemptive scheduling of real-time tasks in multiprocessor systems, J. ACM, Vol. 17, No. 2, (Apr. 1970), 324–338.
Ramamoorthy, C. V.;Analysis of graphs by connectivity considerations, J. ACM, No. 2, Vol. 13, (Apr. 1966), 211–222.
Shoshani, A., Coffman, E. G. Jr.;Sequencing tasks in multiprocess, multiple resource systems to avoid readlocks, TR-18, (June 1969), Princeton Univ., Comp. Lab.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Iazeolla, G. A graph model for scheduling processes in systems with parallel computations. Calcolo 13, 321–349 (1976). https://doi.org/10.1007/BF02575939
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02575939