Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

Computation Efficiency of Master-Slave Processors in Multitasking Applications: A Performance

Malay R., Mukerjee (1997) Computation Efficiency of Master-Slave Processors in Multitasking Applications: A Performance. Malaysian Journal of Computer Science, 10 (1). pp. 1-9. ISSN 0127-9084

Full text not available from this repository.

Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=21

Affiliations

Universiti Putra Malaysia

Abstract

Examines the computational efficiency of the master slave Multiple processor architectures system by considering a system consisting of a master M and p slave processors. The system performance is found by modelling it as a Markov process and a new method presented for computing the steady-state performance by dividing the state space into an interior and boundary space. The throughput of the system is then compared with that of a cost equivalent single processor using different values for the well-known Grosch parameter. It is demonstrated that the system is computationally efficient only for a sufficiently large number of jobs.

Item Type:Journal
Additional Information:This note was added by the search_and_modify.pl script.
Keywords:Multiprocessor systems, Closed queuing systems
Subjects:Q Science, Computer Science
ID Code:131

F. Baccelli, W. A. Massey and D. Towsley, “Acyclic fork-join queuing networks”, JACM, Vol. 36(3), 1989, pp. 615-42.

A. Duda, “Approximate performance analysis of parallel systems”, in G. Iazeolla, P. J. Courtois and O. J. Boxma(ed) Computer Performance and Reliability, North-Holland (Amsterdam), 1988.

E. D. Lazowska, J. Zahorjan, G. S. Graham and K. C. Sevcik, Quantitative System Performance: Computer System Analysis Using Queuing Network Models, Prentice Hall, New Jersey, 1984.

G. Iazeolla, “The complexity of performance analysis of parallel algorithms and systems”, in A. Monacoa nd R. Negrini (ed), Proc. IEEE Compuero 91, 5th Annual European Conf, May 1991.

R. Nelson and A. N. Tantawi, “Approximate analysis of fork/join synchronization in parallel queues”, IEEE Trans Software Engg, Vol. 37(6), 1988, pp. 739-43.

H. Kasahara, ” Parallel processing of robot control and simulation”, in S. G. Tzafestas(ed) Microprocessors in Robotic and Manufacturing Systems, Kluwer Academic (Boston), 1991.

L. Gun and A. M. Makowski, “Matrix-geometric solutions for finite capacity queues with phase type distribution,” in P. J. Courtois and G. Larouche(ed), Proc. 12th IFIP WG7.3 Int Symp on Comp Perf Modelling, Measurement and Evaluation, Brussels, Dec 1987, North- Holland (Amsterdam), 1988.

H. Mendelson, “Economies of scale in computing: Grosch’s law revisited,” Comm ACM, Vol. 30(12), 1987.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.