R. Kawasaki, Luiz A. G. Oliveira, C. Francês, D. Cardoso, Mauro M. Coutinho, Á. Santana
{"title":"Towards the parallel computing based on quality of service","authors":"R. Kawasaki, Luiz A. G. Oliveira, C. Francês, D. Cardoso, Mauro M. Coutinho, Á. Santana","doi":"10.1109/ISPDC.2003.1267654","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267654","url":null,"abstract":"Despite the existence of a series of applications that demand high performance computing, there are two strong restrictions to the effective use of parallel computing applications: (1) the high costs in the environments of parallel computing (typically, clusters and parallel machines) and (2) the dedicated approach of these architectures (fact that generates a great degree of idleness of these platforms). This paper presents an architecture to provide parallel computing in traditional environments (nondedicated networks), called MPI-QoS, which is based on the concepts of quality of service (QoS) to assure low response times necessary to this kind of computation.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114675554","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}
{"title":"Agent based dynamic recovery protocol in distributed databases","authors":"Yang Wang, Xin-song Liu","doi":"10.1109/ISPDC.2003.1267674","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267674","url":null,"abstract":"Recovering from node failures is a critical issue in distributed database systems. In conventional log-based recovery protocols, the nodes providing recovery service may be overburdened, especially when the recovery is resource consuming. In this paper, an agent-based dynamic recovery protocol is presented. It divides the whole recovery process into three major steps: log-recovery, agent-recovery, and synchronization. The key idea of this protocol is to cache new database operations initiated during recovery into agents. All these cached operations are then replayed independently for further recovery. The analysis indicates that the new protocol can minimize internode's dependency and improve recovery speed. As a result, system failure rate is cut down and the overall performance gets improved.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"584 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132508386","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}
{"title":"A parallel implementation of chebyshev preconditioned conjugate gradient method","authors":"Çagatay Akçadogan, H. Dağ","doi":"10.1109/ISPDC.2003.1267636","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267636","url":null,"abstract":"A parallel implementation for linear set of equations of the form Ax = b is presented in this paper. In this implementation, instead of the traditional direct solution of Ax = b, conjugate gradient method is used. The conjugate gradient method is accelerated with an approximate inverse matrix preconditioner obtained from a linear combination of matrix-valued Chebyshev polynomials. This implementation is tested on a Sun SMP machine. Since conjugate gradient method and preconditioner contain only matrix-vector and matrix-matrix multiplications, convincing results are obtained in terms of both speed and scalability.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132966399","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}
{"title":"A negotiation protocol for database resource binding","authors":"Chang Huang, Zhaohui Wu, Guozhou Zheng","doi":"10.1109/ISPDC.2003.1267652","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267652","url":null,"abstract":"The negotiation process is a necessary precondition for many wide-area based applications which involve interactions across multiple autonomous entities. In the case where database resources are explicitly exposed to the distributed computing context like the Grid, it is necessary for unauthorized database users to get authorized so that they can be granted with certain privileges to access the desirable database resources. The facility to establish a legal identity for database user is one of the functionalities that the database resource management framework should provide. In this paper, we give a handshaking protocol which is applied between database clients and database service providers to achieve the database-specific negotiation. It's a six-phased protocol, which is described in terms of service operations in our database resource management middleware, which is an OGSA compliant service-based system.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125139186","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}
{"title":"The information gathering module of the webcom-G operating system","authors":"J. Morrison, B. Clayton, Adarsh Patil, S. John","doi":"10.1109/ISPDC.2003.1267658","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267658","url":null,"abstract":"The WebCom-G operating system will be designed to act as a sophisticated Grid middleware that will hide middleware and architectural detail from the application programmer. A central goal of WebCom-G is to provide seamless interoperability with existing core grid middlewares. This paper sketches the main components of the WebCom-G OS and presents its information gathering module in detail. This module is pivotal for the implementation of Fault Tolerance, Load Balancing, Quality of Service and hence is vital for the development of a realistic economic model.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126849579","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}
{"title":"Architecture and implementation of a distributed reconfigurable metacomputer","authors":"J. Morrison, Philip D. Healy, P. O'Dowd","doi":"10.1109/ISPDC.2003.1267657","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267657","url":null,"abstract":"The use of application-specific co-processors created using reconfigurable hardware (FPGAs) has been shown to realize significant speed increases for many computationally intensive applications. The addition of reconfigurable hardware to clusters composed of commodity machines in order to improve the execution times of parallel applications would, therefore, appear to be a logical step. However, the extra complications introduced by this technique may make the real-world application of such technology appear to be prohibitively difficult. In this paper the design and implementation of a metacomputer designed to simplify the development of applications for clusters containing re-configurable hardware are presented. The operation of the metacomputer is also discussed in some detail, including the process of implementing applications for execution on the metacomputer.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121413143","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}
{"title":"A simple scheduling heuristic for heterogeneous computing environments","authors":"Tarek Hagras, J. Janecek","doi":"10.1109/ISPDC.2003.1267650","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267650","url":null,"abstract":"Efficient task scheduling of computationally intensive applications is one of the most essential and difficult issues when aiming at high performance in heterogeneous computing environments. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous computing systems. In this paper we present a simple list-scheduling heuristic for a bounded number of heterogeneous machines called Heterogenous Critical Parent Trees (HCPT). The analysis and experiments have shown that HCPT provides comparable or even better results together with low complexity.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132145281","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}
{"title":"Hardware-based power management for real-time applications","authors":"S. Uhrig, T. Ungerer","doi":"10.1109/ISPDC.2003.1267672","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267672","url":null,"abstract":"This paper presents a new power management technique integrated into a multithreaded microcontroller with built-in real-time scheduling schemes. Power management is done by hardware based on the Guaranteed Percentage scheduling scheme. The applied power saving mechanisms are frequency reduction, dynamic voltage scaling and pipeline gating. Our evaluation showed that for a given workload with an average processor utilization of 22.6% and a frequent change of utilization in the range of 0% to 58% energy consumption could be reduced to 12.7% of the energy required by a system running at top speed.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131089710","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}
{"title":"A java middleware platform for resource-aware distributed applications","authors":"F. Guidec, Y. Mahéo, L. Courtrai","doi":"10.1109/ISPDC.2003.1267649","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267649","url":null,"abstract":"This paper reports the development of D-Raje (Distributed Resource-Aware Java Environment), a Java-based middleware platform that makes it possible to model and to monitor resources in a distributed environment. With this middleware, any kind of hardware or software resource can be modelled using standard Java objects, and services allow to discover local as well as remote resources, and to observe the state of these resources either locally or remotely. D-Raje is meant to ease the development of adaptive, security-oriented, or QoS-oriented Java applications, as well as the development of platforms capable of supporting such demanding applications.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114564491","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}
{"title":"Parallel performances of a multigrid poisson solver","authors":"M. Sterk, R. Trobec","doi":"10.1109/ISPDC.2003.1267669","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267669","url":null,"abstract":"Practical implementation of the parallel multigrid method (MG) for solving the Poisson equation on arbitrary 3-dimensional domains using finite difference approximations and Neumann boundary conditions is described and compared to the SOR method. Some details on discretization are given and the resulting system of linear equations is analysed. The implemented program is based on the domain decomposition, uses MPI communication library and was tested on a workstation cluster based on 750 MHz Athlon processors and connected in a mesh with 100 Mb/s communication links. Speed-up is analysed for different numbers of processors and domain sizes. The parallel MG method achieves parallel efficiency greater than 0.6 for domains with more than 105 grid points and is faster than parallel SOR for domain sizes greater than 104 points.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113994019","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}