Data Set Used
Mapping applications onto parallel platforms is a challenging problem, that becomes even more difficult when platforms are heterogeneous –nowadays a standard assumption. A high-level approach to parallel programming not only eases the application developer's task, but it also provides additional information which can help realize an efficient mapping of the… (More)
—We investigate the routing of communications in chip multiprocessors (CMPs). The goal is to find a valid routing in the sense that the amount of data routed between two neighboring cores does not exceed the maximum link bandwidth while the power dissipated by communications is minimized. Our position is at the system level: we assume that several… (More)
We present an overview of eSkel, a library for skeletal parallel programming. eSkel aims to maximise the conceptual flexibility afforded by its component skeletons and to facilitate dynamic selection of skeleton compositions. We present simple examples which illustrate these properties , and discuss the implementation challenges which the model poses.
Sustained-release fampridine (fampridine-SR) improves gait velocity and self-perceived capacities in people with multiple sclerosis (MS). However, little is known about the treatment's effect on temporospatial gait parameters, walking endurance, general fatigue, hand function and quality of life (QoL). We therefore sought to evaluate these parameters in a… (More)
We present techniques for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as Stochastic Automata Networks (SAN). Many large systems include a number of replications of identical components. This paper exploits replication by aggregating similar components. This leads… (More)
—Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper, we deal with the problem of scheduling multiple applications, made of collections of independent and identical tasks, on a heterogeneous master-worker platform. The applications are submitted online,… (More)
— In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be… (More)