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

Concurr. Pract. Exp.最新文献

筛选
英文 中文
Seamless computing with WebSubmit 无缝计算与WebSubmit
Concurr. Pract. Exp. Pub Date : 1999-12-25 DOI: 10.1002/(SICI)1096-9128(19991225)11:15%3C949::AID-CPE462%3E3.0.CO;2-Y
R. McCormack, J. Koontz, J. Devaney
{"title":"Seamless computing with WebSubmit","authors":"R. McCormack, J. Koontz, J. Devaney","doi":"10.1002/(SICI)1096-9128(19991225)11:15%3C949::AID-CPE462%3E3.0.CO;2-Y","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19991225)11:15%3C949::AID-CPE462%3E3.0.CO;2-Y","url":null,"abstract":"WebSubmit is a Web-browser based interface to heterogeneous collections of remote high-performance computing resources. It makes these resources easier to use by replacing a constantly changing range of unfamiliar , command-driven queuing systems and application environments with a single, seamless user interface. WebSubmit lets users run in their regular accounts on the remote system. Strong authentication using the Secure Sockets Layer protocol allows registered users connect to the Web-Submit authority. When validated by the authority they gain access to a group of application modules. Each application module is presented as an HTML form; this form is lled out and submitted to the server, which then processes the request and executes the desired tasks on the speciied remote system using the Secure Shell protocol. The system is exible and extensible, and its modularity promotes ease of use, maintainability, and interface development.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124470138","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}
引用次数: 12
Editorial: Special Issue: Aspects of Seamless Computing 社论:特刊:无缝计算的各个方面
Concurr. Pract. Exp. Pub Date : 1999-12-25 DOI: 10.1002/(SICI)1096-9128(19991225)11:15%3C885::AID-CPE487%3E3.0.CO;2-S
Mark Baker
{"title":"Editorial: Special Issue: Aspects of Seamless Computing","authors":"Mark Baker","doi":"10.1002/(SICI)1096-9128(19991225)11:15%3C885::AID-CPE487%3E3.0.CO;2-S","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19991225)11:15%3C885::AID-CPE487%3E3.0.CO;2-S","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132959501","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
Parallel adaptive wavefront algorithms solving Lyapunov equations for the Cholesky factor on message passing multiprocessors 求解消息传递多处理器上Cholesky因子Lyapunov方程的并行自适应波前算法
Concurr. Pract. Exp. Pub Date : 1999-12-10 DOI: 10.1002/(SICI)1096-9128(19991210)11:14%3C849::AID-CPE463%3E3.0.CO;2-G
J. M. Claver, V. Hernández
{"title":"Parallel adaptive wavefront algorithms solving Lyapunov equations for the Cholesky factor on message passing multiprocessors","authors":"J. M. Claver, V. Hernández","doi":"10.1002/(SICI)1096-9128(19991210)11:14%3C849::AID-CPE463%3E3.0.CO;2-G","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19991210)11:14%3C849::AID-CPE463%3E3.0.CO;2-G","url":null,"abstract":"The order of the matrices involved in several algebraic problems decreases during the solution process In these cases parallel algorithms which use adaptive solving blocks sizes o er better performance results than the ones obtained on parallel algorithms using traditional constant block sizes Recently new parallel wavefront algorithms solving the Lyapunov equations for the Cholesky factor using Hammarling s method on message passing multiprocessors systems have been designed In this paper new parallel adapative versions of these parallel algorithms are described and experimental results obtained on an SGI Power Challenge are presented","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121651461","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
Parallel unstructured tetrahedral mesh adaptation: algorithms, implementation and scalability 并行非结构化四面体网格自适应:算法、实现和可扩展性
Concurr. Pract. Exp. Pub Date : 1999-12-10 DOI: 10.1002/(SICI)1096-9128(19991210)11:14%3C863::AID-CPE464%3E3.0.CO;2-T
P. Selwood, M. Berzins
{"title":"Parallel unstructured tetrahedral mesh adaptation: algorithms, implementation and scalability","authors":"P. Selwood, M. Berzins","doi":"10.1002/(SICI)1096-9128(19991210)11:14%3C863::AID-CPE464%3E3.0.CO;2-T","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19991210)11:14%3C863::AID-CPE464%3E3.0.CO;2-T","url":null,"abstract":"The use of unstructured adaptive tetrahedral meshes in the solution of transient flows poses a challenge for parallel computing due to the irregular and frequently changing nature of the data and its distribution. A parallel mesh adaptation algorithm, PTETRAD, for unstructured tetrahedral meshes (based on the serial code TETRAD) is described and analysed. The portable implementation of the parallel code in C with MPI is described and discussed. The scalability of the code is considered, analysed and illustrated by numerical experiments using a shock wave diffraction problem.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"59 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124318638","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}
引用次数: 16
MPOOL: an object-oriented library for task composition and co-ordination 用于任务组合和协调的面向对象库
Concurr. Pract. Exp. Pub Date : 1999-12-10 DOI: 10.1002/(SICI)1096-9128(19991210)11:14%3C835::AID-CPE457%3E3.0.CO;2-I
A. Poggi, G. Destri
{"title":"MPOOL: an object-oriented library for task composition and co-ordination","authors":"A. Poggi, G. Destri","doi":"10.1002/(SICI)1096-9128(19991210)11:14%3C835::AID-CPE457%3E3.0.CO;2-I","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19991210)11:14%3C835::AID-CPE457%3E3.0.CO;2-I","url":null,"abstract":"MPOOL is an object-oriented extension to the MPI library, based on three categories of objects, called units, groups and schemes. Units are active objects composed of data (state) and procedures (like traditional passive objects), but with the additional ability to store incoming messages in a queue while they are active and to send messages in parallel to other units; moreover, different units may be active simultaneously. Groups and schemes are passive objects used for the composition of units and the co-ordination of their actions. Groups manage collective communications and synchronization operations such as barriers. Schemes compose units' actions through the use of a set of constructs derived by path expressions. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116460778","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 concurrent process creation service to support SPMD based parallel processing on COWs 支持基于SPMD的奶牛并行处理的并发进程创建服务
Concurr. Pract. Exp. Pub Date : 1999-11-01 DOI: 10.1002/(SICI)1096-9128(199911)11:13%3C803::AID-CPE455%3E3.0.CO;2-3
M. Hobbs, A. Goscinski
{"title":"A concurrent process creation service to support SPMD based parallel processing on COWs","authors":"M. Hobbs, A. Goscinski","doi":"10.1002/(SICI)1096-9128(199911)11:13%3C803::AID-CPE455%3E3.0.CO;2-3","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199911)11:13%3C803::AID-CPE455%3E3.0.CO;2-3","url":null,"abstract":"Current software environments used to support parallel processing on a cluster of workstations (COW) are not satisfactory, do not provide complete transparency and are not specifically designed for parallel processing. In particular, the establishment of a parallel processing environment and the initialisation of parallel processes suffer from poor performance. Each parallel process of an application is created sequentially and in many cases the logon operation must be completed before remote resources could be acquired. These operations are also performed manually. We present in this paper an original approach that addresses the problem of parallel process creation. The remote workstations are acquired completely transparently and dynamically, and parallel processes are created concurrently. To demonstrate the feasibility of this approach we show a system based on RHODOS (a client/server and microkernel based distributed operating system), specifically designed to improve the performance of process instantiation and therefore able to improve the overall execution performance of parallel programs, in particular parallel process creation. Copyright  1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134313856","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}
引用次数: 13
A load balanced distributed computing system 负载均衡的分布式计算系统
Concurr. Pract. Exp. Pub Date : 1999-10-01 DOI: 10.1002/(SICI)1096-9128(199910)11:12%3C753::AID-CPE454%3E3.0.CO;2-A
M. Bozyigit, J. Al-Ghamdi, M. Ghouseuddin, H. Barada
{"title":"A load balanced distributed computing system","authors":"M. Bozyigit, J. Al-Ghamdi, M. Ghouseuddin, H. Barada","doi":"10.1002/(SICI)1096-9128(199910)11:12%3C753::AID-CPE454%3E3.0.CO;2-A","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199910)11:12%3C753::AID-CPE454%3E3.0.CO;2-A","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114613971","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}
引用次数: 4
Engineering parallel symbolic programs in GPH GPH中的工程并行符号程序
Concurr. Pract. Exp. Pub Date : 1999-10-01 DOI: 10.1002/(SICI)1096-9128(199910)11:12%3C701::AID-CPE443%3E3.0.CO;2-P
Hans-Wolfgang Loidl, P. Trinder, K. Hammond, S. Junaidu, Richard G. Morgan, S. Jones
{"title":"Engineering parallel symbolic programs in GPH","authors":"Hans-Wolfgang Loidl, P. Trinder, K. Hammond, S. Junaidu, Richard G. Morgan, S. Jones","doi":"10.1002/(SICI)1096-9128(199910)11:12%3C701::AID-CPE443%3E3.0.CO;2-P","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199910)11:12%3C701::AID-CPE443%3E3.0.CO;2-P","url":null,"abstract":"We investigate the claim that functional languages offer low-cost parallelism in the context of symbolic programs on modest parallel architectures. In our investigation we present the first comparative study of the construction of large applications in a parallel functional language, in our case in Glasgow Parallel Haskell (GPH). The applications cover a range of application areas, use several parallel programming paradigms, and are measured on two very different parallel architectures. \u0000 \u0000On the applications level the most significant result is that we are able to achieve modest wall-clock speedups (between factors of 2 and 10) over the optimised sequential versions for all but one of the programs. Speedups are obtained even for programs that were not written with the intention of being parallelised. These gains are achieved with a relatively small programmer-effort. One reason for the relative ease of parallelisation is the use of evaluation strategies, a new parallel programming technique that separates the algorithm from the co-ordination of parallel behaviour. \u0000 \u0000On the language level we show that the combination of lazy and parallel evaluation is useful for achieving a high level of abstraction. In particular we can describe top-level parallelism, and also preserve module abstraction by describing parallelism over the data structures provided at the module interface (‘data-oriented parallelism’). Furthermore, we find that the determinism of the language is helpful, as is the largely implicit nature of parallelism in GPH. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126688108","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}
引用次数: 44
Predictable communication on unpredictable networks: implementing BSP over TCP/IP and UDP/IP 在不可预测的网络上进行可预测的通信:在TCP/IP和UDP/IP上实现BSP
Concurr. Pract. Exp. Pub Date : 1999-09-01 DOI: 10.1002/(SICI)1096-9128(199909)11:11%3C687::AID-CPE451%3E3.0.CO;2-L
S. Donaldson, Jonathan M. D. Hill, D. Skillicorn
{"title":"Predictable communication on unpredictable networks: implementing BSP over TCP/IP and UDP/IP","authors":"S. Donaldson, Jonathan M. D. Hill, D. Skillicorn","doi":"10.1002/(SICI)1096-9128(199909)11:11%3C687::AID-CPE451%3E3.0.CO;2-L","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199909)11:11%3C687::AID-CPE451%3E3.0.CO;2-L","url":null,"abstract":"The BSP cost model measures the cost of communication using a single architectural parameter, g, which measures permeability of the network to continuous traffic. Architectures such as networks of workstations pose particular problems for high-performance communication because it is hard to achieve high communication throughput, and even harder to do so predictably. Yet both of these are required for BSP to be effective. We present a technique for controlling applied communication load that achieves both. Traffic is presented to the communication network at a rate chosen to maximise throughput and minimise its variance. Significant performance improvements can be achieved compared to unstructured communication over the same transport protocols as in the case of, for example, MPI. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"42 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":"126099527","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}
引用次数: 10
Editorial: Portable software tools for parallel architectures 社论:并行架构的可移植软件工具
Concurr. Pract. Exp. Pub Date : 1999-09-01 DOI: 10.1002/(SICI)1096-9128(199909)11:11%3C587::AID-CPE445%3E3.0.CO;2-D
C. Wadsworth
{"title":"Editorial: Portable software tools for parallel architectures","authors":"C. Wadsworth","doi":"10.1002/(SICI)1096-9128(199909)11:11%3C587::AID-CPE445%3E3.0.CO;2-D","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199909)11:11%3C587::AID-CPE445%3E3.0.CO;2-D","url":null,"abstract":"","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"360 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":"124535674","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学术官方微信