12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.最新文献

筛选
英文 中文
Application of data mining for the analysis of Internet path performance 数据挖掘在互联网路径性能分析中的应用
L. Borzemski, Lukasz Lubczynski, Ziemowit Nowak
{"title":"Application of data mining for the analysis of Internet path performance","authors":"L. Borzemski, Lukasz Lubczynski, Ziemowit Nowak","doi":"10.1109/EMPDP.2004.1271427","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271427","url":null,"abstract":"We apply data mining analysis to study Internet path performance. We show how a data mining system can be used by end-users in this application. The traceroute packet probing technique is used for Internet measurements. The data set is mined using neural clustering and tree classification mining functions available in IBM Intelligent Miner. We discover from the measured data sets how the round-trip times of the packets and the number of hops they pass vary with the day of the week and the time of the measurement. The decision tree model shows good accuracy of 97% and may be useful to predict Internet path performance.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121735504","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}
引用次数: 6
Design, specification, and implementation of a distributed virtual community system 分布式虚拟社区系统的设计、规范和实现
Tom Gross
{"title":"Design, specification, and implementation of a distributed virtual community system","authors":"Tom Gross","doi":"10.1109/EMPDP.2004.1271449","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271449","url":null,"abstract":"We introduce an open distributed virtual community system that supports knowledge workers with functionality for searching and browsing in preprint (e-print) archives as well as for sharing and exchanging their findings in virtual communities. Its functionality combines the strengths of existing systems for information retrieval of online literature with those for sharing and exchanging documents in groups or communities. Being based on open standards such as the open archive initiatives (OAi) standard and XML-RPC, it allows the flexible integration of distributed and heterogeneous components.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121838078","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
A library for load balancing in master/slave applications on a LAN-WLAN environment 一个用于在LAN-WLAN环境中实现主/从应用程序负载平衡的库
David Cruz Sánchez Rodríguez, E. Macías, Álvaro Suárez Sarmiento
{"title":"A library for load balancing in master/slave applications on a LAN-WLAN environment","authors":"David Cruz Sánchez Rodríguez, E. Macías, Álvaro Suárez Sarmiento","doi":"10.1109/EMPDP.2004.1271442","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271442","url":null,"abstract":"A combination of a local area network (LAN) and a wireless LAN (WLAN) is a useful environment for doing parallel computing. We use this infrastructure to implement master/slave parallel distributed programs which exhibit strict data dependences among iterations and parallel calculation inside an iteration. In this environment it is necessary to consider the unbalance both processing power and communication bandwidth of fixed and portable computers to avoid long idle times. To solve this problem, in our previous work we developed an efficient load balancing method that considers the heterogeneity both in computing and in communication, and besides, it keeps in mind that the number of processes can vary at run time (processes spawned on portable computers). To program this method is a hard task because it implements a complex mechanism to estimate the data distribution which uses a framework based on simple network management protocol (SNMP) that has to synchronize with the parallel program to share performance information about computers. For that reason, we present a library that implements our method of load balancing to ease the programming.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122002411","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
Optimal number of nodes for computation in grid environments 网格环境下计算的最优节点数
L. Muttoni, G. Casale, F. Granata, S. Zanero
{"title":"Optimal number of nodes for computation in grid environments","authors":"L. Muttoni, G. Casale, F. Granata, S. Zanero","doi":"10.1109/EMPDP.2004.1271457","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271457","url":null,"abstract":"We show that there exists an optimal number of nodes to be assigned to jobs for execution in grid systems, which depends on the distributions of computation and communication service times. We also show that the analytical models proposed for parallel computers are not accurate for grid systems. We therefore extend to grid environment the definitions of speedup, efficiency and efficacy that are usually given for parallel systems. We also adopt a queueing network model with three different types of workload to prove that in every case an optimal number of nodes exists and that the mean value of CPU and communication service times is just a scale factor for this optimum.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130091291","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
Jace: a Java environment for distributed asynchronous iterative computations Jace:用于分布式异步迭代计算的Java环境
J. Bahi, S. Domas, Kamel Mazouzi
{"title":"Jace: a Java environment for distributed asynchronous iterative computations","authors":"J. Bahi, S. Domas, Kamel Mazouzi","doi":"10.1109/EMPDP.2004.1271465","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271465","url":null,"abstract":"Distributed computing over large networks often suffers poor performances due to architecture heterogeneity and synchronization delays. This is the case of classical computing libraries which are dedicated to parallel machines or clusters. To achieve a better efficiency on multisites heterogeneous networks, one can use asynchronous algorithms which are less sensible to communication delays and loss of messages. Implementing such algorithms with classical MPI versions is not the best choice. We propose Jace, a Java environment dedicated to distributed asynchronous computations, and more especially to asynchronous iterations-asynchronous communications algorithms. It contains all facilities to build a parallel virtual machine and to implement computing tasks in a message passing style. Communications have a special semantic adapted to asynchronism. First tests on a simple Jacobi algorithm clearly show the benefits of our environment to compute on a multisite heterogeneous network, that is, the grid.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131299196","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}
引用次数: 28
Scheduling of tiled nested loops onto a cluster with a fixed number of SMP nodes 将平铺嵌套循环调度到具有固定数量SMP节点的集群上
Maria Athanasaki, Evangelos Koukis, N. Koziris
{"title":"Scheduling of tiled nested loops onto a cluster with a fixed number of SMP nodes","authors":"Maria Athanasaki, Evangelos Koukis, N. Koziris","doi":"10.1109/EMPDP.2004.1271475","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271475","url":null,"abstract":"We propose several alternative methods for the compile time scheduling of tiled nested loops onto a fixed size parallel architecture. We investigate the distribution of tiles among processors, provided that we have chosen either a nonoverlapping communication mode, which involves successive computation and communication steps, or an overlapping communication mode, which supposes a pipelined, concurrent execution of communication and computations. In order to utilize the available processors as efficiently as possible, we can either adopt a cyclic assignment schedule, or assign neighboring tiles to the same CPU, or adapt the size and shape of tiles, so that the required number of processors is exactly equal to the number of the available ones. We theoretically and experimentally compare the proposed schedules, so as to design one which achieves the minimum total execution time, depending on the cluster configuration, (i.e. number and type of nodes, interconnect bandwidth, etc) the internal characteristics of the underlying architecture (i.e. NIC and DMA latencies, etc) and the iteration space size and shape.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116940629","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
Two phase algorithm for load balancing in heterogeneous distributed systems 异构分布式系统负载均衡的两阶段算法
G. Attiya, Y. Hamam
{"title":"Two phase algorithm for load balancing in heterogeneous distributed systems","authors":"G. Attiya, Y. Hamam","doi":"10.1109/EMPDP.2004.1271476","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271476","url":null,"abstract":"A fundamental issue affecting the performance of a parallel application running on a distributed system is the distribution of the workload over the various machines in the system. This problem is known to be NP-hard in most cases and therefore untractable as soon as the number of tasks and/or computers exceeds a few units. This paper first presents a mathematical model for load balancing problem. It then proposes an optimal, memory efficient, two phase algorithm for allocating program modules (tasks) onto processors of a heterogeneous distributed system to minimize the makespan (i.e., the completion time at the maximum loaded processor). The algorithm first finds a near optimal allocation by applying simulated annealing (SA) and then finds an optimal distribution by applying branch-and-bound (BB) technique considering the solution of SA as the initial solution. The proposed algorithm overcomes the low solutions quality that may be obtained by using heuristics. It also overcomes the computational time complexity of the exact algorithms. Some experimental results are given to show the effectiveness of the proposed algorithm.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123880719","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}
引用次数: 55
Adaptive task farm implementation strategies 自适应任务场实现策略
M. Danelutto
{"title":"Adaptive task farm implementation strategies","authors":"M. Danelutto","doi":"10.1109/EMPDP.2004.1271474","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271474","url":null,"abstract":"Task farm parallelism exploitation pattern is used in a wide range of parallel applications. Due to the independence of the computations relative to the different tasks, efficient methods have been developed that can be used to implement task farms on both SMP/MPP and on homogeneous, static network/clusters of workstations. In this work we discuss a new implementation strategy for task farm computations that takes into account dynamicity and heterogeneity in the availability of computing resources as well as fault tolerance. The proposed implementation schema suitably addresses classical situations relative to both peer-to-peer and GRID worlds.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122106590","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}
引用次数: 21
Performance prediction using an application-oriented mapping tool 使用面向应用程序的映射工具进行性能预测
F. Guirado, A. Ripoll, C. Roig, E. Luque
{"title":"Performance prediction using an application-oriented mapping tool","authors":"F. Guirado, A. Ripoll, C. Roig, E. Luque","doi":"10.1109/EMPDP.2004.1271444","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271444","url":null,"abstract":"Simulation frameworks are widely used to carry out performance predictions of parallel programs. In general, these environments do not support the use of automatic mapping mechanisms for assigning tasks to processors. We present a tool called pMAP (predicting the best mapping of parallel applications) that performs the mapping process of message-passing applications starting from the characterization of application behaviour. We show that it is important to explore in these simulation frameworks, not only how many resources are needed to achieve good results, but also how best to map the application onto the parallel system. We study the evaluation of the pMAP tool integrated with the commercial simulator DIMEMAS. The results show that for message-passing applications with different task structures, great improvements in the speedup can be obtained when simulations are carried out with the mappings generated by pMAP.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115448958","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
From session causality to causal consistency 从会话因果关系到因果一致性
J. Brzeziński, Cezary Sobaniec, D. Wawrzyniak
{"title":"From session causality to causal consistency","authors":"J. Brzeziński, Cezary Sobaniec, D. Wawrzyniak","doi":"10.1109/EMPDP.2004.1271440","DOIUrl":"https://doi.org/10.1109/EMPDP.2004.1271440","url":null,"abstract":"We discuss relationships between client-centric consistency models (known as session guarantees), and data-centric consistency models. The first group includes: read-your-writes guarantee, monotonic-writes guarantee, monotonic-reads guarantee and writes-follow-reads guarantee. The other group includes: atomic consistency, sequential consistency, causal consistency, processor consistency, PRAM consistency, weak consistency, release consistency, scope consistency and entry consistency. We use a consistent notation to present formal definitions of both kinds of consistency models in the context of replicated shared objects. Next, we prove a relationship between causal consistency model and client-centric consistency models. Apparently, causal consistency is similar to writes-follow-reads guarantee. We show that in fact causal consistency requires all common session guarantees, i.e. read-your-writes, monotonic-writes, monotonic-reads and writes-follow-reads to be preserved.","PeriodicalId":105726,"journal":{"name":"12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127115263","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}
引用次数: 56
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学术官方微信