{"title":"A Wireless Network-on-Chip Design for Multicore Platforms","authors":"Chifeng Wang, Wen-Hsiang Hu, N. Bagherzadeh","doi":"10.1109/PDP.2011.37","DOIUrl":"https://doi.org/10.1109/PDP.2011.37","url":null,"abstract":"Aggressive scaling of transistors allows integration of hundreds of processors on a chip. However, on-chip interconnects carrying signals between different blocks will be the bottleneck for system performance and reliability. To tackle this problem, we developed an on-chip communication infrastructure based on a network-on-chip architecture and developed a hybrid mechanism to transfer data among IP cores by taking advantages of both wired and wireless communications. By using on-chip antennas, one can provide on-chip wireless communication to transfer data across long distances and minimize transfer latency and energy dissipation accordingly. A wireless network-on-chip architecture was designed and evaluated, and the experimental results showed significant improvement in transfer latency, network throughput and energy dissipation.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130568798","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 Redundant Communication Approach to Scalable Fault Tolerance in PGAS Programming Models","authors":"N. Ali, S. Krishnamoorthy, N. Govind, B. Palmer","doi":"10.1109/PDP.2011.72","DOIUrl":"https://doi.org/10.1109/PDP.2011.72","url":null,"abstract":"Recent trends in high-performance computing point toward increasingly large machines with millions of processing, storage, and networking elements. Unfortunately, the reliability of these machines is inversely proportional to their size, resulting in a system-wide mean time between failures (MTBF), ranging from a few days to a few hours. As such, for long-running applications, the ability to efficiently recover from frequent failures is essential. Traditional forms of fault tolerance, such as checkpoint/restart, suffer from performance issues related to limited I/O and memory bandwidth. In this paper, we present a fault-tolerance mechanism that reduces the cost of failure recovery by maintaining shadow data structures and performing redundant remote memory accesses. Results from a computational chemistry application running at scale show that our techniques provide applications with a high degree of fault tolerance and low (2%-4%) overhead for 2048 processors.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131966507","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}
Michael Thonhauser, Ulrich Krenn, Christian Kreiner
{"title":"Applying Multi-model Based Components for Virtual Organizations","authors":"Michael Thonhauser, Ulrich Krenn, Christian Kreiner","doi":"10.1109/PDP.2011.89","DOIUrl":"https://doi.org/10.1109/PDP.2011.89","url":null,"abstract":"Raising the level of abstraction is an important research topic in the context of software for mobile and embedded devices. Model Driven Software Development techniques have been recognized for their ability to provide this abstraction by separating domain specific aspects from their technical implementation. Traditionally, such approaches rely on static code generation, which does not fit well in an evolving, collaborating system managed by multiple participating organizations. In order to support such dynamically (re-)configuring Virtual Organizations with high, domain specific abstraction levels, the presented approach is based on loosely coupled, run-time executed Model Based Software Components (MBSC). An MBSC is defined and implemented by potentially multiple distinct models covering all necessary domain-specific aspects (e.g. behavior, data) of the component. MBSCs are deployed to a distributed runtime architecture, where they reside in model-based component containers. System evolution during operation is supported by these plug in-extensible containers, which support additional kinds of MBSC models. A scenario for a building access system that consists of MBSCs owned by independent, yet cooperating organizations (facility management, security, departments), is analyzed in this paper. Finally, several system evolution use cases are discussed.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132064758","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. Gómez-Iglesias, M. A. Vega-Rodríguez, Francisco Castejón-Magaña, M. Cárdenas-Montes
{"title":"Distributed and Asynchronous Bees Algorithm Applied to Nuclear Fusion Research","authors":"A. Gómez-Iglesias, M. A. Vega-Rodríguez, Francisco Castejón-Magaña, M. Cárdenas-Montes","doi":"10.1109/PDP.2011.77","DOIUrl":"https://doi.org/10.1109/PDP.2011.77","url":null,"abstract":"Recently, there have been several developments in the scientific community to model and solve complex optimization problems by employing natural metaphors. In some cases, due to their distributed schema, these algorithms can be adapted to distributed computing environments. A distributed and asynchronous bees (DAB) grid-based approach is here used to optimise the magnetic configuration in order to reduce the neoclassical transport of particles in a nuclear fusion device. Large-scale problems (as several plasma physics can be classified) present open challenges that need a large computing capacity to be solved. Thus, the use of large distributed infrastructures is mandatory in many of these problems. The use of grid computing offers a new paradigm where the distributed nature of foraging can be reproduced and applied to complex optimisation problems.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131492645","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 Chemical Model for Dynamic Workflow Coordination","authors":"M. Caeiro, Z. Németh, T. Priol","doi":"10.1109/PDP.2011.93","DOIUrl":"https://doi.org/10.1109/PDP.2011.93","url":null,"abstract":"This paper investigates a chemical workflow enactment model that is intended to coordinate workflows of large set of activities on a large number of resources in a self-evolving nature, based on a chemical analogy. The concept of chemical workflow engine is introduced for a concurrent, self-coordinating enactment exploiting as much parallelism as inherently present. The concept is aimed at supporting a generalized workflow language without any restrictions, modeling most workflow patterns, separating data and control flow, supporting dynamic changes by multiple versions and instances. The paper presents the notion and model of the chemical based coordination.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133115728","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}
Tom Gross, Christoph Beckmann, Maximilian Schirmer
{"title":"GroupRecoPF: Innovative Group Recommendations in a Distributed Platform","authors":"Tom Gross, Christoph Beckmann, Maximilian Schirmer","doi":"10.1109/PDP.2011.78","DOIUrl":"https://doi.org/10.1109/PDP.2011.78","url":null,"abstract":"Group recommender systems provide groups of users with shared recommendations. They have great potential for easing group decision processes, while at the same time entailing new technological and user-centred challenges. In this paper we present the GroupRecoPF platform providing developers with support for building scalable and user-friendly group recommender systems. It leverages on advanced concepts for group recommendation merging strategy exploration, performance optimisation, session persistence and mobility, as well as open interfaces.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129242681","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":"Multicast-Aware Mapping Algorithm for On-chip Networks","authors":"A. Habibi, M. Arjomand, H. Sarbazi-Azad","doi":"10.1109/PDP.2011.76","DOIUrl":"https://doi.org/10.1109/PDP.2011.76","url":null,"abstract":"Networks-on-Chip (NoCs for short) are known as the most scalable and reliable on-chip communication architectures for multi-core SoCs with tens to hundreds IP cores. Proper mapping the IP cores on NoC tiles (or assigning threads to cores in chip multiprocessors) can reduce end-to-end delay and energy consumption. While almost all previous works on mapping consider higher priority for the application's flows with higher required bandwidth, a mapping strategy, presented in this paper, is introduced that considers multicast communication flows in addition to the normal unicast flows. To this end, multicast and unicast traffic flows are first characterized in terms of some new metrics which are then used for arranging communication flows based on their volume and priority. A heuristic approach is used to assign IP cores to NoC tiles. Simulation results for both synthetic and real applications show up to 49% (28% on average) performance improvement and 44% (22% on average) energy saving when compared to the best known mapping algorithm, nMap.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"25 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132359038","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":"Design and Evaluating Carbon Nanotube Interconnects for a Generic Delta MIN","authors":"F. Safaei, M. H. Moaiyeri, Mohammad A. Tehrani","doi":"10.1109/PDP.2011.28","DOIUrl":"https://doi.org/10.1109/PDP.2011.28","url":null,"abstract":"Multi-stage Interconnection Networks (MINs) are important hardware platforms in various applications due to increasing design complexity and cost. Further, they are generally accepted concepts for solving the problems related to on-chip communications. Carbon nanotube (CNT) is a promising candidate for future on-chip interconnects and electro-thermal applications due to its superior electrical and thermal properties. Although MINs have been around for many years and they can greatly benefit as they reduce costs and complexities in the network, there has been hardly any attempt to exploit the CNT characteristics to design and implementation of MINs. In an attempt to fill this gap, this paper presents a novel method for implementation of MINs using CNT-based interconnects. The performance evaluation of these networks is compared to that of conventional CMOS interconnect in 16nm process technology and reflect a great deal of improvement in network performance.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123917887","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 Fast and Verified Algorithm for Proving Store-and-Forward Networks Deadlock-Free","authors":"Freek Verbeek, J. Schmaltz","doi":"10.1109/PDP.2011.23","DOIUrl":"https://doi.org/10.1109/PDP.2011.23","url":null,"abstract":"Deadlocks are an important issue in the design of interconnection networks. A successful approach is to restrict the routing function such that it satisfies a necessary and sufficient condition for deadlock-free routing. Typically, such a condition states that some (extended) dependency graph must be a cyclic. Defining and proving such a condition is complex. Proving that a routing function satisfies a condition can be complex as well. In this paper we present the first algorithm that automatically proves routing functions deadlock-free for store-and-forward networks. The time complexity of our algorithm is linear in the size of the resource dependency graph. The algorithm checks a variation of Duato's condition for adaptive routing. The condition and the algorithm have been formalized in the logic of the ACL2 interactive theorem prover. The correctness of our algorithm w.r.t. the condition is formally checked using ACL2.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124808139","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}
Christoph Kleineweber, A. Keller, Oliver Niehörster, A. Brinkmann
{"title":"Rule-Based Mapping of Virtual Machines in Clouds","authors":"Christoph Kleineweber, A. Keller, Oliver Niehörster, A. Brinkmann","doi":"10.1109/PDP.2011.69","DOIUrl":"https://doi.org/10.1109/PDP.2011.69","url":null,"abstract":"Infrastructure as a Service providers use virtualization to abstract their hardware and to create a dynamic data center. Virtualization enables the consolidation of virtual machines as well as the migration of them to other hosts during runtime. Each provider has its own strategy to efficiently operate a data center. We present a rule based mapping algorithm for VMs, which is able to automatically adapt the mapping between VMs and physical hosts. It offers an interface where policies can be defined and combined in a generic way. The algorithm performs the initial mapping at request time as well as a remapping during runtime. It deals with policy and infrastructure changes. We extended the open source IaaS solution Eucalyptus and we evaluated it with typical policies: maximizing the compute performance and VM locality to achieve a high performance and minimizing energy consumption. The evaluation was done on state-of-the-art servers in our own data center and by simulations using a workload of the Parallel Workload Archive. The results show that our algorithm performs well in dynamic data centers environments.","PeriodicalId":341803,"journal":{"name":"2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125032637","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}