{"title":"Scheduling distributable real-time threads in Tempus middleware","authors":"Peng Li, B. Ravindran, Hyeonjoong Cho, E. Jensen","doi":"10.1109/ICPADS.2004.79","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.79","url":null,"abstract":"This paper presents the Tempus real-time middleware, which supports real-time CORBA 2.0's distributable threads (DTs) as an end-to-end programming abstraction for distributed real-time systems. DTs in Tempus can have time constraints, including time/utility functions (TUFs), can have resource constraints, including mutual exclusion, and can be scheduled according to utility accrual (UA) disciplines. Tempus propagates the scheduling parameters of DT's as they transit objects and hence perhaps node boundaries. Node-local instances of a UA scheduling algorithm use the propagated parameters to construct local schedules and resolve resource dependencies for local timeliness optimization, toward approximate, system-wide timeliness optimality. Tempus uses an application-level scheduling framework for node-local TUF/UA scheduling on real-time POSIX-compliant operating systems. Our experimental measurements demonstrate the effectiveness of the middleware in scheduling DTs.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"134 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124258001","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":"Loosely-coupled, mobile replication of objects with transactions","authors":"L. Veiga, Nuno Santos, R. Lebre, P. Ferreira","doi":"10.1109/ICPADS.2004.53","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.53","url":null,"abstract":"Advances in wireless technology and affordable info-appliances are making mobile computing a reality. However, programmers do have a real hard task while developing mobile distributed applications in which sharing is needed. Such difficulty arises, mainly because programmers are forced to deal with system level issues such as consistency, durability, availability, etc. We designed, implemented and evaluated an object-based platform called M-OBIWAN that releases the programmer from the above mentioned system-level issues. It supports mobile transactions and replication in an integrated way. In contrast with other approaches, M-OBIWAN provides an automatic replication mechanism allowing the creation of dynamic clusters of objects which are accessed within transactions. In addition, the transactional model is adapted to mobile environments. A prototype implementation has been developed. Its performance has been measured with PDAs and desktop machines, linked via Bluetooth.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121265987","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":"Transient performance model for parallel and distributed systems","authors":"Ahmed M. Mohamed, L. Lipsky, Reda A. Ammar","doi":"10.1109/ICPADS.2004.1316133","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.1316133","url":null,"abstract":"In studying or designing parallel and distributed systems one should have available a robust analytical model that includes the major parameters that determine the system performance. Jackson networks have been very successful in modeling parallel and distributed systems. However, Jackson networks have their limitations. In particular, the product-form solution of Jackson networks assumes steady state and exponential service centers with certain specialized queueing discipline. In this paper, we present a performance model that can be used to study the transient behavior of parallel and distributed systems with finite workload. When the number of tasks to be executed is large enough, the model approaches the product-form of Jackson networks (steady state solution). We show how to use the model to analyze the performance of parallel and distributed systems. We also use the model to show to what extent the product-form solution of Jackson networks can be used.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124848685","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":"Wavelength assignment on bounded degree trees of rings","authors":"Zhengbing Bian, Q. Gu, Xiaoping Zhou","doi":"10.1109/ICPADS.2004.92","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.92","url":null,"abstract":"A fundamental problem in computer and communication networks is the wavelength assignment (WA) problem: given a set of routing paths on a network, assign wavelengths (channels) to the paths such that the paths with the same wavelength are edge-disjoint. The optimization problem here is to minimize the number of wavelengths. A popular network topology is a tree of rings. It is known NP-hard to find the minimum number of wavelengths for the WA problem on a tree of rings. Let L be the maximum number of paths on any edge in the network. Then L is a lower bound on the number of wavelengths for the WA problem. We give a polynomial time algorithm which uses at most 3L wavelengths for the WA problem on a tree of rings with node degree at most eight. This improves the previous result of 4L. We also show that some instances of the WA problem require at least 3L wavelengths on a tree of rings, implying that the 3L upper bound is optimal for the worst case instances. In addition, we prove that our algorithm has approximation ratios 2 and 2.5 for a tree of rings with node degrees at most four and six, respectively.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122620435","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":"Efficient scheduling heuristics for GridRPC systems","authors":"Y. Caniou, E. Jeannot","doi":"10.1109/ICPADS.2004.36","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.36","url":null,"abstract":"In this paper, we examine several scheduling heuristics for GridRPC middleware relying on the time-shared model (a server can execute more than one task at a time). Our work is based on a forecast module called the 'historical trace manager' (HTM), which is able to predict durations of tasks in the system. We show that the predictions performed by the HTM are very accurate. The five proposed scheduling heuristics use these predictions to map submitted tasks to servers. Experimental simulation results show that they are able to outperform the well-known MCT heuristic for several metrics (makespan but also sumflow, max-stretch, etc.) and therefore provide a better quality of service for the client.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133655748","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 impact of failure management on the stability of communication networks","authors":"Carme Àlvarez, M. Blesa, M. Serna","doi":"10.1109/ICPADS.2004.85","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.85","url":null,"abstract":"In this work we deal with communication networks in which links may fail. We propose an adversarial model for describing the traffic pattern occurring in this type of faulty systems and study properties concerning their stability, especially under (nontrivial) underloaded worse-case scenarios. We show that, depending on how the system is organized and prepared to deal with failures, the dynamics of the system change and thus the conditions for stability. We propose three different ways of failure management and study how they influence on the stability of faulty communication networks under the adversarial model proposed. We show that some failure managements can provoke the instability of even very simple networks.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132579094","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":"Performance of work conserving schedulers and scheduling of some synchronous dataflow graphs","authors":"U. Kanade","doi":"10.1109/ICPADS.2004.66","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.66","url":null,"abstract":"We know a lot about competitive or approximation ratios of scheduling algorithms. This, though, cannot be translated into direct bounds on the schedule produced by a scheduling algorithm, because often the optimal solution is intractable. We derive a methodology to find absolute bounds on the scheduling of jobs with precedence constraints on parallel identical machines. Our bounds hold for a large class of online and offline scheduling algorithms: the \"work conserving\" scheduling algorithms. We apply this methodology to prove that an important class of synchronous dataflow graphs $the parallelized pipelines -has very good performance characteristics when scheduled by a work conserving scheduler. Real time guarantees and granularity design for these dataflow graphs are discussed. We argue that parallelized pipelines should be dynamically scheduled on multiprocessor architectures.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129145819","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":"Challenges: wireless Web services","authors":"Hao-Hua Chu, Chuang-Wen You, Chao-ming Teng","doi":"10.1109/ICPADS.2004.28","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.28","url":null,"abstract":"This paper describes the challenges of adapting existing Web-service architecture to the wireless environment. It presents a new, wireless, Web-service architecture based on the smart client model that can address some of the fundamental differences between the wireless and wireline environments. The fundamental differences between these environments can be called the mobile challenges, including (1) the unpredictable nature of the wireless network, (2) the limited processing capabilities and power on mobile devices, and (3) the need for consumer device to have a fast startup time for mobile applications. The smart client model suggests the following modifications to the existing Web-service stack in order to overcome these mobile challenges: (1) a lightweight Web-service container that runs on a resource-limited mobile device (the client), (2) a quality of user experience (QoUE) model based on application response time, application startup time, and power consumption, and (3) an adaptive application configuration algorithm that can exploit the tradeoff among the QoUE parameters to provide the best user experience given preferences and the device platform.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125391750","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":"Admission control algorithms integrated with pricing for revenue optimization with QoS guarantees in mobile wireless networks","authors":"N. Verma, I. Chen","doi":"10.1109/ICPADS.2004.15","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.15","url":null,"abstract":"We propose and analyze call admission control algorithms integrated with pricing for revenue optimization with QoS guarantee to serve multiple service classes in mobile wireless networks. Traditional admission control algorithms make acceptance decision for new and handoff calls to satisfy certain QoS constraints such as the dropping probability of handoff calls and the blocking probability of new calls being lower than a pre-specified threshold. We analyze a class of partitioning and threshold-based admission control algorithms that make acceptance/rejection decision not only to satisfy QoS requirements but also to optimize the revenue of the system, taking into account prices and arrival/departure information of service calls. We show that for a \"charge-by-time\" pricing scheme, there exist optimal resource allocation settings under which the partitioning and threshold-based admission control algorithm would produce the maximum revenue obtainable by the system without sacrificing QoS requirements. Further, the threshold-based admission control algorithm outperforms the partitioning-based counterpart at optimizing settings over a wide range of input parameters characterizing the operating environment and service workload conditions. Methods for utilizing of the analysis results for real-time admission control for revenue optimization with QoS guarantee are described with numerical data given to demonstrate the applicability.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125470873","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":"Cegor: an adaptive distributed file system for heterogeneous network environments","authors":"Weisong Shi, S. Santhosh, H. Lufei","doi":"10.1109/ICPADS.2004.27","DOIUrl":"https://doi.org/10.1109/ICPADS.2004.27","url":null,"abstract":"Distributed file systems have been extensively studied in the past, but they are still far from wide acceptance over heterogeneous network environments. Most traditional network file systems target the tight-couple highspeed networks only, and do not work well in the wide-area setting. Several communication optimization techniques are proposed in the context of wide-area file systems, but these approaches do not take into consideration the file characteristics and may instead introduce extra computing overhead when the network condition is good. We envision that the capability of providing adaptive, seamless file access to personal documents across diverse network connections plays an important role in the success of future distributed file systems. In this paper, we propose to build an adaptive distributed file system which provides the \"close and go, open and resume\" (Cegor) semantics across heterogeneous network connections, ranging from high-bandwidth local area network to low-bandwidth dial-up connection. Our approach relies on a set of new techniques for managing adaptive access to remote files, including three components: system support for secure, transparent reconnection at different places, semantic-view based caching to reduce communication frequencies in the system, and type-specific communication optimization to minimize the bandwidth requirement of synchronizations between clients and servers.","PeriodicalId":183303,"journal":{"name":"Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123238975","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}