Concurr. Pract. Exp.最新文献_第9页

Scheduling tasks of multi-join queries in a multiprocessor 调度多处理器中多连接查询的任务

Concurr. Pract. Exp. Pub Date : 1999-04-25 DOI: 10.1002/(SICI)1096-9128(19990425)11:5%3C247::AID-CPE421%3E3.0.CO;2-G

A. Averbuch, Y. Roditty, Barack Shoham

{"title":"Scheduling tasks of multi-join queries in a multiprocessor","authors":"A. Averbuch, Y. Roditty, Barack Shoham","doi":"10.1002/(SICI)1096-9128(19990425)11:5%3C247::AID-CPE421%3E3.0.CO;2-G","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19990425)11:5%3C247::AID-CPE421%3E3.0.CO;2-G","url":null,"abstract":"This paper deals with the problem of scheduling spawned tasks when a query is issued to a database which resides on a MIMD multiprocessor. These tasks have the property that their associated dependency scheme can be presented as a directed tree. We present a theoretical framework with extensive experimental simulations which increase the throughput of database applications. We derive a family of algorithms for scheduling tasks. Their performance is tested on several common multiprocessor configurations. For better performance the adaptation of the scheduling algorithm to the multiprocessor configuration is examined and analyzed. The scheduling algorithms are divided into two cases: (a) permitted changes in the resources connection scheme of the multiprocessor, and (b) no changes allowed. The algorithms are scalable and their complexity is computed. In particular, we present an algorithm for scheduling tasks in the case where the construction of a central storage location is permitted. One of the main tools for the construction of the above algorithms is the notion of (t, 1)domination and k-domination sets. Copyright  1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131832813","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

Self-Avoiding Walks over Adaptive Unstructured Grids 自避免行走自适应非结构化网格

Concurr. Pract. Exp. Pub Date : 1999-04-12 DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3%3C85::AID-CPE471%3E3.0.CO;2-8

G. Heber, R. Biswas, G. Gao

引用次数: 25

A Simple Framework to Calculate the Reaching Definition of Array References and Its Use in Subscript Array Analysis 一种计算数组引用到达定义的简单框架及其在下标数组分析中的应用

Concurr. Pract. Exp. Pub Date : 1999-04-12 DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3%3C125::AID-CPE469%3E3.0.CO;2-H

Yuan Lin, D. Padua

引用次数: 4

ParaPART: Parallel Mesh Partitioning Tool for Distributed Systems ParaPART:分布式系统的并行网格划分工具

Concurr. Pract. Exp. Pub Date : 1999-04-12 DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3%3C111::AID-CPE470%3E3.0.CO;2-J

Jing Chen, V. Taylor

{"title":"ParaPART: Parallel Mesh Partitioning Tool for Distributed Systems","authors":"Jing Chen, V. Taylor","doi":"10.1002/(SICI)1096-9128(200002/03)12:2/3%3C111::AID-CPE470%3E3.0.CO;2-J","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(200002/03)12:2/3%3C111::AID-CPE470%3E3.0.CO;2-J","url":null,"abstract":"In this paper, we present ParaPART, a parallel version of a mesh partitioning tool, called PART, for distributed systems. PART takes into consideration the heterogeneities in processor performance, network performance and application computational complexities to achieve a balanced estimate of execution time across the processors in the distributed system. Simulated annealing is used in PART to perform the backtracking search for desired partitions. ParaPART significantly improves performance of PART by using the asynchronous multiple Markov chain approach of parallel simulated annealing. ParaPART is used to partition six irregular meshes into 8, 16, and 100 subdomains using up to 64 client processors on an IBM SP2 machine. The results show superlinear speedup in most cases and nearly perfect speedup for the rest. Using the partitions from ParaPART, we ran an explicit, 2-D finite element code on two geographically distributed IBM SP machines. Results indicate that ParaPART produces results consistent with PART. The execution time was reduced by 12% as compared with partitions that consider only processor performance; this is significant given the theoretical upper bound of 15% reduction.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134104481","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}

引用次数: 22

Distributed Seismic Unix: a tool for seismic data processing 分布式地震Unix:地震数据处理工具

Concurr. Pract. Exp. Pub Date : 1999-04-10 DOI: 10.1002/(SICI)1096-9128(19990410)11:4%3C169::AID-CPE380%3E3.0.CO;2-M

Alejandro E. Murillo, J. Bell

{"title":"Distributed Seismic Unix: a tool for seismic data processing","authors":"Alejandro E. Murillo, J. Bell","doi":"10.1002/(SICI)1096-9128(19990410)11:4%3C169::AID-CPE380%3E3.0.CO;2-M","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(19990410)11:4%3C169::AID-CPE380%3E3.0.CO;2-M","url":null,"abstract":"This paper describes a distributed system called Distributed Seismic Unix (DSU). DSU provides tools for creating and executing application sequences over several types of multiprocessor environments. DSU is designed to assist geophysicists in developing and executing sequences of Seismic Unix (SU) applications in clusters of workstations as well as on tightly coupled multiprocessor machines. SU is a large collection of subroutine libraries, graphics tools and fundamental seismic data processing applications that is freely available via the Internet from the Center for Wave Phenomena (CWP) of the Colorado School of Mines. SU is currently used at more than 500 sites in 32 countries around the world. DSU is built on top of three publicly available software packages: SU itself; TCL/TK, which provides the necessary tools to build the graphical user interface (GUI); and PVM (Parallel Virtual Machine), which supports process management and communication. DSU handles tree-like graphs representing sequences of SU applications. Nodes of a graph represent SU applications, while the arcs represent the way the data flow from the root node to the lead nodes of the tree. In general the root node corresponds to an application that reads or creates synthetic seismic data, and the leaf nodes are associated with applications that write or display the processed seismic data; intermediate nodes are usually associated with typical seismic processing applications like filters, convolutions and signal processing. Pipelining parallelism is obtained when executing single-branch tree sequences, while a higher degree of parallelism is obtained when executing sequences with several branches. A major advantage of the DSU framework for distribution is that SU applications do not need to be modified for parallelism; only a few low-level system functions need to be modified. Copyright © 1999 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115826785","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}

引用次数: 7

Using Hector to run MPI programs over networked workstations 使用Hector在网络工作站上运行MPI程序

Concurr. Pract. Exp. Pub Date : 1999-04-10 DOI: 10.1002/(SICI)1096-9128(19990410)11:4%3C189::AID-CPE381%3E3.0.CO;2-H

S. Russ, Jonathan Robinson, M. Gleeson, B. Meyers, L. Rajagopalan, Chun-Heong Tan

引用次数: 6

Editorial: Applications of Distributed Computing Environments 社论:分布式计算环境的应用

Concurr. Pract. Exp. Pub Date : 1999-04-10 DOI: 10.1002/(SICI)1096-9128(19990410)11:4%3C167::AID-CPE437%3E3.0.CO;2-9

Mark Baker

引用次数: 0

A co-ordination framework for distributed financial applications 分布式金融应用程序的协调框架

Concurr. Pract. Exp. Pub Date : 1999-04-10 DOI: 10.1002/(SICI)1096-9128(19990410)11:4%3C205::AID-CPE382%3E3.0.CO;2-V

J. Keane

引用次数: 2

SCIPVM: Parallel distributed computing on SCI workstation clusters SCIPVM: SCI工作站集群上的并行分布式计算

Concurr. Pract. Exp. Pub Date : 1999-03-01 DOI: 10.1002/(SICI)1096-9128(199903)11:3%3C121::AID-CPE368%3E3.0.CO;2-Z

I. Zoraja, H. Hellwagner, V. Sunderam

{"title":"SCIPVM: Parallel distributed computing on SCI workstation clusters","authors":"I. Zoraja, H. Hellwagner, V. Sunderam","doi":"10.1002/(SICI)1096-9128(199903)11:3%3C121::AID-CPE368%3E3.0.CO;2-Z","DOIUrl":"https://doi.org/10.1002/(SICI)1096-9128(199903)11:3%3C121::AID-CPE368%3E3.0.CO;2-Z","url":null,"abstract":"Workstation and PC clusters interconnected by SCI (Scalable Coherent Interface) are very promising technologies for high performance cluster computing. Using commercial SBus to SCI interface cards and early system software and drivers, a two-workstation cluster has been constructed for initial testing and evaluation. The PVM system has been adapted to operate on this cluster using raw device access to the SCI interconnect, and preliminary communications performance tests have been carried out. Our preliminary results indicate that communications throughput in the range of 3.5 MBytes/s, and latencies 1 of 620 s can be achieved on SCI clusters. These gures are signiicantly better (by a factor of 3 to 4) than those attainable on typical Ethernet LAN's. Moreover , our experiments were conducted with rst generation SCI hardware, beta device drivers, and relatively slow workstations. We expect that in the very near future, SCI networks will be capable of delivering several tens of MBytes/s bandwidth and a few tens of microseconds latencies, and will signiicantly enhance the viability of cluster computing.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"516 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132967244","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

Simulated annealing task to processor mapping for domain decomposition methods on distributed parallel computers 分布式并行计算机域分解方法的模拟退火任务到处理器映射

Concurr. Pract. Exp. Pub Date : 1999-03-01 DOI: 10.1002/(SICI)1096-9128(199903)11:3%3C155::AID-CPE424%3E3.0.CO;2-X

C. Pain, C. D. Oliveira, A. Goddard

引用次数: 4