The GridRPC model (Nakada et al., 2003) is an emerging standard promoted by the Global Grid Forum (GGF) that defines how to perform remote client-server computation on a distributed architecture. In this model data are sent back to the client at the end of every computation. This implies unnecessary communications when computed data are needed by another server in further computations. Since, communication time is sometimes the dominant cost of remote computation, this cost has to be lowered. Several tools instantiate the GridRPC model such as NetSolve which is a NES environment developed at the University of Tennessee, Knoxville. In this paper, we present the modifications we made to the NetSolve protocol in order to overcome this drawback. We have developed a set of new functions and data structures that allow clients to order servers to keep data in place and to redistribute them directly to another server when needed.
GridRPC模型(Nakada et al.， 2003)是由全球网格论坛(GGF)推动的一个新兴标准，它定义了如何在分布式架构上执行远程客户机-服务器计算。在这个模型中，数据在每次计算结束时被发送回客户端。这意味着当另一台服务器在进一步计算中需要计算数据时，会产生不必要的通信。由于通信时间有时是远程计算的主要成本，因此必须降低该成本。有几个工具实例化了GridRPC模型，比如NetSolve，它是田纳西州诺克斯维尔大学开发的一个NES环境。在本文中，我们提出了我们对NetSolve协议所做的修改，以克服这一缺点。我们开发了一组新的函数和数据结构，允许客户端命令服务器将数据保存在适当的位置，并在需要时将它们直接重新分发到另一台服务器。
{"title":"Improving the GridRPC model with data persistence and redistribution","authors":"F. Desprez, E. Jeannot","doi":"10.1109/ISPDC.2004.31","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.31","url":null,"abstract":"The GridRPC model (Nakada et al., 2003) is an emerging standard promoted by the Global Grid Forum (GGF) that defines how to perform remote client-server computation on a distributed architecture. In this model data are sent back to the client at the end of every computation. This implies unnecessary communications when computed data are needed by another server in further computations. Since, communication time is sometimes the dominant cost of remote computation, this cost has to be lowered. Several tools instantiate the GridRPC model such as NetSolve which is a NES environment developed at the University of Tennessee, Knoxville. In this paper, we present the modifications we made to the NetSolve protocol in order to overcome this drawback. We have developed a set of new functions and data structures that allow clients to order servers to keep data in place and to redistribute them directly to another server when needed.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"70 1","pages":"193-200"},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78386190","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 ParCop, a decentralized peer-to-peer (P2P) computing system. In ParCop, the data and tasks are mobilized and flow freely between the computational resources (peers). ParCop allows each peer to utilize as well as to offer computing resources. ParCop uses the P2P model to guard against common problems that other systems suffer from, such as server failure and connection bottleneck. ParCop supports the master/worker style of application, which can be broken down into non-communicating and independent tasks.
{"title":"ParCop: a decentralized peer-to-peer computing system","authors":"Nidal A. Al-Dmour, W. Teahan","doi":"10.1109/ISPDC.2004.40","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.40","url":null,"abstract":"We present ParCop, a decentralized peer-to-peer (P2P) computing system. In ParCop, the data and tasks are mobilized and flow freely between the computational resources (peers). ParCop allows each peer to utilize as well as to offer computing resources. ParCop uses the P2P model to guard against common problems that other systems suffer from, such as server failure and connection bottleneck. ParCop supports the master/worker style of application, which can be broken down into non-communicating and independent tasks.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"28 43","pages":"162-168"},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91512100","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 gives an overview of the material to be discussed in the invited keynote presentation by H. J. Siegel. Performing computing and communication tasks on parallel and distributed systems involves the coordinated use of different types of machines, networks, interfaces, and other resources. Decisions about how best to allocate resources are often based on estimated values of task and system parameters, due to uncertainties in the system environment. An important research problem is the development of resource management strategies that can guarantee a particular system performance given such uncertainties. We have designed a methodology for deriving the degree of robustness of a resource allocation - the maximum amount of collective uncertainty in system parameters within which a user-specified level of system performance (QoS) can be guaranteed. Our four-step procedure for deriving a robustness metric for an arbitrary system will be presented. We will illustrate this procedure and its usefulness by deriving robustness metrics for some example distributed systems.
{"title":"The robustness of resource allocation in parallel and distributed computing systems","authors":"Shoukat Ali, H. Siegel, A. A. Maciejewski","doi":"10.1109/ISPDC.2004.51","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.51","url":null,"abstract":"This paper gives an overview of the material to be discussed in the invited keynote presentation by H. J. Siegel. Performing computing and communication tasks on parallel and distributed systems involves the coordinated use of different types of machines, networks, interfaces, and other resources. Decisions about how best to allocate resources are often based on estimated values of task and system parameters, due to uncertainties in the system environment. An important research problem is the development of resource management strategies that can guarantee a particular system performance given such uncertainties. We have designed a methodology for deriving the degree of robustness of a resource allocation - the maximum amount of collective uncertainty in system parameters within which a user-specified level of system performance (QoS) can be guaranteed. Our four-step procedure for deriving a robustness metric for an arbitrary system will be presented. We will illustrate this procedure and its usefulness by deriving robustness metrics for some example distributed systems.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"46 1","pages":"2-10"},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78200642","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}
G. Agosta, S. Crespi-Reghizzi, Gerlando Falauto, M. Sykora
The application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bridge the gap between the two technologies, but special attention must be paid to software instruction scheduling, a must for the VLIW architectures. We have implemented JIST, a Virtual Machine and JIT compiler for Java Bytecode targeted to a VLIW processor. We show the impact of various optimizations on the performance of code compiled with JIST through the experimental study on a set of benchmark programs. We report significant speedups, and increments in the number of instructions issued per cycle up to 50% with respect to the non-scheduling version of the JIT compiler. Further optimizations are discussed.
{"title":"JIST: just-in-time scheduling translation for parallel processors","authors":"G. Agosta, S. Crespi-Reghizzi, Gerlando Falauto, M. Sykora","doi":"10.1109/ISPDC.2004.32","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.32","url":null,"abstract":"The application fields of bytecode virtual machines and VLIW processors overlap in the area of embedded and mobile systems, where the two technologies offer different benefits, namely high code portability, low power consumption and reduced hardware cost. Dynamic compilation makes it possible to bridge the gap between the two technologies, but special attention must be paid to software instruction scheduling, a must for the VLIW architectures. We have implemented JIST, a Virtual Machine and JIT compiler for Java Bytecode targeted to a VLIW processor. We show the impact of various optimizations on the performance of code compiled with JIST through the experimental study on a set of benchmark programs. We report significant speedups, and increments in the number of instructions issued per cycle up to 50% with respect to the non-scheduling version of the JIT compiler. Further optimizations are discussed.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"47 12","pages":"122-132"},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91502448","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}
Mobile devices, such as mobile phones and PDAs, have gained wide-spread popularity. Applications for this kind of mobile devices have to adapt to changes in context, such as variations in network bandwidth, battery power, connectivity, reachability of services and hosts, and so on. In this paper, we define context-aware action systems that provides a systematic method for managing and processing context information. The meaning of context-aware action systems is defined in terms of classical action systems, so that the properties of context-aware action systems can be proved using standard action systems proof techniques. We describe the essential notions of this formalism and illustrate the framework with examples on context-aware services for mobile applications.
{"title":"A formalism for context-aware mobile computing","authors":"Lu Yan, K. Sere","doi":"10.1109/ISPDC.2004.1","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.1","url":null,"abstract":"Mobile devices, such as mobile phones and PDAs, have gained wide-spread popularity. Applications for this kind of mobile devices have to adapt to changes in context, such as variations in network bandwidth, battery power, connectivity, reachability of services and hosts, and so on. In this paper, we define context-aware action systems that provides a systematic method for managing and processing context information. The meaning of context-aware action systems is defined in terms of classical action systems, so that the properties of context-aware action systems can be proved using standard action systems proof techniques. We describe the essential notions of this formalism and illustrate the framework with examples on context-aware services for mobile applications.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"8 1","pages":"14-21"},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89091246","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 the work of an objective framework designed to be used in the parallelization of a set of related algorithms. As a concrete application a parallel ant colony optimization algorithm (ACO) for the travelling salesman problem (TSP) is presented. The idea behind the system we are describing is to have a reusable framework for running several sequential algorithms in a parallel environment. The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several "processing units". The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system. The ACO for TSP implemented by means of the parallel framework proves to have good performances: approximately linear speedup and low communication cost.
{"title":"Parallel framework for ant-like algorithms","authors":"M. Craus, Laurentiu Rudeanu","doi":"10.1109/ISPDC.2004.37","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.37","url":null,"abstract":"This paper describes the work of an objective framework designed to be used in the parallelization of a set of related algorithms. As a concrete application a parallel ant colony optimization algorithm (ACO) for the travelling salesman problem (TSP) is presented. The idea behind the system we are describing is to have a reusable framework for running several sequential algorithms in a parallel environment. The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several \"processing units\". The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system. The ACO for TSP implemented by means of the parallel framework proves to have good performances: approximately linear speedup and low communication cost.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"58 1","pages":"36-41"},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84771830","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}
L. A. Bongo, Otto J. Anshus, J. Bjørndalen, Tore Larsen
We identify two ways of increasing the performance of allreduce-style of collective operations in a multi-cluster with large WAN latencies: (i) hiding latency in system noise, and (ii) conditional-allreduce where knowledge about the application is used to reduce the number of WAN messages. In our multicluster, system noise was not large enough to hide the WAN latency. But, the latency could be hidden using conditional-allreduce, since on many iterations only cluster-local values were needed, and many of the values needed from other clusters were prefetched. A speedup of 2.4 was achieved for a microbenchmark. Prefetching introduced a small overhead in the cluster with the slowest hosts.
{"title":"Extending collective operations with application semantics for improving multi-cluster performance","authors":"L. A. Bongo, Otto J. Anshus, J. Bjørndalen, Tore Larsen","doi":"10.1109/ISPDC.2004.24","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.24","url":null,"abstract":"We identify two ways of increasing the performance of allreduce-style of collective operations in a multi-cluster with large WAN latencies: (i) hiding latency in system noise, and (ii) conditional-allreduce where knowledge about the application is used to reduce the number of WAN messages. In our multicluster, system noise was not large enough to hide the WAN latency. But, the latency could be hidden using conditional-allreduce, since on many iterations only cluster-local values were needed, and many of the values needed from other clusters were prefetched. A speedup of 2.4 was achieved for a microbenchmark. Prefetching introduced a small overhead in the cluster with the slowest hosts.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":"30 1","pages":"320-327"},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90783786","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
扫码关注我们
求助内容：
应助结果提醒方式：