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

Concurr. Pract. Exp.最新文献

筛选
英文 中文
Methodology and tools for system analysis of parallel pipelines 并行管道系统分析的方法和工具
Concurr. Pract. Exp. Pub Date : 1999-09-01 DOI: 10.1002/(SICI)1096-9128(199909)11:11%3C655::AID-CPE449%3E3.0.CO;2-7
M. Fleury, N. Sarvan, A. Downton, A. Clark
{"title":"Methodology and tools for system analysis of parallel pipelines","authors":"M. Fleury, N. Sarvan, A. Downton, A. Clark","doi":"10.1002/(SICI)1096-9128(199909)11:11%3C655::AID-CPE449%3E3.0.CO;2-7","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199909)11:11%3C655::AID-CPE449%3E3.0.CO;2-7","url":null,"abstract":"The pipelines of processor farms PPF design pattern intended for continuous ow embedded systems has been augmented by a software toolkit at the system analysis level Other relevant approaches to system support employing tools are reviewed The PPF structure supports incrementally scalable systems which can meet real time speci cations An outline of the design and development cycle of PPF systems follows The paper considers in detail the prediction component of the cycle A graphical simulation tool for modelling asynchronous pipeline behaviour uses a Java based visual display An extended example showing how the performance tool supports PPF design principles concludes the paper","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130067058","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}
引用次数: 3
Efficient implementation of a portable parallel programming model for image processing 一种可移植的图像处理并行编程模型的高效实现
Concurr. Pract. Exp. Pub Date : 1999-09-01 DOI: 10.1002/(SICI)1096-9128(199909)11:11%3C671::AID-CPE450%3E3.0.CO;2-6
P. Morrow, D. Crookes, T. Brown, G. McAleese, D. Roantree, I. Spence
{"title":"Efficient implementation of a portable parallel programming model for image processing","authors":"P. Morrow, D. Crookes, T. Brown, G. McAleese, D. Roantree, I. Spence","doi":"10.1002/(SICI)1096-9128(199909)11:11%3C671::AID-CPE450%3E3.0.CO;2-6","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199909)11:11%3C671::AID-CPE450%3E3.0.CO;2-6","url":null,"abstract":"This paper describes a domain specific programming model for execution on parallel and distributed architectures. The model has initially been targeted at the application area of image processing, though the techniques developed may be more generally applicable to other domains where an algebraic or library-based approach is common. Efficiency is achieved by the concept of a self-optimising class library of primitive image processing operations, which allows programs to be written in a high level, algebraic notation and which is automatically parallelised (using an application-specific data parallel approach). The class library is extended automatically with optimised operations, generated by a transformation system, giving improved execution performance. The parallel implementation of the model described here is based on MPI and has been tested on a C40 processor network, a quad-processor Unix workstation, and a network of PCs running Linux. Timings are included to indicate the impact of the automatic optimisation facility (rather than the effect of parallelisation). Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133965603","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}
引用次数: 24
Converting best manual practice into generic automatable strategies for unstructured mesh parallelisation 将最佳手工实践转化为非结构化网格并行化的通用自动化策略
Concurr. Pract. Exp. Pub Date : 1999-09-01 DOI: 10.1002/(SICI)1096-9128(199909)11:11%3C593::AID-CPE446%3E3.0.CO;2-L
K. McManus, S. Johnson, M. Cross
{"title":"Converting best manual practice into generic automatable strategies for unstructured mesh parallelisation","authors":"K. McManus, S. Johnson, M. Cross","doi":"10.1002/(SICI)1096-9128(199909)11:11%3C593::AID-CPE446%3E3.0.CO;2-L","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199909)11:11%3C593::AID-CPE446%3E3.0.CO;2-L","url":null,"abstract":"The manual effort required to convert sequential computational mechanics programs into a useful, scalable parallel form is considerable. Tools that can assist in the conversion process are clearly required. Computer aided parallelisation tools (CAPTools) have been developed to generate efficient parallel code for real world structured grid application codes such as Computational Fluid Dynamics. Automatable single-program multi-data (SPMD) overlapping domain decomposition (DD) techniques established for structured grid codes have been adapted by the authors to manually parallelise unstructured mesh applications. Inspector loops have been used to provide generic techniques for the run-time support necessary to extend the capabilities of CAPTools to automatic implementation of SPMD DD techniques in the parallelisation of unstructured mesh codes. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132595998","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}
引用次数: 3
Accurate performance prediction using visual prototypes 使用视觉原型进行准确的性能预测
Concurr. Pract. Exp. Pub Date : 1999-09-01 DOI: 10.1002/(SICI)1096-9128(199909)11:11%3C615::AID-CPE447%3E3.0.CO;2-H
George R. Ribeiro-Justo, T. Delaitre, M. Zemerly, S. Winter
{"title":"Accurate performance prediction using visual prototypes","authors":"George R. Ribeiro-Justo, T. Delaitre, M. Zemerly, S. Winter","doi":"10.1002/(SICI)1096-9128(199909)11:11%3C615::AID-CPE447%3E3.0.CO;2-H","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199909)11:11%3C615::AID-CPE447%3E3.0.CO;2-H","url":null,"abstract":"Behavioural and performance analysis is a fundamental problem in the development of parallel (and distributed) programs. To address this problem, models and supporting environments are required to enable designers to build and analyse their programs. The model we put forward in this paper combines graphical and textual representations of the program structure and uses discrete-event simulation for performance and behaviour predictions. A graphical environment supports our model, providing, amongst other features, a graphical editor, a simulation engine and a performance and behaviour visualisation tool. A number of case studies using this environment are also provided for illustration and validation of our model. Prediction errors observed in comparisons of real execution and simulation of case studies have accuracy to within 10%.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131636986","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
An analytical tool for predicting the performance of parallel relational databases 预测并行关系数据库性能的分析工具
Concurr. Pract. Exp. Pub Date : 1999-09-01 DOI: 10.1002/(SICI)1096-9128(199909)11:11%3C635::AID-CPE448%3E3.0.CO;2-C
M. H. Williams, E. Dempster, Neven Tomov, C. S. Pua, H. Taylor, A. Burger, J. Lü, P. Broughton
{"title":"An analytical tool for predicting the performance of parallel relational databases","authors":"M. H. Williams, E. Dempster, Neven Tomov, C. S. Pua, H. Taylor, A. Burger, J. Lü, P. Broughton","doi":"10.1002/(SICI)1096-9128(199909)11:11%3C635::AID-CPE448%3E3.0.CO;2-C","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199909)11:11%3C635::AID-CPE448%3E3.0.CO;2-C","url":null,"abstract":"The uptake of parallel DBMSs is being hampered by uncertainty about the impact on performance of porting database applications from sequential to parallel systems. The development of tools which aid the system manager or machine vendor could help to reduce this problem. This paper describes an analytical tool which determines the performance characteristics (in terms of throughput, resource utilisation and response time) of relational database transactions executing on particular machine configurations and provides simple graphical visualisations of these to enable users to obtain rapid insight into particular scenarios. The problems of handling different parallel DBMSs are illustrated with reference to three systems – Ingres, Informix and Oracle. A brief description is also given of two different approaches used to confirm the validity of the analytical approach on which the tool is based. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123747804","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}
引用次数: 11
CRAFT: a framework for F90/HPF compiler optimizations CRAFT: F90/HPF编译器优化的框架
Concurr. Pract. Exp. Pub Date : 1999-08-25 DOI: 10.1002/(SICI)1096-9128(19990825)11:10%3C529::AID-CPE439%3E3.0.CO;2-S
Jan-Jan Wu, Marina C. Chen, J. Cowie
{"title":"CRAFT: a framework for F90/HPF compiler optimizations","authors":"Jan-Jan Wu, Marina C. Chen, J. Cowie","doi":"10.1002/(SICI)1096-9128(19990825)11:10%3C529::AID-CPE439%3E3.0.CO;2-S","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19990825)11:10%3C529::AID-CPE439%3E3.0.CO;2-S","url":null,"abstract":"In this paper, we give an overview of the results of the CRAFT optimising compiler project (Fortran 90/HPF subset compilers). We start by describing the theoretical framework within which we designed program transformations for the optimization of interand intraprocedural data motion, as well as the optimizations for parallel loops; we then describe the implementation of the CRAFT compilers for Thinking Machines’ CM-2 and CM-5. We report results from experiments on the Connection Machine CM-5, the IBM SP-2 and a network of UltraSparc workstations. The results demonstrate that these optimizations can achieve significant object code performance improvement. Copyright 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125208423","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
Parallel sensitivity analysis for DAEs with many parameters 多参数DAEs的并行灵敏度分析
Concurr. Pract. Exp. Pub Date : 1999-08-25 DOI: 10.1002/(SICI)1096-9128(19990825)11:10%3C571::AID-CPE440%3E3.0.CO;2-%23
Wenjie Zhu, L. Petzold
{"title":"Parallel sensitivity analysis for DAEs with many parameters","authors":"Wenjie Zhu, L. Petzold","doi":"10.1002/(SICI)1096-9128(19990825)11:10%3C571::AID-CPE440%3E3.0.CO;2-%23","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19990825)11:10%3C571::AID-CPE440%3E3.0.CO;2-%23","url":null,"abstract":"In this paper, we discuss the parallel computation of the sensitivity analysis of systems of differential-algebraic equations (DAEs) with a moderate number of state variables and a large number of sensitivity parameters. Several parallel implementations based on DASSLSO are explored and their performance when using the Message Passing Interface (MPI) on an SGI Origin 2000 is compared. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130459889","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}
引用次数: 9
Reproducible execution of SR programs 可重复执行的SR程序
Concurr. Pract. Exp. Pub Date : 1999-08-10 DOI: 10.1002/(SICI)1096-9128(19990810)11:9%3C479::AID-CPE441%3E3.0.CO;2-S
R. Olsson
{"title":"Reproducible execution of SR programs","authors":"R. Olsson","doi":"10.1002/(SICI)1096-9128(19990810)11:9%3C479::AID-CPE441%3E3.0.CO;2-S","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19990810)11:9%3C479::AID-CPE441%3E3.0.CO;2-S","url":null,"abstract":"Reproducing the execution of a concurrent program is important in debugging and testing. It requires that, regardless of the actual order in which processes may execute, the reproduced execution is identical, with respect to the order in which certain activities occur, to a previously recorded execution. This paper presents a solution to the reproducibility problem for programs written in the SR concurrent programming language. Our solution transforms an arbitrary SR program into one for recording an event sequence and one for replaying from an event sequence. SR provides a rich collection of synchronization mechanisms, including rendezvous, asynchronous message passing, remote procedure call, and dynamic process creation. SR language features allow: exible invocation servicing (e.g., use of invo-cation parameters in selecting an invocation to service in message passing or rendezvous); dynamically created processes and resource (module) instances; dynamic communication paths between processes; and dynamic distribution of programs across multiple machines. Because of these features, adaptations of previous solutions to the reproducibility problem for other languages and notations do not work for SR. Our solution handles all the above features. It results in a naturally distributed control algorithm for programs that are distributed. This paper also describes the implementations of our transformation tools.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125925942","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}
引用次数: 3
Predicting the execution time of message passing models 预测消息传递模型的执行时间
Concurr. Pract. Exp. Pub Date : 1999-08-10 DOI: 10.1002/(SICI)1096-9128(19990810)11:9%3C461::AID-CPE436%3E3.0.CO;2-2
J. R. García, C. Rodríguez, Daniel González-Morales, F. Almeida
{"title":"Predicting the execution time of message passing models","authors":"J. R. García, C. Rodríguez, Daniel González-Morales, F. Almeida","doi":"10.1002/(SICI)1096-9128(19990810)11:9%3C461::AID-CPE436%3E3.0.CO;2-2","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19990810)11:9%3C461::AID-CPE436%3E3.0.CO;2-2","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128470341","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}
引用次数: 19
Usefulness of adaptive load sharing for parallel processing on networks of workstations 自适应负载共享对工作站网络并行处理的有用性
Concurr. Pract. Exp. Pub Date : 1999-07-01 DOI: 10.1002/(SICI)1096-9128(199907)11:8%3C387::AID-CPE432%3E3.0.CO;2-4
S. Clarke, S. Dandamudi
{"title":"Usefulness of adaptive load sharing for parallel processing on networks of workstations","authors":"S. Clarke, S. Dandamudi","doi":"10.1002/(SICI)1096-9128(199907)11:8%3C387::AID-CPE432%3E3.0.CO;2-4","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199907)11:8%3C387::AID-CPE432%3E3.0.CO;2-4","url":null,"abstract":"Networks of workstations (NOWs) can be used for parallel processing by using public domain software like PVM. However, NOW-based parallel processing suffers from node heterogeneity, background load variations, and high-latency, low-bandwidth communication network. Previous studies on load sharing in NOW-based systems have indicated that, for applications using the work-pile model, a simple load sharing scheme in which the master process gives a fixed amount of work to the slave processes performs as well as any other, more complex schemes. In this paper, we propose a new adaptive load sharing scheme and evaluate its performance using a Pentium-based NOW machine. The communication network used in the system consists of the standard 10 Mbps Ethernet and the 100 Mbps fast Ethernet. We use both these networks to study their impact on the performance of our new policy. The results presented here indicate that the new policy is useful for computation-intensive applications. Copyright  1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134628664","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
首页 上一页 下一页 尾页
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学术官方微信