{"title":"A Dynamic Load Balancing Mechanism for New ParaLEX","authors":"Y. Shinano, Tobias Achterberg, T. Fujie","doi":"10.1109/ICPADS.2008.75","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.75","url":null,"abstract":"ParaLEX, developed recently by the authors, is a parallel extension for the CPLEX mixed integer optimizer which is known as one of the fastest commercial solvers for the mixed integer programming problems. In our previous work, we showed that ParaLEX could efficiently perform 30 solver parallelizations. On the other hand, the simple load balancing mechanism of ParaLEX did not obviously have scalability. In this paper, we propose a load balancing mechanism for a new version of ParaLEX. Preliminary computational results show that the load balancing mechanism is quite efficient in solving a lot of classes of problem instances.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130056557","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}
Crispín Gómez Requena, Francisco Gilabert Villamón, M. E. Gómez, P. López, J. Duato
{"title":"RUFT: Simplifying the Fat-Tree Topology","authors":"Crispín Gómez Requena, Francisco Gilabert Villamón, M. E. Gómez, P. López, J. Duato","doi":"10.1109/ICPADS.2008.44","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.44","url":null,"abstract":"The fat-tree is one of the most widely-used topologies by interconnection network manufacturers. Recently, a deterministic routing algorithm that optimally balances the network traffic in fat--trees was proposed. It can not only achieve almost the same performance than adaptive routing, but also outperforms it for some traffic patterns. Nevertheless, fat-trees require a high number of switches with a non-negligible wiring complexity. In this paper, we propose replacing the fat-tree by an unidirectional multistage interconnection network referred to as reduced unidirectional fat-tree (RUFT) that uses a a simplified version of the aforementioned deterministic routing algorithm. As a consequence, switch hardware is almost reduced to the half, decreasing, in this way, power consumption, arbitration complexity, switch size, and network cost. Evaluation results show that RUFT obtains lower latency than fat-tree for low and medium traffic loads. Furthermore, in large networks, it obtains almost the same throughput than the classical fat-tree.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134420730","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":"Link Availability Prediction in Ad Hoc Networks","authors":"L. Gong, Yuebin Bai, Ming Chen, D. Qian","doi":"10.1109/ICPADS.2008.14","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.14","url":null,"abstract":"Since mobility may cause radio links to break frequently, one pivotal issue for routing in mobile ad hoc networks is how to select a reliable path that can last longer. Several metrics have been proposed in previous literatures, including link persistence, link duration, link availability, link residual time, and their path equivalents. In this paper, we present a novel algorithm for predicting continuous link availability between two mobile ad hoc nodes. By a rough estimation of the distance between two nodes, our approach is able to accurately predict link availability over a short period of time. Simulation results are given to verify our approach. This study could serve as groundwork for further ad hoc network researches including analyzing and optimizing other network protocols.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131537321","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 Broadcasting in Networks with Weighted Nodes","authors":"Hovhannes A. Harutyunyan, Shahin Kamali","doi":"10.1109/ICPADS.2008.27","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.27","url":null,"abstract":"In this paper the problem of broadcasting in networks with weighted nodes is considered. This model is defined on networks in which nodes are assigned some weights representing the internal process or delay that they should perform before sending data to their neighboring nodes. This model has real world applications in parallel computation and satellite terrestrial networks. The problem is shown to be NP-complete. In this paper we present three algorithms to find near optimal broadcast time of an arbitrary network with weighted nodes. We also present our simulation results to compare the performance of these algorithms.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132203000","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":"Energy Efficient Register File with Reduced Window Partition","authors":"Ming Yang, Lixin Yu, Heping Peng","doi":"10.1109/ICPADS.2008.22","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.22","url":null,"abstract":"As power dissipation of the register file in modern processor designs tends to dominate, measures must be taken to keep it under control. This paper introduces an approach for reducing the SPARC windowed register file power based on the operation of the Partitioned Register File Inspector added in the decode stage of the pipeline. The power savings show that, when the size of the Register File Inspector is properly fixed, the average saving on the energy consumption of the windowed register file could be up to 77% compared with the traditional register file control scheme.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132443378","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":"Using Dedicated and Opportunistic Networks in Synergy for a Cost-Effective Distributed Stream Processing Platform","authors":"S. Asaduzzaman, Muthucumaru Maheswaran","doi":"10.1109/ICPADS.2008.116","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.116","url":null,"abstract":"This paper presents a case for exploiting the synergy of dedicated and opportunistic network resources in a distributed hosting platform for data stream processing applications. Our previous studies have demonstrated the benefits of combining dedicated reliable resources with opportunistic resources in case of high-throughput computing applications, where timely allocation of the processing units is the primary concern. Since distributed stream processing applications demand large volume of data transmission between the processing sites at a consistent rate, adequate control over the network resources is important here to assure a steady flow of processing. In this paper, we propose a system model for the hybrid hosting platform where stream processing servers installed at distributed sites are interconnected with a combination of dedicated links and public Internet. Decentralized algorithms have been developed for allocation of the two classes of network resources among the competing tasks with an objective towards higher task throughput and better utilization of expensive dedicated resources. Results from extensive simulation study show that with proper management, systems exploiting the synergy of dedicated and opportunistic resources yield considerably higher task throughput and thus, higher return on investment over the systems solely using expensive dedicated resources.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124206721","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}
Anne-Cécile Orgerie, L. Lefèvre, Jean-Patrick Gelas
{"title":"Save Watts in Your Grid: Green Strategies for Energy-Aware Framework in Large Scale Distributed Systems","authors":"Anne-Cécile Orgerie, L. Lefèvre, Jean-Patrick Gelas","doi":"10.1109/ICPADS.2008.97","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.97","url":null,"abstract":"While an extensive set of research project deals with the saving power problem of electronic devices powered by electric battery, few have interest in large scale distributed systems permanently plugged in the wall socket. However, a rapid study shows that each computer, member of a distributed system platform, consume a substantial quantity of power especially when those resources are idle. Today, given the number of processing resources involved in large scale computing infrastructure, we are convinced that we can save a lot of electric power by applying what we called green policies. Those policies, introduced in this article, propose to alternatively switch On and Off computer nodes in a clever way.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"493 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116190339","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":"Dynamic Resource Allocation in Enterprise Systems","authors":"J. Xue, Adam P. Chester, Ligang He, S. Jarvis","doi":"10.1109/ICPADS.2008.104","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.104","url":null,"abstract":"It is common that Internet service hosting centres use several logical pools to assign server resources to different applications, and that they try to achieve the highest total revenue by making efficient use of these resources. In this paper, multi-tiered enterprise systems are modelled as multi-class closed queueing networks, with each network station corresponding to each application tier. In such queueing networks, bottlenecks can limit overall system performance, and thus should be avoided. We propose a bottleneck-aware server switching policy, which responds to system bottlenecks and switches servers to alleviate these problems as necessary. The switching engine compares the benefits and penalties of a potential switch, and makes a decision as to whether it is likely to be worthwhile switching. We also propose a simple admission control scheme, in addition to the switching policy, to deal with system overloading and optimise the total revenue of multiple applications in the hosting centre. Performance evaluation has been done via simulation and results are compared with those from a proportional switching policy and also a system that implements no switching policy. The experimental results show that the combination of the bottleneck-aware switching policy and the admission control scheme consistently outperforms the other two policies in terms of revenue contribution.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117183221","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}
A. Kovacevic, Kalman Graffi, S. Kaune, Christof Leng, R. Steinmetz
{"title":"Towards Benchmarking of Structured Peer-to-Peer Overlays for Network Virtual Environments","authors":"A. Kovacevic, Kalman Graffi, S. Kaune, Christof Leng, R. Steinmetz","doi":"10.1109/ICPADS.2008.68","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.68","url":null,"abstract":"Network virtual environments (NVE) are an evolving trend combining millions of users in an interactive community. A distributed NVE platform promises to lower the administration costs and to benefit from research done in the peer-to-peer (p2p) domain. In order to reuse existing mature p2p overlays for NVEs, a comparative evaluation has to be done in the same environment (e.g. resources of peers, peer behavior, churn, etc.), using appropriate test cases (scenarios) and observing relevant performance metrics. In this paper we present a benchmarking approach for p2p overlays in the context of NVEs. We define related quality attributes, scenarios, and metrics and use them to evaluate Chord and Kademlia as most popular p2p overlays and assess their suitability to NVE.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393239","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":"Designing and Experimenting with a Distributed Tracking System","authors":"Girish G. Joshi, R. Raje, M. Tuceryan","doi":"10.1109/ICPADS.2008.103","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.103","url":null,"abstract":"Tracking objects is an important activity in many applications such as Augmented Reality, Visual Servoing, and Tangible Interfaces. Most of these applications are inherently dynamic and demand realtime response while tracking. Also, due to the issues of economics, such applications can benefit from tracking systems that do not depend on well-engineered setups and instead use inexpensive sensors for tracking. These requirements make distributed tracking a challenging problem that needs a thorough investigation. In this paper an approach to tracking, which uses the concepts of dynamic discovery, in a distributed environment containing autonomous vision-based trackers that use inexpensive sensors (such as Web cameras) is presented along with its empirical validation. The empirical results obtained from experiments are promising and validate the premise that Distributed Tracking Systems can be built using inexpensive vision-based sensors and concepts of dynamic resource discovery.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129989763","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}