Opal
<p>Parallel processing can provide the huge computational resources that are required to solve todays grand challenges, at a fraction of the cost of developing sequential machines of equal power. However, even with such attractive benefits the parallel software industry is still very small co...
| 主要な著者: | , |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | English |
| 出版事項: |
1997
|
| 主題: |
| _version_ | 1826286463125291008 |
|---|---|
| author | Knee, S Knee, Simon |
| author_facet | Knee, S Knee, Simon |
| author_sort | Knee, S |
| collection | OXFORD |
| description | <p>Parallel processing can provide the huge computational resources that are required to solve todays grand challenges, at a fraction of the cost of developing sequential machines of equal power. However, even with such attractive benefits the parallel software industry is still very small compared to its sequential counterpart. This has been attributed to the lack of an accepted parallel model of computation, therefore leading to software which is architecture dependent with unpredictable performance. The Bulk Synchronous Parallel (BSP) model provides a solution to these problems and can be compared to the Von Neumann model of sequential computation.</p> <p>In this thesis we investigate the issues involved in providing a modular programming environment based on the BSP model. Using our results we present Opal, a BSP programming language that has been designed for parallel programming-in-the-large. While other BSP languages and libraries have been developed, none of them provide support for libraries of parallel algorithms.</p> <p>A library mechanism must be introduced into BSP without destroying the existing cost model. We examine such issues and show that the active library mechanism of Opal leads to algorithms which still have predictable performance.</p> <p>If algorithms are to retain acceptable levels of performance across a range of machines then they must be able to adapt to the architecture that they are executing on. Such adaptive algorithms require support from the programming language, an issue that has been addressed in Opal.</p> <p>To demonstrate the Opal language and its modular features we present a number of example algorithms. Using an Opal compiler that has been developed we show that we can accurately predict the performance of these algorithms.</p> <p>The thesis concludes that by using Opal it is possible to program the BSP model in a modular fashion that follows good software engineering principles. This enables large scale parallel software to be developed that is architecture independent, has predictable performance and is adaptive to the target architecture.</p> |
| first_indexed | 2024-03-07T01:44:09Z |
| format | Thesis |
| id | oxford-uuid:97d95f01-a098-499c-8c07-303b853c2460 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T01:44:09Z |
| publishDate | 1997 |
| record_format | dspace |
| spelling | oxford-uuid:97d95f01-a098-499c-8c07-303b853c24602022-03-27T00:02:49ZOpalThesishttp://purl.org/coar/resource_type/c_db06uuid:97d95f01-a098-499c-8c07-303b853c2460Parallel processing (Electronic computers)Synchronous data transmission systemsProgramming languages (Electronic computers)EnglishPolonsky Theses Digitisation Project1997Knee, SKnee, Simon<p>Parallel processing can provide the huge computational resources that are required to solve todays grand challenges, at a fraction of the cost of developing sequential machines of equal power. However, even with such attractive benefits the parallel software industry is still very small compared to its sequential counterpart. This has been attributed to the lack of an accepted parallel model of computation, therefore leading to software which is architecture dependent with unpredictable performance. The Bulk Synchronous Parallel (BSP) model provides a solution to these problems and can be compared to the Von Neumann model of sequential computation.</p> <p>In this thesis we investigate the issues involved in providing a modular programming environment based on the BSP model. Using our results we present Opal, a BSP programming language that has been designed for parallel programming-in-the-large. While other BSP languages and libraries have been developed, none of them provide support for libraries of parallel algorithms.</p> <p>A library mechanism must be introduced into BSP without destroying the existing cost model. We examine such issues and show that the active library mechanism of Opal leads to algorithms which still have predictable performance.</p> <p>If algorithms are to retain acceptable levels of performance across a range of machines then they must be able to adapt to the architecture that they are executing on. Such adaptive algorithms require support from the programming language, an issue that has been addressed in Opal.</p> <p>To demonstrate the Opal language and its modular features we present a number of example algorithms. Using an Opal compiler that has been developed we show that we can accurately predict the performance of these algorithms.</p> <p>The thesis concludes that by using Opal it is possible to program the BSP model in a modular fashion that follows good software engineering principles. This enables large scale parallel software to be developed that is architecture independent, has predictable performance and is adaptive to the target architecture.</p> |
| spellingShingle | Parallel processing (Electronic computers) Synchronous data transmission systems Programming languages (Electronic computers) Knee, S Knee, Simon Opal |
| title | Opal |
| title_full | Opal |
| title_fullStr | Opal |
| title_full_unstemmed | Opal |
| title_short | Opal |
| title_sort | opal |
| topic | Parallel processing (Electronic computers) Synchronous data transmission systems Programming languages (Electronic computers) |
| work_keys_str_mv | AT knees opal AT kneesimon opal |