S. Fiore, Alessandro Negro, S. Vadacca, Emanuele Verdesca, A. Leone, G. Aloisio
Grid portals are web gateways aiming at providing a pervasive and ubiquitous access in grid to computational resources, tools, instruments, datasets and metadata via standard Web protocols. Moreover, they provide enhanced problem solving capabilities to deal with modern, large scale scientific and engineering problems. Data grid management systems are becoming increasingly important in the context of the recently adopted service oriented paradigm. The grid relational catalog (GRelC) project is working towards ubiquitous, integrated, seamless and comprehensive grid database management solutions. This paper describes the GRelC Portal, a web based grid-enabled solution for grid-database access, management and integration built on top of the GRelC Data Access Service.
{"title":"The GRelC Portal: A Ubiquitous and Seamless Way to Manage Grid Databases","authors":"S. Fiore, Alessandro Negro, S. Vadacca, Emanuele Verdesca, A. Leone, G. Aloisio","doi":"10.1109/PDCAT.2008.76","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.76","url":null,"abstract":"Grid portals are web gateways aiming at providing a pervasive and ubiquitous access in grid to computational resources, tools, instruments, datasets and metadata via standard Web protocols. Moreover, they provide enhanced problem solving capabilities to deal with modern, large scale scientific and engineering problems. Data grid management systems are becoming increasingly important in the context of the recently adopted service oriented paradigm. The grid relational catalog (GRelC) project is working towards ubiquitous, integrated, seamless and comprehensive grid database management solutions. This paper describes the GRelC Portal, a web based grid-enabled solution for grid-database access, management and integration built on top of the GRelC Data Access Service.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133029301","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}
In a multi-agent system, a single agent may not be capable of completing complex tasks. Therefore agents are required to form a team to fulfill the task requirements. In this paper an agent model is introduced that facilitates cooperation among agents. The experimental results demonstrate that the model is significantly useful in achieving cooperation under various environmental constraints. It also allows agents to adjust their teammate selection strategy according to environmental constraints.
{"title":"Finding Interaction Partners Using Attitude-Based Decision Strategies","authors":"Toktam Ebadi, Maryam A. Purvis, M. Purvis","doi":"10.1109/PDCAT.2008.45","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.45","url":null,"abstract":"In a multi-agent system, a single agent may not be capable of completing complex tasks. Therefore agents are required to form a team to fulfill the task requirements. In this paper an agent model is introduced that facilitates cooperation among agents. The experimental results demonstrate that the model is significantly useful in achieving cooperation under various environmental constraints. It also allows agents to adjust their teammate selection strategy according to environmental constraints.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402750","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}
S. Fiore, Alessandro Negro, S. Vadacca, G. Aloisio
Nowadays production grids such as EGEE, Teragrid, DEISA adopt several tools in order to monitor jobs, check the status of the grid, manage accounting information, etc. Anyway, from the end-user perspective, monitoring the global status of the grid taking into account machines, networks, services, databases, job, etc. is not straightforward, uniform, and tightly coupled. What we present in this paper is the iGRelC dashboard, an integrated approach able to retrieve, process and display information coming from different data sources (both relational and non-relational) and published in grid by heterogeneous systems and services.
{"title":"iGRelC: A Dashboard Implementation for Grid Environments","authors":"S. Fiore, Alessandro Negro, S. Vadacca, G. Aloisio","doi":"10.1109/PDCAT.2008.75","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.75","url":null,"abstract":"Nowadays production grids such as EGEE, Teragrid, DEISA adopt several tools in order to monitor jobs, check the status of the grid, manage accounting information, etc. Anyway, from the end-user perspective, monitoring the global status of the grid taking into account machines, networks, services, databases, job, etc. is not straightforward, uniform, and tightly coupled. What we present in this paper is the iGRelC dashboard, an integrated approach able to retrieve, process and display information coming from different data sources (both relational and non-relational) and published in grid by heterogeneous systems and services.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117271126","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}
Most fault localization techniques are based on time windows. The sizes of time windows impact on the accuracy of fault localization greatly. This paper takes weighted bipartite graph as fault propagation model and proposes a heuristic fault localization approach based on sliding window with preprocessing mechanism (SWPM) to alleviate the shortcomings. First, SWPM defines the concept of symptom extension ratio and partitions observed symptoms into three segments: analyzed segment, analyzing segment, preprocessing segment. Then it determines the most probable fault set through incrementally computing Bayesian suspected degree (BSD) of the three segments and combining their results. Simulations show that the algorithm can reduce the impacts on the accuracy affected by improper window sizes. The algorithm which has a polynomial computational complexity can be applied to large scale communication network.
{"title":"SWPM: An Incremental Fault Localization Algorithm Based on Sliding Window with Preprocessing Mechanism","authors":"Cheng Zhang, J. Liao, Xiaomin Zhu","doi":"10.1109/PDCAT.2008.57","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.57","url":null,"abstract":"Most fault localization techniques are based on time windows. The sizes of time windows impact on the accuracy of fault localization greatly. This paper takes weighted bipartite graph as fault propagation model and proposes a heuristic fault localization approach based on sliding window with preprocessing mechanism (SWPM) to alleviate the shortcomings. First, SWPM defines the concept of symptom extension ratio and partitions observed symptoms into three segments: analyzed segment, analyzing segment, preprocessing segment. Then it determines the most probable fault set through incrementally computing Bayesian suspected degree (BSD) of the three segments and combining their results. Simulations show that the algorithm can reduce the impacts on the accuracy affected by improper window sizes. The algorithm which has a polynomial computational complexity can be applied to large scale communication network.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121933126","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}
Molecular Dynamics (MD) simulation requires huge computational power, as each atom interacts with the others by long range forces such as the Coulomb or van der Waals forces. Recently, a video game computer, such as SONY PLAYSTATION 3 (PS3) or NVIDIApsilas Graphics Processing Unit (GPU) has become a candidate hardware for accelerating MD simulations as well as an MDGRAPE-3 special-purpose computer for their better performance than current CPU of the PC, and also for their cost-effectiveness. Especially the latest GPU has much more peak performance than a CPU of the PC or an MDGRAPE-3, though a GPU has much more overheads in accelerating MD simulations. When the number of particles is small or the calculation kernel becomes complicated, the performance of the GPU drops dramatically as low as that of the MDGRAPE-3. However, the acceleration ratio of the GPU and the PS3 per cost exceeds that of the MDGRAPE-3.
{"title":"Overheads in Accelerating Molecular Dynamics Simulations with GPUs","authors":"T. Narumi, Ryuji Sakamaki, S. Kameoka, K. Yasuoka","doi":"10.1109/PDCAT.2008.68","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.68","url":null,"abstract":"Molecular Dynamics (MD) simulation requires huge computational power, as each atom interacts with the others by long range forces such as the Coulomb or van der Waals forces. Recently, a video game computer, such as SONY PLAYSTATION 3 (PS3) or NVIDIApsilas Graphics Processing Unit (GPU) has become a candidate hardware for accelerating MD simulations as well as an MDGRAPE-3 special-purpose computer for their better performance than current CPU of the PC, and also for their cost-effectiveness. Especially the latest GPU has much more peak performance than a CPU of the PC or an MDGRAPE-3, though a GPU has much more overheads in accelerating MD simulations. When the number of particles is small or the calculation kernel becomes complicated, the performance of the GPU drops dramatically as low as that of the MDGRAPE-3. However, the acceleration ratio of the GPU and the PS3 per cost exceeds that of the MDGRAPE-3.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128559708","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}
Introduction of multi-core structures has not led to a decline in the rapid performance improvement of COTS CPU recently. On the other hand, the performance of memory and I/O systems is insufficient to catch up with that of COTS CPU. In this paper, with a view to realizing high-performance computer systems not only for HPC but also for Google-like servers, we propose concepts concerning memory systems and network systems with large extended memory. We introduce DIMMnet-3, which is a practical solution to enhance memory system and I/O system of PC, and Toshiba Cell Reference Set. Examples of the killer applications of this new type of hardware are presented. Communication mechanisms named LHS and LHC are also proposed. These are architectures for reducing latency for mixed messages with small controlling data and large acknowledge data. The latency evaluation of them is shown.
{"title":"An Enhancer of Memory and Network for Cluster and its Applications","authors":"N. Tanabe, H. Nakajo","doi":"10.1109/PDCAT.2008.59","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.59","url":null,"abstract":"Introduction of multi-core structures has not led to a decline in the rapid performance improvement of COTS CPU recently. On the other hand, the performance of memory and I/O systems is insufficient to catch up with that of COTS CPU. In this paper, with a view to realizing high-performance computer systems not only for HPC but also for Google-like servers, we propose concepts concerning memory systems and network systems with large extended memory. We introduce DIMMnet-3, which is a practical solution to enhance memory system and I/O system of PC, and Toshiba Cell Reference Set. Examples of the killer applications of this new type of hardware are presented. Communication mechanisms named LHS and LHC are also proposed. These are architectures for reducing latency for mixed messages with small controlling data and large acknowledge data. The latency evaluation of them is shown.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128709724","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}
Location consistency (LC) is a weak memory consistency model which is defined entirely on partial order execution semantics of parallel programs. Compared with sequential consistency (SC), LC is scalable and provides ample theoretical parallelism. This makes LC an interesting memory model in the upcoming many-core parallel processing era. Previous work has pointed out that LC does not guarantee SC execution behavior for all data race free programs. In this paper, we compare the semantics of LC with PRAM consistency and memory coherence, and prove that LC is strictly weaker than PRAM consistency. For data race free programs, we prove that the semantics of LC is equivalent to memory coherence. In addition, by introducing memory ordering semantics into LC judiciously, we prove that the enhanced model is equivalent to SC for data race free programs. Finally, we discuss possible solutions for adding reasoning rules for LC-like weak memory models.
{"title":"Location Consistency Model Revisited: Problem, Solution and Prospects","authors":"Guoping Long, Nan Yuan, Dongrui Fan","doi":"10.1109/PDCAT.2008.31","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.31","url":null,"abstract":"Location consistency (LC) is a weak memory consistency model which is defined entirely on partial order execution semantics of parallel programs. Compared with sequential consistency (SC), LC is scalable and provides ample theoretical parallelism. This makes LC an interesting memory model in the upcoming many-core parallel processing era. Previous work has pointed out that LC does not guarantee SC execution behavior for all data race free programs. In this paper, we compare the semantics of LC with PRAM consistency and memory coherence, and prove that LC is strictly weaker than PRAM consistency. For data race free programs, we prove that the semantics of LC is equivalent to memory coherence. In addition, by introducing memory ordering semantics into LC judiciously, we prove that the enhanced model is equivalent to SC for data race free programs. Finally, we discuss possible solutions for adding reasoning rules for LC-like weak memory models.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124059384","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}
Advancement in parallel computers technology has greatly influenced the numerical methods used for solving partial differential equations (pdes). A lot of attention has been devoted to the development of numerical schemes which are suitable for the parallel environment. In this work, we investigate the parallel implementation of the four-point Modified Explicit Decoupled Group (MEDG) method which was introduced by Ali and Ng (2007) as a fast solver for the two dimensional Poisson pde. The method was shown to be more superior than all the methods belonging to the four-points explicit group family namely the Explicit Group (EG) [8], Explicit Decoupled Group (EDG) [1] and Modified Explicit Group (MEG) [7]. This paper presents the preliminary results of the parallel algorithms implemented on a distributed memory PC cluster. Two parallelizing strategies comprising of the two-color zebra and the four-color chessboard orderings in solving a two dimensional Poisson model problem will be discussed.
{"title":"A New Iterative Eliiptic PDE Solver on a Distributed PC Cluster","authors":"N. M. Ali, Kok Fu Ng","doi":"10.1109/PDCAT.2008.41","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.41","url":null,"abstract":"Advancement in parallel computers technology has greatly influenced the numerical methods used for solving partial differential equations (pdes). A lot of attention has been devoted to the development of numerical schemes which are suitable for the parallel environment. In this work, we investigate the parallel implementation of the four-point Modified Explicit Decoupled Group (MEDG) method which was introduced by Ali and Ng (2007) as a fast solver for the two dimensional Poisson pde. The method was shown to be more superior than all the methods belonging to the four-points explicit group family namely the Explicit Group (EG) [8], Explicit Decoupled Group (EDG) [1] and Modified Explicit Group (MEG) [7]. This paper presents the preliminary results of the parallel algorithms implemented on a distributed memory PC cluster. Two parallelizing strategies comprising of the two-color zebra and the four-color chessboard orderings in solving a two dimensional Poisson model problem will be discussed.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126414259","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}
Anne-Cécile Orgerie, L. Lefèvre, Jean-Patrick Gelas
The question of energy savings has been a matter of concern since a long time in the mobile distributed systems and battery-constrained systems. However, for large-scale non-mobile distributed systems, which nowadays reach impressive sizes, the energy dimension (electrical consumption) just starts to be taken into account. In this paper, we analyze the usage of an experimental grid over a one-year period. Based on this analysis, we propose a resource reservation infrastructure which takes into account the energy issue. We validate our infrastructure on the large scale experimental Grid5000 platform and present the obtained gains in terms of energy.
{"title":"Chasing Gaps between Bursts: Towards Energy Efficient Large Scale Experimental Grids","authors":"Anne-Cécile Orgerie, L. Lefèvre, Jean-Patrick Gelas","doi":"10.1109/PDCAT.2008.80","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.80","url":null,"abstract":"The question of energy savings has been a matter of concern since a long time in the mobile distributed systems and battery-constrained systems. However, for large-scale non-mobile distributed systems, which nowadays reach impressive sizes, the energy dimension (electrical consumption) just starts to be taken into account. In this paper, we analyze the usage of an experimental grid over a one-year period. Based on this analysis, we propose a resource reservation infrastructure which takes into account the energy issue. We validate our infrastructure on the large scale experimental Grid5000 platform and present the obtained gains in terms of energy.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132408609","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}
In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set routing in a dual-cube. A dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube Dn with n links per node, the algorithm finds n disjoint paths, node sirarrtj (1 les i, j les n), si isin S, tj isin T, in O (n2 log n) time and the maximum length of the paths is bounded by 3n + 3.
在本文中，我们提出了一种寻找双立方体中集对集路由不相交路径的有效算法。双立方体是一种类似超立方体的互连网络，每个节点的链路数量是包含相同数量节点的超立方体的一半。对于每个节点有n条链路的双立方Dn，算法在O (n2 log n)时间内找到n条不相交的路径，节点sirartj (1 les i, j les n)，节点siisin S，节点tjisin T，路径的最大长度以3n + 3为界。
{"title":"Set-to-Set Disjoint Paths Routing in Dual-Cubes","authors":"K. Kaneko, S. Peng","doi":"10.1109/PDCAT.2008.11","DOIUrl":"https://doi.org/10.1109/PDCAT.2008.11","url":null,"abstract":"In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set routing in a dual-cube. A dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube D<sub>n</sub> with n links per node, the algorithm finds n disjoint paths, node s<sub>i</sub>rarrt<sub>j</sub> (1 les i, j les n), s<sub>i</sub> isin S, tj isin T, in O (n<sup>2</sup> log n) time and the maximum length of the paths is bounded by 3n + 3.","PeriodicalId":282779,"journal":{"name":"2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128446622","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：