Proceedings International Parallel and Distributed Processing Symposium最新文献_第10页

The maximal utilization of processor co-allocation in multicluster systems 多集群系统中处理器协同分配的最大利用率

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213154

A. Bucur, D. Epema

引用次数: 33

Gigapixel-size real-time interactive image processing with parallel computers 使用并行计算机进行十亿像素级的实时交互式图像处理

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213426

Donald R. Jones, E. Jurrus, B. Moon, Kenneth A. Perrine

引用次数: 13

Better real-time response for time-share scheduling 为分时调度提供更好的实时响应

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213246

Scott A. Banachowski, S. Brandt

引用次数: 13

A comparison between MPI and OpenMP branch-and-bound skeletons MPI和OpenMP分支绑定骨架的比较

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213254

I. Dorta, C. León, C. Rodríguez

引用次数: 9

Performance analysis of distributed search in open agent systems 开放代理系统中分布式搜索的性能分析

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213097

V. Dimakopoulos, E. Pitoura

{"title":"Performance analysis of distributed search in open agent systems","authors":"V. Dimakopoulos, E. Pitoura","doi":"10.1109/IPDPS.2003.1213097","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213097","url":null,"abstract":"In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem are based on a central directory that maintains a mapping between agents and resources. However, such solutions do not scale well since the central directory becomes a bottleneck in terms of both performance and reliability. In this paper, we introduce a different approach: each agent maintains a limited size local cache in which it keeps information about k different resources, that is, for each of k resources, it stores the contact information of one agent that provides it. This creates a directed network of caches. We address the following fundamental problem: how can an agent that needs a particular resource find an agent that provides it by navigating through this network of caches? We propose and analytically compare the performance of three different algorithms for this problem, flooding, teeming and random paths, in terms of three performance measures: the probability to locate the resource, the number of steps and the number of messages to do so. Our analysis is also applicable to distributed search in unstructured peer-to-peer networks.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133473487","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}

引用次数: 20

Enhanced processor budget for QoS management in multimedia systems 多媒体系统QoS管理中增强的处理器预算

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213244

Chang-Gun Lee, L. Sha

引用次数: 1

An accurate and efficient parallel genetic algorithm to schedule tasks on a cluster 一种精确、高效的并行遗传算法来调度集群上的任务

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213276

Michelle D. Moore

引用次数: 26

Use of the parallel port to measure MPI intertask communication costs in COTS PC clusters 使用并行端口来测量COTS PC集群中的MPI任务间通信成本

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213497

Maya Haridasan, G. H. Pfitscher

引用次数: 2

Programming metasystems with active objects 用活动对象编程元系统

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213257

M. D. Santo, Franco Frattolillo, N. Ranaldo, W. Russo, E. Zimeo

引用次数: 8

Simulation of dynamic data replication strategies in Data Grids 数据网格中动态数据复制策略的仿真

Proceedings International Parallel and Distributed Processing Symposium Pub Date : 2003-04-22 DOI: 10.1109/IPDPS.2003.1213206

H. Lamehamedi, Zujun Shentu, B. Szymanski, E. Deelman

{"title":"Simulation of dynamic data replication strategies in Data Grids","authors":"H. Lamehamedi, Zujun Shentu, B. Szymanski, E. Deelman","doi":"10.1109/IPDPS.2003.1213206","DOIUrl":"https://doi.org/10.1109/IPDPS.2003.1213206","url":null,"abstract":"Data Grids provide geographically distributed resources for large-scale data-intensive applications that generate large data sets. However, ensuring efficient access to such huge and widely distributed data is hindered by the high latencies of the Internet. We address these challenges by employing intelligent replication and caching of objects at strategic locations. In our approach, replication decisions are based on a cost-estimation model and driven by the estimation of the data access gains and the replica's creation and maintenance costs. These costs are in turn based on factors such as runtime accumulated read/write statistics, network latency, bandwidth, and replica size. To support large numbers of users who continuously change their data and processing needs, we introduce scalable replica distribution topologies that adapt replica placement to meet these needs. In this paper we present the design of our dynamic memory middleware and replication algorithm. To evaluate the performance of our approach, we developed a Data Grid simulator, called the GridNet. Simulation results demonstrate that replication improves the data access time in Data Grids, and that the gain increases with the size of the datasets involved.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116949461","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}

引用次数: 179