The emergence of mobile computing paradigms has created new dimensions for the problem of performing a collection of tasks in a distributed setting. Indeed, an intrinsic feature of mobile computing is that the communication topology changes over time, and some devices may not be able to communicate with others for prolonged periods of time. Efficient utilization of resources in such a setting requires tools for structuring computation with highly variable, or absent, processor connectivity. This article provides a family of efficient distributed scheduling building blocks for this purpose. Specifically, this paper presents new bounds for a fundamental distributed cooperation problem under the assumption that processors may need to schedule their work in isolation due to a prolonged absence of communication. The problem for n processors is defined in terms of t tasks that must be performed efficiently and that are known to all processors. This study gives tight bounds on the ability of the processors to schedule their work so that when some group of processors establish communication, the wasted (redundant) work these processors have collectively performed prior to that time is controlled.
{"title":"Local scheduling for distributed cooperation","authors":"G. Malewicz, A. Russell, Alexander A. Shvartsman","doi":"10.1109/NCA.2001.962540","DOIUrl":"https://doi.org/10.1109/NCA.2001.962540","url":null,"abstract":"The emergence of mobile computing paradigms has created new dimensions for the problem of performing a collection of tasks in a distributed setting. Indeed, an intrinsic feature of mobile computing is that the communication topology changes over time, and some devices may not be able to communicate with others for prolonged periods of time. Efficient utilization of resources in such a setting requires tools for structuring computation with highly variable, or absent, processor connectivity. This article provides a family of efficient distributed scheduling building blocks for this purpose. Specifically, this paper presents new bounds for a fundamental distributed cooperation problem under the assumption that processors may need to schedule their work in isolation due to a prolonged absence of communication. The problem for n processors is defined in terms of t tasks that must be performed efficiently and that are known to all processors. This study gives tight bounds on the ability of the processors to schedule their work so that when some group of processors establish communication, the wasted (redundant) work these processors have collectively performed prior to that time is controlled.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130196153","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 a Markov model for analyzing the performance of parallel/distributed processors that execute a job consisting of N independent tasks in parallel using P processors. The model is a Markov chain with states representing service and failure rates with k (0
{"title":"An analytic performance model of parallel systems that perform N tasks using P processors that can fail","authors":"G. Weerasinghe, Imad Antonios, L. Lipsky","doi":"10.1109/NCA.2001.962547","DOIUrl":"https://doi.org/10.1109/NCA.2001.962547","url":null,"abstract":"We present a Markov model for analyzing the performance of parallel/distributed processors that execute a job consisting of N independent tasks in parallel using P processors. The model is a Markov chain with states representing service and failure rates with k (0<k/spl les/P) active processors. The task-times and processor failures are both exponentially distributed. We derive a number of expressions to determine the mean execution time, probability of success, work, and other measurable quantities, all conditioned on the job finishing successfully. A prototype, implemented using an extended version of ACMPI, is used for actual experiments that are based on simulated task-times and processor failures. We present our results comparing the analytic model with the prototype for a range of values of processor failure rates. We also discuss extensions of the model and issues related to communication costs, approximations and effect of task-time distributions.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133294868","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 REAP (Remote Evaluation in Application-level Protocols) toolkit, a reusable solution for enabling evaluation in such protocols. By using this toolkit, server developers can reduce the number of bytes sent/received and round-trip times used by their protocols to fulfill a user task, making them more efficient in high-latency, low-bandwidth networks. This is accomplished by allowing the clients to upload simple mobile procedures to the server to be executed locally. This paper provides an overview of the REAP toolkit design and architecture, and gives experimental results showing significant reduction in the latency of two popularly-used application-level protocols.
{"title":"Using simple remote evaluation to enable efficient application protocols in mobile environments","authors":"S. Czerwinski, A. Joseph","doi":"10.1109/NCA.2001.962529","DOIUrl":"https://doi.org/10.1109/NCA.2001.962529","url":null,"abstract":"This paper describes the REAP (Remote Evaluation in Application-level Protocols) toolkit, a reusable solution for enabling evaluation in such protocols. By using this toolkit, server developers can reduce the number of bytes sent/received and round-trip times used by their protocols to fulfill a user task, making them more efficient in high-latency, low-bandwidth networks. This is accomplished by allowing the clients to upload simple mobile procedures to the server to be executed locally. This paper provides an overview of the REAP toolkit design and architecture, and gives experimental results showing significant reduction in the latency of two popularly-used application-level protocols.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134340771","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}
Two new QoS-based unicast routing algorithms for high-speed internetworks are proposed as part of this work. Both algorithms, Limited-Scope Probing (LSP) and Limited-Scope Hop-by-Hop Probing (LSHP) use the route update messages generated by the Open Shortest-Path-First (OSPF) algorithm to create hybrid routing tables. The LSP and LSHP are semi-distributed routing algorithms. They assume that the network "state" information maintained by the OSPF is accurate in "close" vicinity of the maintaining node. Therefore, the LSP and LSHP propose to use source-based routing techniques to route along paths that are "centrally" computed by the node. The extent of the vicinity can be set by an appropriate parameter. Extensive simulations are performed to compare our algorithms with existing QoS-based unicast routing algorithms.
{"title":"Limited scope probing: a distributed approach for QoS-based routing","authors":"K. S. Teng, Muthucumaru Maheswaran","doi":"10.1109/NCA.2001.962553","DOIUrl":"https://doi.org/10.1109/NCA.2001.962553","url":null,"abstract":"Two new QoS-based unicast routing algorithms for high-speed internetworks are proposed as part of this work. Both algorithms, Limited-Scope Probing (LSP) and Limited-Scope Hop-by-Hop Probing (LSHP) use the route update messages generated by the Open Shortest-Path-First (OSPF) algorithm to create hybrid routing tables. The LSP and LSHP are semi-distributed routing algorithms. They assume that the network \"state\" information maintained by the OSPF is accurate in \"close\" vicinity of the maintaining node. Therefore, the LSP and LSHP propose to use source-based routing techniques to route along paths that are \"centrally\" computed by the node. The extent of the vicinity can be set by an appropriate parameter. Extensive simulations are performed to compare our algorithms with existing QoS-based unicast routing algorithms.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"61 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114103867","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}
One of the main advantages of the Java programming language is that the source code can be executed in any type of machine or embedded system that implements a Java Virtual Machine (JVM). The JavaPorts (JP)framework adds another level of portability by extending this capability to multi-threaded distributed applications consisting of many concurrent and interacting components. In this paper we primarily, discuss the aspects of the JavaPorts framework that pertain to the generation and reuse of components. We discuss how a distributed JP application is defined, using a Task Graph abstraction, and then captured and represented internally as an AMTP tree data structure. We present a suite of tools designed to help in simplifying the application development process. We explain how the JP graphical user interface can be used to assemble distributed applications by combining new and existing reusable software components.
{"title":"Component-based peer-to-peer distributed processing in heterogeneous networks using JavaPorts","authors":"E. Manolakos, Demetris G. Galatopoullos, A. Funk","doi":"10.1109/NCA.2001.962538","DOIUrl":"https://doi.org/10.1109/NCA.2001.962538","url":null,"abstract":"One of the main advantages of the Java programming language is that the source code can be executed in any type of machine or embedded system that implements a Java Virtual Machine (JVM). The JavaPorts (JP)framework adds another level of portability by extending this capability to multi-threaded distributed applications consisting of many concurrent and interacting components. In this paper we primarily, discuss the aspects of the JavaPorts framework that pertain to the generation and reuse of components. We discuss how a distributed JP application is defined, using a Task Graph abstraction, and then captured and represented internally as an AMTP tree data structure. We present a suite of tools designed to help in simplifying the application development process. We explain how the JP graphical user interface can be used to assemble distributed applications by combining new and existing reusable software components.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122513108","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}
R. Mello, Maria Stela Veludo de Paiva, L. Trevelin
This paper presents JCM (Java cluster management) project which provides a performance, tool-set and viability analysis of the Java platform to design high-performance applications. This is done through the design of a Java cluster management service based on the evolution of the Java platform, using MAJC (Microprocessor Architecture for Java Computing). The design of the cluster was proposed using queuing theory and UML. The JCM makes a comparison to existent clusters like Beowulf and DSP systems to the cluster management service developed.
{"title":"A Java cluster management service","authors":"R. Mello, Maria Stela Veludo de Paiva, L. Trevelin","doi":"10.1109/NCA.2001.962539","DOIUrl":"https://doi.org/10.1109/NCA.2001.962539","url":null,"abstract":"This paper presents JCM (Java cluster management) project which provides a performance, tool-set and viability analysis of the Java platform to design high-performance applications. This is done through the design of a Java cluster management service based on the evolution of the Java platform, using MAJC (Microprocessor Architecture for Java Computing). The design of the cluster was proposed using queuing theory and UML. The JCM makes a comparison to existent clusters like Beowulf and DSP systems to the cluster management service developed.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124793212","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":"Distributed storage networking architectures: fibre channel, iSCSI, ethernet, infiniband, hyper transport, rapid IO and 3GIO collide in the data center","authors":"D. Follett","doi":"10.1109/NCA.2001.10007","DOIUrl":"https://doi.org/10.1109/NCA.2001.10007","url":null,"abstract":"","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130923295","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}
Two classic problems that are computationally intensive and show good speedup and scalability when solved in a parallel programming environment are used to test the different resource allocation and management algorithms used with the node intrusion and failure experiment. We divide the adaptive resource allocation experiments into two groups: (i) automatic survivability and scalability (ii) assessment of real-time quality of service (QoS). In the former, we use different algorithms to detect failed programs, host and network resources and idle times, computing an allocation, enactment of an allocation, and restart notification. We also use different techniques to detect dynamic paths that are receiving poor QoS possibly due to overload and to "scale up" such paths via reallocation. In the latter case, we use different fitness functions to classify the connections and the resources available on the nodes and study the effects of these on the overall resource allocation and the eventual speedup.
{"title":"Real time resource management and adaptive parallel programming for a cluster of computers: a comparison of different approaches in a computationally intensive environment","authors":"Nilay K. Roy","doi":"10.1109/NCA.2001.962535","DOIUrl":"https://doi.org/10.1109/NCA.2001.962535","url":null,"abstract":"Two classic problems that are computationally intensive and show good speedup and scalability when solved in a parallel programming environment are used to test the different resource allocation and management algorithms used with the node intrusion and failure experiment. We divide the adaptive resource allocation experiments into two groups: (i) automatic survivability and scalability (ii) assessment of real-time quality of service (QoS). In the former, we use different algorithms to detect failed programs, host and network resources and idle times, computing an allocation, enactment of an allocation, and restart notification. We also use different techniques to detect dynamic paths that are receiving poor QoS possibly due to overload and to \"scale up\" such paths via reallocation. In the latter case, we use different fitness functions to classify the connections and the resources available on the nodes and study the effects of these on the overall resource allocation and the eventual speedup.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125600128","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
扫码关注我们
求助内容：
应助结果提醒方式：