In this article we propose an evaluation of the three common algorithms for solving linear system of equations: Gauss elimination, Gauss-Jordan without pivoting and Jacobi with dominant rows. The parallel design of the chosen algorithms is a compromise between the easies and elegant way to implement in MPI and the performance. The result confirmed that for a small number of low cost computers the speedup is acceptable for the Gauss elimination and Gauss-Jordan but for Jacobi with dominant rows if data is not already distributed it is better to implement the serial version
{"title":"Solving System of Linear Equations in a Network of Workstations","authors":"G. Dimitriu, F. Ionescu","doi":"10.1109/ISPDC.2006.45","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.45","url":null,"abstract":"In this article we propose an evaluation of the three common algorithms for solving linear system of equations: Gauss elimination, Gauss-Jordan without pivoting and Jacobi with dominant rows. The parallel design of the chosen algorithms is a compromise between the easies and elegant way to implement in MPI and the performance. The result confirmed that for a small number of low cost computers the speedup is acceptable for the Gauss elimination and Gauss-Jordan but for Jacobi with dominant rows if data is not already distributed it is better to implement the serial version","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126807680","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}
We present an incipient implementation of a programming language that allows programming of real-time applications distributed over a network. We have several goals in mind: First, the language should be built on a sound semantics and offer support for model-based conformance testing. At the same time the language should place the normal programmer (who tends to shy away from exceedingly formal constructs) in a comfortable environment. Thirdly, programs written in this language should run on commodity systems, without relying on real-time support from the kernel. Finally, the language separates the code from timing restrictions, thus allowing for code re-use
{"title":"Distributed, Real-Time Programming on Commodity POSIX Systems: A Preliminary Report","authors":"S. Bruda, Petter Haggholm, Scott Stoddard","doi":"10.1109/ISPDC.2006.21","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.21","url":null,"abstract":"We present an incipient implementation of a programming language that allows programming of real-time applications distributed over a network. We have several goals in mind: First, the language should be built on a sound semantics and offer support for model-based conformance testing. At the same time the language should place the normal programmer (who tends to shy away from exceedingly formal constructs) in a comfortable environment. Thirdly, programs written in this language should run on commodity systems, without relying on real-time support from the kernel. Finally, the language separates the code from timing restrictions, thus allowing for code re-use","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116322623","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}
Summary form only given. GRIDs are large-scale distributed computing infrastructures that enable the integrated and collaborative use of high-end computers, networks, databases, and scientific instruments owned and managed by multiple organizations. Currently, a lot of national and international grid projects aim in building and using grids. One of them is the Austrian Grid. This project targets different areas of applications, including medical sciences, high-energy physics, applied numerical simulations, astrophysical simulations and solar observations, as well as meteorology and geophysics. Corresponding to the previous experience of the initiators of the project a lot of the applications are parallel ones. In the first part of the talk an overview on Austrian Grid will be presented. We will speak about the goals and the results in general. In the second part of the lecture the focus will be on parallel applications. We will discuss some answers given by the research of Austrian grid to questions like: how to map parallel applications onto a grid, which kind of tools are necessary, which extensions of standard middleware are desirable
{"title":"Austrian Grid: Overview on the Project with Focus on Parallel Applications","authors":"J. Volkert","doi":"10.1109/ISPDC.2006.11","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.11","url":null,"abstract":"Summary form only given. GRIDs are large-scale distributed computing infrastructures that enable the integrated and collaborative use of high-end computers, networks, databases, and scientific instruments owned and managed by multiple organizations. Currently, a lot of national and international grid projects aim in building and using grids. One of them is the Austrian Grid. This project targets different areas of applications, including medical sciences, high-energy physics, applied numerical simulations, astrophysical simulations and solar observations, as well as meteorology and geophysics. Corresponding to the previous experience of the initiators of the project a lot of the applications are parallel ones. In the first part of the talk an overview on Austrian Grid will be presented. We will speak about the goals and the results in general. In the second part of the lecture the focus will be on parallel applications. We will discuss some answers given by the research of Austrian grid to questions like: how to map parallel applications onto a grid, which kind of tools are necessary, which extensions of standard middleware are desirable","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781359","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}
Wireless sensor networks play a key role in monitoring remote or inhospitable physical environments. One of the most important constraints is the energy efficiency problem. Power conservation and power management must be taken into account at all levels of the sensor networks system hierarchy. DPM (dynamic power management) technology has been widely used in sensor networks. In this paper, we propose a new energy-efficient DPM, which is a modified sleep state policy developed by Simunic and Chdrakasan (2001) and combined with optimal geographical density control (OGDC) by Zhang and Hou (2004) to keep a minimal number of sensor nodes in the active mode in wireless sensor networks. Implementing dynamic power management with considering the battery status, probability of event generation and OGDC will reduce the energy consumption and prolong the whole lifetime of the sensor networks
{"title":"An Energy-Efficient Dynamic Power Management in Wireless Sensor Networks","authors":"Chuang Lin, Yanxiang He, N. Xiong","doi":"10.1109/ISPDC.2006.8","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.8","url":null,"abstract":"Wireless sensor networks play a key role in monitoring remote or inhospitable physical environments. One of the most important constraints is the energy efficiency problem. Power conservation and power management must be taken into account at all levels of the sensor networks system hierarchy. DPM (dynamic power management) technology has been widely used in sensor networks. In this paper, we propose a new energy-efficient DPM, which is a modified sleep state policy developed by Simunic and Chdrakasan (2001) and combined with optimal geographical density control (OGDC) by Zhang and Hou (2004) to keep a minimal number of sensor nodes in the active mode in wireless sensor networks. Implementing dynamic power management with considering the battery status, probability of event generation and OGDC will reduce the energy consumption and prolong the whole lifetime of the sensor networks","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125030490","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}
Task scheduling is one of the core steps to effectively exploit the capabilities of resources in the grid. The task scheduling problem is an NP-complete problem. This paper studied on the task scheduling problem in grid environment and proposed a task scheduling mechanism, which expressed each possible task scheduling scheme as a task-resource assignment graph (T-RAG) and thus mapped the task scheduling problem into a graph optimal selection problem. Moreover, in order to find the optimal solution quickly and accurately, a task scheduling algorithm based on particle swarm optimization (PSO) was proposed. This algorithm regards the longest path of the task-resource assignment graph as fitness value and encodes every task-resource assignment as a particle. Finally, the experimentation shows that the approach proposed in this paper is effective to solve task scheduling problem
{"title":"Task Scheduling in Grid Based on Particle Swarm Optimization","authors":"Tingwei Chen, Bin Zhang, Xianwen Hao, Yu Dai","doi":"10.1109/ISPDC.2006.46","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.46","url":null,"abstract":"Task scheduling is one of the core steps to effectively exploit the capabilities of resources in the grid. The task scheduling problem is an NP-complete problem. This paper studied on the task scheduling problem in grid environment and proposed a task scheduling mechanism, which expressed each possible task scheduling scheme as a task-resource assignment graph (T-RAG) and thus mapped the task scheduling problem into a graph optimal selection problem. Moreover, in order to find the optimal solution quickly and accurately, a task scheduling algorithm based on particle swarm optimization (PSO) was proposed. This algorithm regards the longest path of the task-resource assignment graph as fitness value and encodes every task-resource assignment as a particle. Finally, the experimentation shows that the approach proposed in this paper is effective to solve task scheduling problem","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124368135","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 present a new token based protocol for group mutual exclusion in distributed systems. The protocol uses one single token to allow multiple processes to enter the critical section for a common session. One of the significant characteristics of the protocol is - concurrency, throughput and waiting time can be regulated adjusting the time period for which a session is declared. The minimum and the maximum number of messages to enter the CS is 0 and (n + 2) respectively where n is the total number of processes in the system. Moreover, simulation results show that the protocol, on average case, considerably reduces the number of messages per entry to the CS and also requires much lower waiting times. The maximum concurrency the protocol supports is n. The protocol also ensures no starvation in the system. Furthermore, this algorithm works out for the extended group mutual exclusion problem as well
{"title":"A New Token Based Protocol for Group Mutual Exclusion in Distributed Systems","authors":"Q. Mamun, H. Nakazato","doi":"10.1109/ISPDC.2006.4","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.4","url":null,"abstract":"In this paper we present a new token based protocol for group mutual exclusion in distributed systems. The protocol uses one single token to allow multiple processes to enter the critical section for a common session. One of the significant characteristics of the protocol is - concurrency, throughput and waiting time can be regulated adjusting the time period for which a session is declared. The minimum and the maximum number of messages to enter the CS is 0 and (n + 2) respectively where n is the total number of processes in the system. Moreover, simulation results show that the protocol, on average case, considerably reduces the number of messages per entry to the CS and also requires much lower waiting times. The maximum concurrency the protocol supports is n. The protocol also ensures no starvation in the system. Furthermore, this algorithm works out for the extended group mutual exclusion problem as well","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132223183","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}
This paper describes a dynamic load balancing tool intended for computational investigators who have little familiarity with programming for a message-passing environment. Motivated by the PAR DOALL directive available in some compilers for shared-memory systems, the tool is designed to simplify the manual conversion of sequential programs containing computationally intensive loops with independent iterates into parallel programs that execute with high efficiency on general-purpose clusters. The tool implements a dynamic loop scheduling strategy to address load imbalance which may be induced by the non-uniformity of loop iterate times, and by the heterogeneity of processors. The tool is based on the message passing interface library for wide availability. Timings of a nontrivial application that utilize the tool on a Linux cluster are presented to demonstrate sample achievable performance
{"title":"A Dynamic Load Balancing Tool for One and Two Dimensional Parallel Loops","authors":"R. Cariño, I. Banicescu","doi":"10.1109/ISPDC.2006.1","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.1","url":null,"abstract":"This paper describes a dynamic load balancing tool intended for computational investigators who have little familiarity with programming for a message-passing environment. Motivated by the PAR DOALL directive available in some compilers for shared-memory systems, the tool is designed to simplify the manual conversion of sequential programs containing computationally intensive loops with independent iterates into parallel programs that execute with high efficiency on general-purpose clusters. The tool implements a dynamic loop scheduling strategy to address load imbalance which may be induced by the non-uniformity of loop iterate times, and by the heterogeneity of processors. The tool is based on the message passing interface library for wide availability. Timings of a nontrivial application that utilize the tool on a Linux cluster are presented to demonstrate sample achievable performance","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"79 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127178332","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}
This paper presents a high level architectural specification of MedioGRID, a research project aiming at implementing a real-time satellite image processing system for extracting relevant environmental and meteorological parameters on a grid system. The presentation focuses on the key architectural decisions of the GRID-aware satellite image processing system, highlighting the technologies for each of the major components. An essential part of managing a global data grid is a monitoring system that is able to monitor and track all the site facilities, networks, and tasks in progress, all in real time. Considering this issue the paper analyzes the possible grid monitoring approaches, proposes a solution and presents a set of monitoring results for the MedioGRID data management subsystem
{"title":"Satellite Image Processing Applications in MedioGRID","authors":"O. Muresan, Florin Pop, D. Gorgan, V. Cristea","doi":"10.1109/ISPDC.2006.42","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.42","url":null,"abstract":"This paper presents a high level architectural specification of MedioGRID, a research project aiming at implementing a real-time satellite image processing system for extracting relevant environmental and meteorological parameters on a grid system. The presentation focuses on the key architectural decisions of the GRID-aware satellite image processing system, highlighting the technologies for each of the major components. An essential part of managing a global data grid is a monitoring system that is able to monitor and track all the site facilities, networks, and tasks in progress, all in real time. Considering this issue the paper analyzes the possible grid monitoring approaches, proposes a solution and presents a set of monitoring results for the MedioGRID data management subsystem","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126475134","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}
This paper introduces an MPI test suite to thoroughly test the correctness of an MPI-implementation. Scientific applications require stable tools and libraries for portable and efficient programming, e. g. when depending on the single-sided communication on multiple platforms. This test suite was originally used to check the correct transmission of data in the PACX-MPI implementation, but has been mainly used and extended to test the development of the new Open MPI implementation. The tool has been designed to be easily extendible in order to integrate new tests using the underlying functionality
{"title":"Testing the Correctness of MPI Implementations","authors":"R. Keller, Michael M. Resch","doi":"10.1109/ISPDC.2006.47","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.47","url":null,"abstract":"This paper introduces an MPI test suite to thoroughly test the correctness of an MPI-implementation. Scientific applications require stable tools and libraries for portable and efficient programming, e. g. when depending on the single-sided communication on multiple platforms. This test suite was originally used to check the correct transmission of data in the PACX-MPI implementation, but has been mainly used and extended to test the development of the new Open MPI implementation. The tool has been designed to be easily extendible in order to integrate new tests using the underlying functionality","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133918685","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}
To reduce interoperability problems arising from ambiguous or incomplete Web services protocol specifications, we have recently introduced a formal framework, which allows modelling and automatic verification of such protocols. However, interoperability problems can still occur due to incorrect implementations. In this paper, we introduce a sniffer based approach to check the conformance of a protocol's implementation to its specification; messages of the actual implementations are captured, processed and checked against the specification's formal model. We also briefly illustrate the application of our framework using a version of the WS-AtomicTransaction protocol
{"title":"A Sniffer Based Approach to WS Protocols Conformance Checking","authors":"Pemadeep Ramsokul, A. Sowmya","doi":"10.1109/ISPDC.2006.5","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.5","url":null,"abstract":"To reduce interoperability problems arising from ambiguous or incomplete Web services protocol specifications, we have recently introduced a formal framework, which allows modelling and automatic verification of such protocols. However, interoperability problems can still occur due to incorrect implementations. In this paper, we introduce a sniffer based approach to check the conformance of a protocol's implementation to its specification; messages of the actual implementations are captured, processed and checked against the specification's formal model. We also briefly illustrate the application of our framework using a version of the WS-AtomicTransaction protocol","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133839407","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
扫码关注我们
求助内容：
应助结果提醒方式：