PERFORMANCE ANALYSIS OF PARALLEL PROCESSING SYSTEMS.
被引:2
作者:
Nelson, R.
论文数: 0引用数: 0
h-index: 0
机构:
IBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USAIBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USA
Nelson, R.
[1
]
Towsley, D.
论文数: 0引用数: 0
h-index: 0
机构:
IBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USAIBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USA
Towsley, D.
[1
]
Tantawi, A.N.
论文数: 0引用数: 0
h-index: 0
机构:
IBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USAIBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USA
Tantawi, A.N.
[1
]
机构:
[1] IBM, Yorktown Heights, NY, USA, IBM, Yorktown Heights, NY, USA
来源:
Performance Evaluation Review
|
1987年
/
15卷
/
01期
关键词:
COMPUTER OPERATING SYSTEMS - Performance;
D O I:
10.1145/29904.29916
中图分类号:
学科分类号:
摘要:
A centralized parallel processing system with job splitting is considered. In such a system, jobs wait in a central queue, which is accessible by all the processors, and are split into independent tasks that can be executed on separate processors. This parallel processing system is modeled as a bulk arrival M**x/M/c queueing system where customers and bulks correspond to tasks and jobs, respectively. Such a system has been studied before and an expression for the mean response time of a random customer is obtained. However, since we are interested in the time that a job spends in the system, including synchronization delay, we must evaluate the bulk response time rather than simply the customer response time. The job response time is the sum of the job waiting time and the job service time. By analyzing the bulk queueing system we obtain an expression for the mean job waiting time. The mean job service time is given by a set of recurrence equations.