Response time analysis of repairable multiprocessor systems

Sameer Bataineh

Research output: Contribution to journalArticlepeer-review


In this paper, a simple model to analyze a repairable multiprocessor system using queuing theory is introduced. A closed form solution for the average response time is derived and asserted through simulation. The analysis is done for both homogeneous and heterogeneous multiprocessor systems. Unlike homogeneous systems, processors and/or links speed in heterogeneous systems are not the same. We study the effect of processors speed and links speed on the average response time. We also show how the topology of interconnection network may affect the average response time. Two mechanisms to repair faulty: processors are considered. The immediate repair mechanism gives better average response time than the delayed repair mechanism. An arriving task to a repairable multiprocessor system may not find the number of available processors that give the maximum parallelism and so a minimum response time. Waiting until that number becomes available (repaired) will increase the waiting time. An algorithm is introduced which gives the optimum number of processors that a task must wait before being executed. Waiting for this number will maximize parallelism without excessive increment in waiting time.

Original languageEnglish
Pages (from-to)201-210
Number of pages10
JournalComputer Systems Science and Engineering
Issue number4
Publication statusPublished - Jul 2000
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Response time analysis of repairable multiprocessor systems'. Together they form a unique fingerprint.

Cite this