发布求助
文献互助 智能选刊 最新文献

Concurr. Pract. Exp.最新文献

筛选
英文 中文
The software architecture of a distributed problem-solving environment 分布式问题解决环境的软件体系结构
Concurr. Pract. Exp. Pub Date : 2000-12-25 DOI: 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
{"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}
引用次数: 86
Extended semaphore operations 扩展信号量操作
Concurr. Pract. Exp. Pub Date : 2000-12-25 DOI: 10.1002/1096-9128(20001225)12:15%3C1495::AID-CPE541%3E3.0.CO;2-F
S. Hodgson, N. Dunstan, I. Fris
{"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}
引用次数: 2
Providing fine-grained access control for Java programs via binary editing 通过二进制编辑为Java程序提供细粒度的访问控制
Concurr. Pract. Exp. Pub Date : 2000-12-10 DOI: 10.1002/1096-9128(20001210)12:14%3C1405::AID-CPE515%3E3.0.CO;2-O
R. Pandey, Brant Hashii
{"title":"Providing fine-grained access control for Java programs via binary editing","authors":"R. Pandey, Brant Hashii","doi":"10.1002/1096-9128(20001210)12:14%3C1405::AID-CPE515%3E3.0.CO;2-O","DOIUrl":"https://doi.org/10.1002/1096-9128(20001210)12:14%3C1405::AID-CPE515%3E3.0.CO;2-O","url":null,"abstract":"SUMMARY There is considerable interest in programs that can migrate from one host to another and execute. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. However, since they cross administrative domains, they have the ability to access and possibly misuse a host’s protected resources. In this paper, we present a novel approach for controlling and protecting a site’s resources. In this approach, a site uses a declarative policy language to specify a set of constraints on accesses to resources. A set of code transformation tools enforces these constraints on mobile programs by integrating the access constraint checking code directly into the mobile program and resource definitions. Using this approach, a site does not need to explicitly include calls to reference monitors in order to protect resources. The performance analysis show that the approach performs better than reference monitor-based approaches in many cases. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"40 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133982262","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}
引用次数: 59
A formal notation and tool for the engineering of CORBA systems 用于CORBA系统工程的正式符号和工具
Concurr. Pract. Exp. Pub Date : 2000-12-10 DOI: 10.1002/1096-9128(20001210)12:14%3C1379::AID-CPE514%3E3.0.CO;2-B
R. Bastide, Ousmane Sy, Philippe A. Palanque
{"title":"A formal notation and tool for the engineering of CORBA systems","authors":"R. Bastide, Ousmane Sy, Philippe A. Palanque","doi":"10.1002/1096-9128(20001210)12:14%3C1379::AID-CPE514%3E3.0.CO;2-B","DOIUrl":"https://doi.org/10.1002/1096-9128(20001210)12:14%3C1379::AID-CPE514%3E3.0.CO;2-B","url":null,"abstract":"CORBA is a standard proposed by the Object Management Group (OMG) in order to promote interoperability between distributed object systems. CORBA provides a programming-language neutral Interface Definition Language (IDL) that describes the syntactic aspects of services supported by remote objects. However, CORBA IDL does not provide any means to specify the behavior of objects in an abstract and formal way. In the current practice, behavioral specification is provided either in plain English, or directly in the programming language chosen for the implementation. We propose to extend the CORBA interface definition of distributed objects by a behavioral specification based on high level Petri nets. We detail at the syntactic and semantic level how this formalism supports the features of the CORBA object model. We present a realistic case study to demonstrate our approach. Our technique allows specifying in an abstract, concise and precise way the behavior of CORBA servers, including internal concurrency and synchronization. As the behavioral specification is fully executable, this approach also enables to prototype and test a distributed object system as soon as the behaviors of individual objects have been defined. The paper discusses several implementation issues of the tool that supports the edition of models and their interactive excution. The high level of formality of the chosen formalism allows for mathematical analysis of behavioral specifications. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125832841","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}
引用次数: 15
Integrating task parallelism in data parallel languages for parallel programming on NOWs 在数据并行语言中集成任务并行性，实现NOWs上的并行编程
Concurr. Pract. Exp. Pub Date : 2000-11-01 DOI: 10.1002/1096-9128(200011)12:13%3C1291::AID-CPE535%3E3.0.CO;2-%23
K. Binu, D. Ram
{"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}
引用次数: 0
A parallel language and its programming system for heterogeneous networks 面向异构网络的并行语言及其编程系统
Concurr. Pract. Exp. Pub Date : 2000-11-01 DOI: 10.1002/1096-9128(200011)12:13%3C1317::AID-CPE536%3E3.0.CO;2-K
Alexey L. Lastovetsky, D. Arapov, A. Kalinov, Ilya Ledovskih
{"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}
引用次数: 23
Inverse Toeplitz eigenproblem on personal computer networks 个人计算机网络上的逆Toeplitz特征问题
Concurr. Pract. Exp. Pub Date : 2000-11-01 DOI: 10.1002/1096-9128(200011)12:13%3C1275::AID-CPE534%3E3.0.CO;2-T
J. M. Badía, A. Vidal
{"title":"Inverse Toeplitz eigenproblem on personal computer networks","authors":"J. M. Badía, A. Vidal","doi":"10.1002/1096-9128(200011)12:13%3C1275::AID-CPE534%3E3.0.CO;2-T","DOIUrl":"https://doi.org/10.1002/1096-9128(200011)12:13%3C1275::AID-CPE534%3E3.0.CO;2-T","url":null,"abstract":"In this paper we present a parallel algorithm for solving the inverse Toeplitz Eigenvalue Problem. The algorithm has been implemented by using a cluster of personal computers, interconnected by a high-performance Myrinet network. We have utilized standard public domain parallel environments for implementing the calculation part as well as the communications, thus producing portable software. The results obtained allow us to confirm the scalability and efficiency of the algorithm. Moreover, we have checked that by using the theoretical cost model provided by the ScaLAPACK we can predict the behaviour of the experimental results. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"82 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":"131523623","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}
引用次数: 1
Flexible control structures for parallelism in OpenMP OpenMP中并行性的灵活控制结构
Concurr. Pract. Exp. Pub Date : 2000-10-01 DOI: 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}
引用次数: 66
Performance characteristics for OpenMP constructs on different parallel computer architectures OpenMP结构在不同并行计算机体系结构上的性能特征
Concurr. Pract. Exp. Pub Date : 2000-10-01 DOI: 10.1002/1096-9128(200010)12:12%3C1261::AID-CPE525%3E3.0.CO;2-5
R. Berrendorf, Guido Nieken
{"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}
引用次数: 15
NanosCompiler: supporting flexible multilevel parallelism exploitation in OpenMP NanosCompiler:在OpenMP中支持灵活的多级并行开发
Concurr. Pract. Exp. Pub Date : 2000-10-01 DOI: 10.1002/1096-9128(200010)12:12%3C1205::AID-CPE524%3E3.0.CO;2-2
Marc González, E. Ayguadé, X. Martorell, Jesús Labarta, N. Navarro, J. Oliver
{"title":"NanosCompiler: supporting flexible multilevel parallelism exploitation in OpenMP","authors":"Marc González, E. Ayguadé, X. Martorell, Jesús Labarta, N. Navarro, J. Oliver","doi":"10.1002/1096-9128(200010)12:12%3C1205::AID-CPE524%3E3.0.CO;2-2","DOIUrl":"https://doi.org/10.1002/1096-9128(200010)12:12%3C1205::AID-CPE524%3E3.0.CO;2-2","url":null,"abstract":"This paper describes the support provided by the NanosCompiler to nested parallelism in OpenMP. The NanosCompiler is a source-to-source parallelizing compiler implemented around a hierarchical internal program representation that captures the parallelism expressed by the user (through OpenMP directives and extensions) and the parallelism automatically discovered by the compiler through a detailed analysis of data and control dependences. The compiler is finally responsible for encapsulating work into threads, establishing their execution precedences and selecting the mechanisms to execute them in parallel. The NanosCompiler enables the experimentation with different work allocation strategies for nested parallel constructs. Some OpenMP extensions are proposed to allow the specification of thread groups and precedence relations among them. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"4 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":"115864151","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}
引用次数: 33
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信