Pub Date : 2000-12-25DOI: 10.1002/1096-9128(20001225)12:15%3C1455::AID-CPE538%3E3.0.CO;2-%23
D. Walker, Maozhen Li, O. Rana, Matthew S. Shields, Yan Huang
This paper describes the functionality and software architecture of a generic problem-solving environment (PSE) for collaborative computational science and engineering. A PSE is designed to provide transparent access to heterogeneous distributed computing resources, and is intended to enhance research productivity by making it easier to construct, run, and analyze the results of computer simulations. Although implementation details are not discussed in depth, the role of software technologies such as CORBA, Java, and XML is outlined. An XML-based component model is presented. The main features of a Visual Component Composition Environment for software development, and an Intelligent Resource Management System for scheduling components, are described. Some prototype implementations of PSE applications are also presented. Copyright 2000 John Wiley & Sons, Ltd.
{"title":"The software architecture of a distributed problem-solving environment","authors":"D. Walker, Maozhen Li, O. Rana, Matthew S. Shields, Yan Huang","doi":"10.1002/1096-9128(20001225)12:15%3C1455::AID-CPE538%3E3.0.CO;2-%23","DOIUrl":"https://doi.org/10.1002/1096-9128(20001225)12:15%3C1455::AID-CPE538%3E3.0.CO;2-%23","url":null,"abstract":"This paper describes the functionality and software architecture of a generic problem-solving environment (PSE) for collaborative computational science and engineering. A PSE is designed to provide transparent access to heterogeneous distributed computing resources, and is intended to enhance research productivity by making it easier to construct, run, and analyze the results of computer simulations. Although implementation details are not discussed in depth, the role of software technologies such as CORBA, Java, and XML is outlined. An XML-based component model is presented. The main features of a Visual Component Composition Environment for software development, and an Intelligent Resource Management System for scheduling components, are described. Some prototype implementations of PSE applications are also presented. Copyright 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124550167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-12-25DOI: 10.1002/1096-9128(20001225)12:15%3C1495::AID-CPE541%3E3.0.CO;2-F
S. Hodgson, N. Dunstan, I. Fris
Extended semaphores systems such as in UNIX System V are a powerful extension of Dijkstra’s semaphores. They allow efficient solutions to a number of classic synchronization problems. UNIX semaphore operations appear to be insufficiently well defined, in particular when a semaphore is repeated in an operator. This results in several solutions relying on assumed properties. A new semaphore operator, isem, based on extended semaphore operators is introduced. The operator isem is clearly defined, can be implemented efficiently, and yields simple solutions to many classic synchronization problems. Copyright 2000 John Wiley & Sons, Ltd.
扩展信号量系统(如UNIX System V)是Dijkstra信号量的强大扩展。它们为许多经典的同步问题提供了有效的解决方案。UNIX信号量操作似乎定义得不够好，特别是当信号量在操作符中重复时。这就产生了依赖于假定属性的几种解决方案。在扩展信号量运算符的基础上，提出了一种新的信号量运算符isem。operator isem定义清晰，可以有效地实现，并为许多经典的同步问题提供简单的解决方案。版权所有2000约翰威利父子有限公司
{"title":"Extended semaphore operations","authors":"S. Hodgson, N. Dunstan, I. Fris","doi":"10.1002/1096-9128(20001225)12:15%3C1495::AID-CPE541%3E3.0.CO;2-F","DOIUrl":"https://doi.org/10.1002/1096-9128(20001225)12:15%3C1495::AID-CPE541%3E3.0.CO;2-F","url":null,"abstract":"Extended semaphores systems such as in UNIX System V are a powerful extension of Dijkstra’s semaphores. They allow efficient solutions to a number of classic synchronization problems. UNIX semaphore operations appear to be insufficiently well defined, in particular when a semaphore is repeated in an operator. This results in several solutions relying on assumed properties. A new semaphore operator, isem, based on extended semaphore operators is introduced. The operator isem is clearly defined, can be implemented efficiently, and yields simple solutions to many classic synchronization problems. Copyright 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"49 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126274194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-11-01DOI: 10.1002/1096-9128(200011)12:13%3C1291::AID-CPE535%3E3.0.CO;2-%23
K. Binu, D. Ram
A number of high-level parallel programming platforms for networks of workstations (NOWs) have been developed in recent times. Most of these platforms target the exploitation of data parallelism in applications. They do not allow expressibility of applications as a collection of tasks along with their precedence relationships. As a result, the control or task parallelism in an application cannot be expressed or exploited. The current work aims at integrating the notion of task parallelism and precedence relationships among constituting tasks to such high-level data parallel platforms for NOWs. Our model of integration provides for arbitrary nesting of data and task parallel modules. Also, the precedence relationships are clearly reflected from the program structure. The model relieves the programmer from the need to design applications for non-determinism in the order of completion of constituting tasks. The design of the runtime support as well as system-level book keeping is discussed. The model is general enough to be applied to a wide range of data parallel platforms. A specific case of integrating the model into anonymous remote computing (ARC), a data parallel programming platform, is presented. The performance related aspects are also discussed. Copyright 2000 John Wiley & Sons, Ltd.
{"title":"Integrating task parallelism in data parallel languages for parallel programming on NOWs","authors":"K. Binu, D. Ram","doi":"10.1002/1096-9128(200011)12:13%3C1291::AID-CPE535%3E3.0.CO;2-%23","DOIUrl":"https://doi.org/10.1002/1096-9128(200011)12:13%3C1291::AID-CPE535%3E3.0.CO;2-%23","url":null,"abstract":"A number of high-level parallel programming platforms for networks of workstations (NOWs) have been developed in recent times. Most of these platforms target the exploitation of data parallelism in applications. They do not allow expressibility of applications as a collection of tasks along with their precedence relationships. As a result, the control or task parallelism in an application cannot be expressed or exploited. The current work aims at integrating the notion of task parallelism and precedence relationships among constituting tasks to such high-level data parallel platforms for NOWs. Our model of integration provides for arbitrary nesting of data and task parallel modules. Also, the precedence relationships are clearly reflected from the program structure. The model relieves the programmer from the need to design applications for non-determinism in the order of completion of constituting tasks. The design of the runtime support as well as system-level book keeping is discussed. The model is general enough to be applied to a wide range of data parallel platforms. A specific case of integrating the model into anonymous remote computing (ARC), a data parallel programming platform, is presented. The performance related aspects are also discussed. Copyright 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124663724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-11-01DOI: 10.1002/1096-9128(200011)12:13%3C1317::AID-CPE536%3E3.0.CO;2-K
Alexey L. Lastovetsky, D. Arapov, A. Kalinov, Ilya Ledovskih
The paper presents a new parallel language, mpC, designed specially for programming high-performance computations on heterogeneous networks of computers, as well as its supportive programming environment. The main idea underlying mpC is that an mpC application explicitly defines an abstract network and distributes data, computations and communications over the network. The mpC programming environment uses at run time this information as well as information about any real executing network in order to map the application to the real network in such a way that ensures efficient execution of the application on this real network. Experience of using mpC for solving both regular and irregular real-life problems on networks of heterogeneous computers is also presented.
{"title":"A parallel language and its programming system for heterogeneous networks","authors":"Alexey L. Lastovetsky, D. Arapov, A. Kalinov, Ilya Ledovskih","doi":"10.1002/1096-9128(200011)12:13%3C1317::AID-CPE536%3E3.0.CO;2-K","DOIUrl":"https://doi.org/10.1002/1096-9128(200011)12:13%3C1317::AID-CPE536%3E3.0.CO;2-K","url":null,"abstract":"The paper presents a new parallel language, mpC, designed specially for programming high-performance computations on heterogeneous networks of computers, as well as its supportive programming environment. The main idea underlying mpC is that an mpC application explicitly defines an abstract network and distributes data, computations and communications over the network. The mpC programming environment uses at run time this information as well as information about any real executing network in order to map the application to the real network in such a way that ensures efficient execution of the application on this real network. Experience of using mpC for solving both regular and irregular real-life problems on networks of heterogeneous computers is also presented.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120962822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-01DOI: 10.1002/1096-9128(200010)12:12%3C1219::AID-CPE530%3E3.0.CO;2-0
Sanjiv Shah, Grant E. Haab, Paul Petersen, J. Throop
{"title":"Flexible control structures for parallelism in OpenMP","authors":"Sanjiv Shah, Grant E. Haab, Paul Petersen, J. Throop","doi":"10.1002/1096-9128(200010)12:12%3C1219::AID-CPE530%3E3.0.CO;2-0","DOIUrl":"https://doi.org/10.1002/1096-9128(200010)12:12%3C1219::AID-CPE530%3E3.0.CO;2-0","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122559609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-10-01DOI: 10.1002/1096-9128(200010)12:12%3C1261::AID-CPE525%3E3.0.CO;2-5
R. Berrendorf, Guido Nieken
OpenMP is emerging as a quasi-standard for shared memory parallel programming on small SMP-systems. To serve as a common programming interface in shared memory parallel programming, scalability to a larger number of nodes and support for different shared memory architectures has to be proven. In this paper we investigate how well the basic constructs of OpenMP are implemented on different parallel computer architectures.
{"title":"Performance characteristics for OpenMP constructs on different parallel computer architectures","authors":"R. Berrendorf, Guido Nieken","doi":"10.1002/1096-9128(200010)12:12%3C1261::AID-CPE525%3E3.0.CO;2-5","DOIUrl":"https://doi.org/10.1002/1096-9128(200010)12:12%3C1261::AID-CPE525%3E3.0.CO;2-5","url":null,"abstract":"OpenMP is emerging as a quasi-standard for shared memory parallel programming on small SMP-systems. To serve as a common programming interface in shared memory parallel programming, scalability to a larger number of nodes and support for different shared memory architectures has to be proven. In this paper we investigate how well the basic constructs of OpenMP are implemented on different parallel computer architectures.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124679832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：