Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing.
Parallel processing is an important and popular aspect of computing and has been developed to meet the demands of high-performance computing applications. In terms of hardware, a large number of processors connected with high speed networks are put together to solve large scale computationally inten...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
1999
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/240 |
| _version_ | 1848743323028684800 |
|---|---|
| author | Chingchit, Soontorn |
| author_facet | Chingchit, Soontorn |
| author_sort | Chingchit, Soontorn |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Parallel processing is an important and popular aspect of computing and has been developed to meet the demands of high-performance computing applications. In terms of hardware, a large number of processors connected with high speed networks are put together to solve large scale computationally intensive applications. The computer performance improvements made so far have been based on technological developments. In terms of software, many algorithms are developed for application problem execution on parallel systems to achieve required performance. Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been studied to improve performance and reduce problem execution times. In this thesis, a new clustering and scheduling scheme, called flexible clustering and scheduling (FCS) algorithm is proposed. It is a novel approach where clustering and scheduling of tasks can be tuned to achieve maximal speedup or efficiency. The proposed scheme is based on the relation between the costs of computation and communication of task clusters. Vital system parameters such as processor speed, number of processors, and communication bandwidth affect speedup and efficiency. Processor speed and communication bandwidth vary from system to system. Most clustering and scheduling strategies do not take into account the system parameters. The low complexity FCS algorithm can adapt itself to suit different parallel computing platforms and it can also be tuned to suit bounded or unbounded number of processors. The analytical, simulation and experimental studies presented in this thesis validate the claims. |
| first_indexed | 2025-11-14T05:43:44Z |
| format | Thesis |
| id | curtin-20.500.11937-240 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T05:43:44Z |
| publishDate | 1999 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-2402017-02-20T06:41:35Z Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. Chingchit, Soontorn flexible clustering and allocation scheme parallel processing Parallel processing is an important and popular aspect of computing and has been developed to meet the demands of high-performance computing applications. In terms of hardware, a large number of processors connected with high speed networks are put together to solve large scale computationally intensive applications. The computer performance improvements made so far have been based on technological developments. In terms of software, many algorithms are developed for application problem execution on parallel systems to achieve required performance. Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been studied to improve performance and reduce problem execution times. In this thesis, a new clustering and scheduling scheme, called flexible clustering and scheduling (FCS) algorithm is proposed. It is a novel approach where clustering and scheduling of tasks can be tuned to achieve maximal speedup or efficiency. The proposed scheme is based on the relation between the costs of computation and communication of task clusters. Vital system parameters such as processor speed, number of processors, and communication bandwidth affect speedup and efficiency. Processor speed and communication bandwidth vary from system to system. Most clustering and scheduling strategies do not take into account the system parameters. The low complexity FCS algorithm can adapt itself to suit different parallel computing platforms and it can also be tuned to suit bounded or unbounded number of processors. The analytical, simulation and experimental studies presented in this thesis validate the claims. 1999 Thesis http://hdl.handle.net/20.500.11937/240 en Curtin University fulltext |
| spellingShingle | flexible clustering and allocation scheme parallel processing Chingchit, Soontorn Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. |
| title | Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. |
| title_full | Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. |
| title_fullStr | Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. |
| title_full_unstemmed | Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. |
| title_short | Design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. |
| title_sort | design and performance evaluation of a flexible clustering and allocation scheme for parallel processing. |
| topic | flexible clustering and allocation scheme parallel processing |
| url | http://hdl.handle.net/20.500.11937/240 |