The impact of distributions and disciplines on multiple processor systems

Simple queueing models are used to study the performance tradeoffs of multiple processor systems. Issues considered include the impact of CPU service disciplines and distributions, level of multiprogramming, multitasking, and job priorities.

[1]  Donald Fred Towsley.  Local balance models of computer systems. , 1975 .

[2]  Alan Jay Smith,et al.  Interference in multiprocessor computer systems with interleaved memory , 1976, CACM.

[3]  Allen Newell,et al.  Computer Structures: Readings and Examples, , 1971 .

[4]  D. Cox.  A use of complex probabilities in the theory of stochastic processes , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  Harry D. Frankel,et al.  Electronic Disks in the 1980's , 1975, Computer.

[6]  Edward G. Coffman,et al.  Anaysis of interleaved memory systems using blockage buffers , 1975, CACM.

[7]  H. Chang,et al.  Bubble ladder for information processing , 1975 .

[8]  Douglas Stoddard Johnson,et al.  A process-oriented model of resource demands in large, multiprocessing computer utilities , 1972 .

[9]  K. Mani Chandy,et al.  The Effect on Throughput of Multiprocessing in a Multiprogramming Environment , 1973, IEEE Transactions on Computers.

[10]  Stephen S. Lavenberg,et al.  Introduction to Regenerative Simulation , 1975, IBM J. Res. Dev..

[11]  Samuel H. Fuller,et al.  A Survey of Techniques for Analyzing Memory Interference in Multiprocessor Computer Systems , 1973 .

[12]  D. T. Brown,et al.  Magnetic bubble memory organization , 1972 .

[13]  Barry D. Wessler,et al.  Computer network development to achieve resource sharing , 1899, AFIPS '70 (Spring).

[14]  K. Mani Chandy,et al.  Solution of Queuing Problems by a Recursive Technique , 1975, IBM J. Res. Dev..

[15]  Jeffrey P. Buzen,et al.  Queueing Network Models of Multiprogramming , 1971, Outstanding Dissertations in the Computer Sciences.

[16]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[17]  K. Mani Chandy,et al.  Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..

[18]  James C. Browne,et al.  Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system , 1972, Commun. ACM.

[19]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1988, CACM.

[20]  C. V. Ramamoorthy,et al.  A survey of techniques for recognizing parallel processable streams in computer programs , 1899, AFIPS '69 (Fall).

[21]  C. H. Sauer,et al.  Configuration of computing systems: an approach using queueing network models. , 1975 .

[22]  T. J. Nelson,et al.  Dynamic data reallocation in bubble memories , 1972 .

[23]  Samuel H. Fuller.  Price/performance comparison of C.mmp and the PDP-10 , 1976, ISCA.

[24]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[25]  Hsu Chang,et al.  Bubble domain memory chips , 1972 .

[26]  Lawrence C. Widdoes.  The minerva multi-microprocessor , 1976, ISCA.

[27]  Chak-Kuen Wong,et al.  The Generation of Permutations in Magnetic Bubble Memories , 1976, IEEE Transactions on Computers.

[28]  K. Mani Chandy,et al.  Approximate Analysis of Central Server Models , 1975, IBM J. Res. Dev..