A performance evaluation of several priority policies for parallel processing systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A performance evaluation of several priority policies for parallel processing systems

Full text

Pdf (1.41 MB)

Source

Journal of the ACM (JACM) archive
Volume 40 , Issue 3 (July 1993) table of contents

Pages: 714 - 740

Year of Publication: 1993

ISSN:0004-5411

Authors

Randolph Nelson	IBM T. J. Watson Research Center, Yorktown Heights, New York
Donald Towsley	University of Massachusetts, Amherst, Massachusetts

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 29, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/174130.174143 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	T S Axelrod, Effects of synchronization barriers on multiprocessor performance, Parallel Computing, v.3 n.2, p.129-140, May 1986 [doi>10.1016/0167-8191(86)90030-X]
	2	François Baccelli , Zhen Liu, On the execution of parallel programs on multiprocessor systems—a queuing theory approach, Journal of the ACM (JACM), v.37 n.2, p.373-414, April 1990 [doi>10.1145/77600.77622]
	3	~BACCELLI, F., MAKOWSKI, h. M., AND SHWARTZ, A. The fork-join queue and related systems ~with synchronization constraints: Stochastic ordering and computable bounds. A&,. Appl. ~Prob., 21 (1989), 629-660.
	4	François Baccelli , William A. Massey , Don Towsley, Acyclic fork-join queuing networks, Journal of the ACM (JACM), v.36 n.3, p.615-642, July 1989 [doi>10.1145/65950.65957]
	5	~COBn^M, A. Priority assignment in waiting line problems. Op. Res. 2 (1954), 70-76.
	6	~CYTRON, R. Useful parallelism in a multiprocessing environment. In Proceedings of the 1985 ~Parallel Processing Conference.
	7	Michel, Dubois , Christoph Scheurich , Fayé A. Briggs, Synchronization, Coherence, and Event Ordering in Multiprocessors, Computer, v.21 n.2, p.9-21, February 1988 [doi>10.1109/2.15 ]
	8	~FLAW, H., AND KENNEDY, K. Performance of parallel processors. Parallel Comput. 12 ~(1989L 1-20.
	9	~FLATro, L., AND HAHN, S. Two parallel queues created by arrivals with two demands I. ~ SIAM J. Appl. Math. 44 (Oct. 1984), 1041-1053.
	10	~GREENBAUM, A. Synchronization costs on multiprocessors. Parallel Comput. 10 (1989), 3-14.
	11	~HANSEN, P. B. The programming language concurrent Pascal. IEEE Trans. Sofiw. Eng. 1 ~(1975).
	12	~HARRISON, P.G. On normalizing constants in queueing networks. Op. Res. 33, 2 (1985), pp. ~464-468.
	13	~HEYMA, D. P., AND SOBEL, M.J. Stochastic Models in Operations Research. vol. 1. McGraw- ~Hill, Boston, Mass., 1982.
	14	C. A. R. Hoare, Communicating sequential processes, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985
	15	C. Kim , A. K. Agrawala, Analysis of the Fork-Join Queue, IEEE Transactions on Computers, v.38 n.2, p.250-255, February 1989 [doi>10.1109/12.16501 ]
	16	~KLEINROCK, L. Queuemg Systems. Vol. II: ComputerApphcations. Wiley, New York, 1976.
	17	~KOENIGSBERG, E. Comments on normalizing constants in queuemg networks, Oper. Res. 34, ~2 (Mar.-Apr. 1986), 330.
	18	~KONSTANTOPOULOS, P., AND WALRAND, J. Stationanty and stabihty of fork-join networks. ~J. A&'. Prob., to appear.
	19	Stephen S. Lavenberg, Computer Performance Modeling Handbook, Academic Press, Inc., Orlando, FL, 1983
	20	Scott T. Leutenegger , Mary K. Vernon, The performance of multiprogrammed multiprocessor scheduling algorithms, Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.226-236, April 1990, Univ. of Colorado, Boulder, Colorado, United States
	21	S. Majumdar , D. L. Eager , R. B. Bunt, Scheduling in multiprogrammed parallel systems, Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.104-113, May 24-27, 1988, Santa Fe, New Mexico, United States
	22	~ MUSCIANO, m. J., AND STERLING, T. L. Efficient dynamic scheduling of medium-grained ~tasks for general purpose parallel processing. In Proceedings of the International Conference on ~Parallel Processing. 1988, pp. 166-175.
	23	Randolph Nelson, A performance evaluation of a general parallel processing model, ACM SIGMETRICS Performance Evaluation Review, v.18 n.1, p.13-26, May 1990
	24	R. Nelson , A. N. Tantawi, Approximate Analysis of Fork/Join Synchronization in Parallel Queues, IEEE Transactions on Computers, v.37 n.6, p.739-743, June 1988 [doi>10.1109/12.2213 ]
	25	Randolph Nelson , Don Towsley , Asser N. Tantawi, Performance Analysis of Parallel Processing Systems, IEEE Transactions on Software Engineering, v.14 n.4, p.532-540, April 1988 [doi>10.1109/32.4676 ]
	26	~ NEUTS, M. MatrL~ Geometric Solutions tn Stochastic Models. The Johns Hopkins Press, ~Baltimore, Md., 1981.
	27	Anita Osterhaug, Guide to parallel programming on Sequent computer systems: 2nd edition, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	28	~ P~LE, I.C. The Aria Programming Language. Prentice-Hall International. London, England, ~1981.
	29	~ SEAGER, M., AND ST~CHNOTH, J. Simulating the scheduling of parallel supercomputer appli- ~cations. UCRL-102059. Lawrence Livermore National Laboratory, Livermore, Calif., Sept. ~1989.
	30	K. C. Sevcik, Characterizations of parallelism in applications and their use in scheduling, ACM SIGMETRICS Performance Evaluation Review, v.17 n.1, p.171-180, May 1989
	31	D. Towsley , C. G. Rommel , J. A. Stankovic, Analysis of Fork-Join Program Response Times on Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, v.1 n.3, p.286-303, July 1990 [doi>10.1109/71.80157 ]
	32	Don Towsley , Shou Yu, Bounds for Two Server Fork-Join Queueing Systems, University of Massachusetts, Amherst, MA, 1987
	33	~ YAO, D.D. Some results for the queues MX/M/c and GIX/G/c. Oper. Res. Lett. 4 (July ~1985), 79-83.
	34	John Zahorjan , Cathy McCann, Processor scheduling in shared memory multiprocessors, ACM SIGMETRICS Performance Evaluation Review, v.18 n.1, p.214-225, May 1990

CITED BY 3

	S. K. Setia , M. S. Squillante , S. K. Tripathi, Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems, IEEE Transactions on Parallel and Distributed Systems, v.5 n.4, p.401-420, April 1994
	Andrea Carol Arpaci-Dusseau, Implicit coscheduling: coordinated scheduling with implicit information in distributed systems, ACM Transactions on Computer Systems (TOCS), v.19 n.3, p.283-331, Aug. 2001
	Sameer M. Bataineh, Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors, Journal of Parallel and Distributed Computing, v.65 n.1, p.29-47, January 2005