Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...
Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incentive to parallelize a broad range of applications, inc...
In this paper, we present a dynamic analysis approach to increase the understandability of a large softwareintensive system, more particularly to enable the identification of depe...
Trosky Boris Callo Arias, Paris Avgeriou, Pierre A...
Given a hardware/software partitioned specification and an allocation (number and type) of processors, we present an algorithm to (1) map each of the software behaviors (or tasks...
We describe the architecture and the implementation of the MIKADO software framework, that we call IMC (Implementing Mobile Calculi). The framework aims at providing the programmer...
Lorenzo Bettini, Rocco De Nicola, Daniele Falassi,...