Improving the scalability of parallel N-body applications with an event driven constraint based execution model

The scalability and efficiency of graph applications are significantly constrained by conventional systems and their supporting programming models. Technology trends like multicore, manycore, and heterogeneous system architectures are introducing further challenges and possibilities for emerging application domains such as graph applications. This paper explores the space of effective parallel execution of ephemeral graphs that are dynamically generated using the Barnes-Hut algorithm to exemplify dynamic workloads. The workloads are expressed using the semantics of an Exascale computing execution model called ParalleX. For comparison, results using conventional execution model semantics are also presented. We find improved load balancing during runtime and automatic parallelism discovery improving efficiency using the advanced semantics for Exascale computing.Comment: 11 figure

A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce

Nowadays many companies have available large amounts of raw, unstructured data. Among Big Data enabling technologies, a central place is held by the MapReduce framework and, in particular, by its open source implementation, Apache Hadoop. For cost effectiveness considerations, a common approach entails sharing server clusters among multiple users. The underlying infrastructure should provide every user with a fair share of computational resources, ensuring that Service Level Agreements (SLAs) are met and avoiding wastes. In this paper we consider two mathematical programming problems that model the optimal allocation of computational resources in a Hadoop 2.x cluster with the aim to develop new capacity allocation techniques that guarantee better performance in shared data centers. Our goal is to get a substantial reduction of power consumption while respecting the deadlines stated in the SLAs and avoiding penalties associated with job rejections. The core of this approach is a distributed algorithm for runtime capacity allocation, based on Game Theory models and techniques, that mimics the MapReduce dynamics by means of interacting players, namely the central Resource Manager and Class Managers

Eco-efficient supply chain networks: Development of a design framework and application to a real case study

© 2015 Taylor & Francis. This paper presents a supply chain network design framework that is based on multi-objective mathematical programming and that can identify 'eco-efficient' configuration alternatives that are both efficient and ecologically sound. This work is original in that it encompasses the environmental impact of both transportation and warehousing activities. We apply the proposed framework to a real-life case study (i.e. Lindt & Sprüngli) for the distribution of chocolate products. The results show that cost-driven network optimisation may lead to beneficial effects for the environment and that a minor increase in distribution costs can be offset by a major improvement in environmental performance. This paper contributes to the body of knowledge on eco-efficient supply chain design and closes the missing link between model-based methods and empirical applied research. It also generates insights into the growing debate on the trade-off between the economic and environmental performance of supply chains, supporting organisations in the eco-efficient configuration of their supply chains