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

Concurr. Pract. Exp.最新文献

筛选
英文 中文
Parallel thinning algorithms on multicomputers: experimental study on load balancing 多机并行细化算法:负载平衡的实验研究
Concurr. Pract. Exp. Pub Date : 2000-04-25 DOI: 10.1002/1096-9128(20000425)12:5%3C327::AID-CPE493%3E3.0.CO;2-4
M. G. Montoya, C. Gil, I. García
{"title":"Parallel thinning algorithms on multicomputers: experimental study on load balancing","authors":"M. G. Montoya, C. Gil, I. García","doi":"10.1002/1096-9128(20000425)12:5%3C327::AID-CPE493%3E3.0.CO;2-4","DOIUrl":"https://doi.org/10.1002/1096-9128(20000425)12:5%3C327::AID-CPE493%3E3.0.CO;2-4","url":null,"abstract":"In this work, a practical implementation of two parallel thinning algorithms on a multicomputer system are described. The solution has been conceived for a multiprocessor using the SPMD (single program multiple data) programming model. Our main goal is intended to describe our experiences on data partition/distribution among processors for parallel thinning algorithms as a representative type of algorithm where communications take place between neighbor processors and the work load for each processor depends on the input data. It will be shown how the efficiency of the parallel implementation can be improved through the application of a preprocess. This preprocess is based on the analysis of the work load balance. An analysis of the communication cost is also made. Although the results shown here are concerned with the implementations of two parallel thinning algorithms we think that our proposal about data distribution is general and useful for a wide set of algorithms in the field of image processing. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114451684","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
Concurrent programming in VISO VISO中的并发编程
Concurr. Pract. Exp. Pub Date : 2000-04-25 DOI: 10.1002/1096-9128(20000425)12:5%3C281::AID-CPE488%3E3.0.CO;2-5
M. Al-Mulhem
{"title":"Concurrent programming in VISO","authors":"M. Al-Mulhem","doi":"10.1002/1096-9128(20000425)12:5%3C281::AID-CPE488%3E3.0.CO;2-5","DOIUrl":"https://doi.org/10.1002/1096-9128(20000425)12:5%3C281::AID-CPE488%3E3.0.CO;2-5","url":null,"abstract":"SUMMARY Concurrent programming is more difficult to use and understand than sequential programming. In order to simplify this type of programming a number of approaches have been developed such as visual programming. Visual Occam (VISO) is a visual programming language for concurrent programming. It has a graphical syntax based on the language Occam and its semantics is represented both in petri net and process calculus. This paper presents a modular visual approach to write concurrent programs using the VISO language. Concurrent programs in VISO are specified graphically at different levels of","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127067254","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
PRAM programming: in theory and in practice PRAM编程:理论和实践
Concurr. Pract. Exp. Pub Date : 2000-04-10 DOI: 10.1002/(SICI)1096-9128(20000410)12:4%3C211::AID-CPE477%3E3.0.CO;2-R
David Lecomber, Constantinos J. Siniolakis, K. R. Sujithan
{"title":"PRAM programming: in theory and in practice","authors":"David Lecomber, Constantinos J. Siniolakis, K. R. Sujithan","doi":"10.1002/(SICI)1096-9128(20000410)12:4%3C211::AID-CPE477%3E3.0.CO;2-R","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(20000410)12:4%3C211::AID-CPE477%3E3.0.CO;2-R","url":null,"abstract":"That the influence of the PRAM model is ubiquitous in parallel algorithm design is as clear as the fact that it is technologically infeasible for the forseeable future. The current generation of parallel hardware prominently features distributed memory and high-performance interconnection networks—very much the antithesis of the shared memory required for the PRAM model. It has been shown that, in spite of communication costs, for some problems very fast parallel algorithms are available for distributed-memory machines—from embarassingly parallel problems to sorting and numerical analysis. In contrast it is known that for other classes of problem PRAM-style shared-memory simulation on a distributed-memory machine can, in theory, produce solutions of comparable performance to the best possible for such architectures. \u0000 \u0000 \u0000 \u0000The Bulk Synchronous Parallel (BSP) model accurately represents most parallel machines—theoretical and actual—in an execution and cost model. We introduce a scalable portable PRAM realization appropriate for BSP computers and a methodology for usage. Our system is fast and built upon the familiar sequential C++ coupled with the new standard BSP library of parallel computation and communication primitives. It is portable to and predictable on a vast number of parallel computers including workstation clusters, a 256-processor Cray T3D, an 8-node IBM SP/2 and a 4-node shared-memory SGI Power Challenge machine. Our approach achieves simplicity of programming over direct-mode BSP programming for reasonable overhead cost. We objectively compare optimized BSP and PRAM algorithms implemented with our C++ PRAM library and provide encouraging experimental results for our new style of programming. Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129280624","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
Single address space implementation in distributed systems 分布式系统中的单地址空间实现
Concurr. Pract. Exp. Pub Date : 2000-04-10 DOI: 10.1002/(SICI)1096-9128(20000410)12:4%3C251::AID-CPE475%3E3.0.CO;2-T
Alberto Bartoli, G. Dini, L. Lopriore
{"title":"Single address space implementation in distributed systems","authors":"Alberto Bartoli, G. Dini, L. Lopriore","doi":"10.1002/(SICI)1096-9128(20000410)12:4%3C251::AID-CPE475%3E3.0.CO;2-T","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(20000410)12:4%3C251::AID-CPE475%3E3.0.CO;2-T","url":null,"abstract":"With reference to a distributed context consisting of computers connected by a local area network, we present the organization of a memory management system giving physical support to a uniform, persistent vision of storage according to a single address space paradigm. Our system implements a two-layer storage hierarchy in which the distributed secondary memory stores the valid data items and the primary memory supports a form of data caching, for fast processor access. \u0000 \u0000The proposed system defines a small, powerful set of operations that allow application programs to exert explicit control over the memory management activities at the levels of physical storage allocation, data migration across the network, and the data movements between the secondary memory and the primary memory. The system, that has been implemented in prototype form, is assessed from a number of viewpoints. We show that the storage requirements of the information for memory management are negligible. Moreover, the number of messages necessary to determine the network location of a given data item is low and independent of both the network size and the past movements of this data item in the distributed storage.Copyright © 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129912691","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
On the implementation of the Opus coordination language 论Opus协调语言的实现
Concurr. Pract. Exp. Pub Date : 2000-04-10 DOI: 10.1002/(SICI)1096-9128(20000410)12:4%3C227::AID-CPE474%3E3.0.CO;2-H
E. Laure, M. Haines, P. Mehrotra, H. Zima
{"title":"On the implementation of the Opus coordination language","authors":"E. Laure, M. Haines, P. Mehrotra, H. Zima","doi":"10.1002/(SICI)1096-9128(20000410)12:4%3C227::AID-CPE474%3E3.0.CO;2-H","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(20000410)12:4%3C227::AID-CPE474%3E3.0.CO;2-H","url":null,"abstract":"Opus is a new programming language designed to assist in coordinating the execution of multiple, independent program modules. With the help of Opus, coarse grained tush parallelism between data parallel modules can be expressed in a clean and structured way, In this paper we address the problems of how to build a compilation and runtime support system that can efficiently implement the Opus constructs, Our design considers the often-conflicting goals of efficiency and modular construction through software re-use, In particular, we present the system requirements for an efficient Opus implementation, the Opus runtime system, and describe how they work together to provide the underlying services that the Opus compiler needs for a broad class of machines, Copyright (C) 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133292715","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
Towards a Scalable Hybrid Sparse Solver 一种可伸缩混合稀疏求解器
Concurr. Pract. Exp. Pub Date : 2000-02-01 DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3%3C53::AID-CPE473%3E3.0.CO;2-B
E. Ng, P. Raghavan
{"title":"Towards a Scalable Hybrid Sparse Solver","authors":"E. Ng, P. Raghavan","doi":"10.1002/(SICI)1096-9128(200002/03)12:2/3%3C53::AID-CPE473%3E3.0.CO;2-B","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(200002/03)12:2/3%3C53::AID-CPE473%3E3.0.CO;2-B","url":null,"abstract":"Consider the solution of very large, sparse linear systems. The most popular techniques can be broadly classified as either direct or iterative. When the sparse matrix is symmetric and positive definite, direct methods use Cholesky factorization while iterative methods rely on Conjugate Gradients. Our goal is to develop a scalable and memory-efficient hybrid of the two methods that can be implemented with high efficiency on both serial and parallel computers and be suitable for a wide range of problems. We discuss our overall design with emphasis on performance and scalability issues, and report on progress to date.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130184739","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
H-SWEB: A Hierarchical Scheduling System for Distributed WWW Server Clusters H-SWEB:分布式WWW服务器集群的分层调度系统
Concurr. Pract. Exp. Pub Date : 2000-02-01 DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3%3C189::AID-CPE465%3E3.0.CO;2-B
Daniel Andresen, Timothy McCune
{"title":"H-SWEB: A Hierarchical Scheduling System for Distributed WWW Server Clusters","authors":"Daniel Andresen, Timothy McCune","doi":"10.1002/(SICI)1096-9128(200002/03)12:2/3%3C189::AID-CPE465%3E3.0.CO;2-B","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(200002/03)12:2/3%3C189::AID-CPE465%3E3.0.CO;2-B","url":null,"abstract":"In this paper we present a model for dynamically scheduling HTTP requests across clusters of servers, optimizing the use of client resources as well as the scattered server nodes. We also present a system, H-SWEB, implementing our techniques and showing experimental improvements of over 250%, which have been achieved through utilizing a global approach to scheduling requests. This is the first system to provide a hierarchical scheduling mechanism for distributed HTTP server clusters incorporating dynamic client–server task distribution and distributed data access. H-SWEB uses sophisticated scheduling techniques in monitoring and adapting to workload variation at the client and server clusters for supporting typical digital library tasks, such as fast WWW image browsing. We provide a discussion of our system architecture and implementation, and briefly summarize the experimental and analytical results that have been achieved. Copyright 2000 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116135709","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}
引用次数: 5
A Scheduling Approach to Parallel Harmonic Balance Simulation 并行谐波平衡仿真的调度方法
Concurr. Pract. Exp. Pub Date : 2000-02-01 DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3%3C175::AID-CPE466%3E3.0.CO;2-L
D. Rhodes, A. Gerasoulis
{"title":"A Scheduling Approach to Parallel Harmonic Balance Simulation","authors":"D. Rhodes, A. Gerasoulis","doi":"10.1002/(SICI)1096-9128(200002/03)12:2/3%3C175::AID-CPE466%3E3.0.CO;2-L","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(200002/03)12:2/3%3C175::AID-CPE466%3E3.0.CO;2-L","url":null,"abstract":"Rather than approach the parallelization of the harmonic balance simulation method numerically, a novel scheduling-oriented approach is described. The technique leverages circuit substructure to expose potential parallelism in the form of a directed, acyclic graph (dag) of computations. This dag is then allocated and scheduled using various linear clustering techniques. The result is a highly scalable and efficient approach to harmonic balance simulation. Two large examples, one from the integrated circuit regime and another from the communication regime, executed on three different parallel computers are used to demonstrate the efficacy of the approach. Published in 2000 by John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126511101","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
The SDSC encryption/authentication (SEA) system SDSC加密/认证(SEA)系统
Concurr. Pract. Exp. Pub Date : 1999-12-25 DOI: 10.1002/(SICI)1096-9128(19991225)11:15%3C913::AID-CPE460%3E3.0.CO;2-O
W. Schroeder
{"title":"The SDSC encryption/authentication (SEA) system","authors":"W. Schroeder","doi":"10.1002/(SICI)1096-9128(19991225)11:15%3C913::AID-CPE460%3E3.0.CO;2-O","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19991225)11:15%3C913::AID-CPE460%3E3.0.CO;2-O","url":null,"abstract":"As part of the Distributed Object Computation Testbed project (DOCT) and the Data Intensive Computing initiative of the National Partnership for Advanced Computational Infrastructure (NPACI), the San Diego Supercomputer Center has designed and implemented a multi-platform encryption and authentication system referred to as the SDSC Encryption and Authentication, or SEA, system. The SEA system is based on RSA and RC5 encryption capabilities and is designed for use in an HPC/WAN environment containing diverse hardware architectures and operating systems (including Cray T90, Cray T3E, Cray J90, SunOS, Solaris, AIX, SGI, HP, NextStep, and Linux). The system includes the SEA library, which provides reliable, efficient, and flexible authentication and encryption capabilities between two processes communicating via TCP/IP sockets, and SEA utilities/daemons, which provide a simple key management system. It is currently in use by the SDSC Storage Resource Broker (SRB), as well as by user interface utilities to SDSC's installation of the High Performance Storage System (HPSS). This paper presents the design and capabilities of the SEA system and discusses future plans for enhancing this system. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"39 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":"122436719","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
Managing clusters of geographically distributed high-performance computers 管理地理上分布的高性能计算机集群
Concurr. Pract. Exp. Pub Date : 1999-12-25 DOI: 10.1002/(SICI)1096-9128(19991225)11:15%3C887::AID-CPE459%3E3.0.CO;2-J
M. Brune, J. Gehring, A. Keller, A. Reinefeld
{"title":"Managing clusters of geographically distributed high-performance computers","authors":"M. Brune, J. Gehring, A. Keller, A. Reinefeld","doi":"10.1002/(SICI)1096-9128(19991225)11:15%3C887::AID-CPE459%3E3.0.CO;2-J","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19991225)11:15%3C887::AID-CPE459%3E3.0.CO;2-J","url":null,"abstract":"We present a software system for the management of geographically distributed high‐performance computers. It consists of three components: \u0000 \u00001. The Computing Center Software (CCS) is a vendor‐independent resource management software for local HPC systems. It controls the mapping and scheduling of interactive and batch jobs on massively parallel systems; \u0000 \u00002. The Resource and Service Description (RSD) is used by CCS for specifying and mapping hardware and software components of (meta‐)computing environments. It has a graphical user interface, a textual representation and an object‐oriented API; \u0000 \u00003. The Service Coordination Layer (SCL) co‐ordinates the co‐operative use of resources in autonomous computing sites. It negotiates between the applications' requirements and the available system services.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"16 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":"133602324","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}
引用次数: 25
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信