Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/9250
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Reddy, A. Ravindranatha | - |
dc.date.accessioned | 2014-11-19T05:31:38Z | - |
dc.date.available | 2014-11-19T05:31:38Z | - |
dc.date.issued | 1994 | - |
dc.identifier | M.Tech | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/9250 | - |
dc.guide | Gupta, J. P. | - |
dc.description.abstract | Nowadays importanteof Parallel processing system is incresing. So the necessity to study their performance is also increasing. A bulk arrival Mx/M/c queueing system is used to model a centralized parallel processing system with job splitting. 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. The job response time consists of three components: queueing delay, service time, and synchronization delay. Centralized and distributed parallel processing systems (with and without job spliting) are considered and their performances compared. Furthermore, the effects of parallelism and overheads due to job splitting are investigated. | en_US |
dc.language.iso | en | en_US |
dc.subject | ELECTRONICS AND COMPUTER ENGINEERING | en_US |
dc.subject | PARALLEL PROCESSING SYSTEMS | en_US |
dc.subject | FORK/JOIN JOBS | en_US |
dc.subject | DISTRIBUTED PARALLEL PROCESSING SYSTEMS | en_US |
dc.title | PERFORMANCE EVALUATION OF PARALLEL PROCESSING SYSTEMS FOR FORK/JOIN JOBS | en_US |
dc.type | M.Tech Dessertation | en_US |
dc.accession.number | 246544 | en_US |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECD246544.pdf | 2.67 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.