Title:
An Approach to Scalability Study of Shared Memory Parallel Systems
An Approach to Scalability Study of Shared Memory Parallel Systems
| dc.contributor.author | Sivasubramaniam, Anand | en_US |
| dc.contributor.author | Singla, Aman | |
| dc.contributor.author | Ramachandran, Umakishore | |
| dc.contributor.author | Venkateswaran, H. | |
| dc.date.accessioned | 2005-06-17T18:05:03Z | |
| dc.date.available | 2005-06-17T18:05:03Z | |
| dc.date.issued | 1993 | en_US |
| dc.description.abstract | The overheads in a parallel system that limit its scalability need to be identified and separated in order to enable parallel algorithm design and the development of parallel machines. Such overheads may be broadly classified into two components. The first one is intrinsic to the algorithm and arises due to factors such as the work-imbalance and the serial fraction. The second one is due to the interaction between the algorithm and the architecture and arises due to latency and contention in the network. A top-down approach to scalability study of shared memory parallel systems is proposed in this research. We define the notion of overhead functions associated with the different algorithmic and architectural characteristics to quantify the scalability of parallel systems; we develop a method for separating the algorithmic overhead into a serial component and a work-imbalance component; we also develop a method for isolating the overheads due to network latency and contention from the overall execution time of an application; we design and implement an execution-driven simulation platform that incorporates these methods for quantifying the overhead functions; and we use this simulator to study the scalability characteristics of five applications on shared memory platforms with different communication topologies. | en_US |
| dc.format.extent | 219643 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/6785 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.relation.ispartofseries | CC Technical Report; GIT-CC-93-62 | en_US |
| dc.subject | Execution time | |
| dc.subject | Interaction between algorithm and architecture | |
| dc.subject | Latency | |
| dc.subject | Overhead functions | |
| dc.subject | Parallel algorithm design | |
| dc.subject | Parallel systems | |
| dc.subject | Scalability | |
| dc.subject | Serial fraction | |
| dc.subject | Simulations | |
| dc.subject | Work imbalance | |
| dc.title | An Approach to Scalability Study of Shared Memory Parallel Systems | en_US |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.author | Ramachandran, Umakishore | |
| local.contributor.corporatename | College of Computing | |
| local.relation.ispartofseries | College of Computing Technical Report Series | |
| relation.isAuthorOfPublication | ecee44ae-00f0-4d06-b7f7-0967613ef340 | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isSeriesOfPublication | 35c9e8fc-dd67-4201-b1d5-016381ef65b8 |
Files
Original bundle
1 - 1 of 1