Recherche
-
On the Communication Complexity of Distributed Name-Independent Routing Schemes
Communication dans un congrès -
Dynamic Thread Pinning for Phase-Based OpenMP Programs
Communication dans un congrès -
Communication and Topology-aware Load Balancing in Charm++ with TreeMatch
Communication dans un congrès -
Reliable Service Allocation in Clouds with Memory and Capacity Constraints
Communication dans un congrès -
Fast Collaborative Graph Exploration
Communication dans un congrès -
Composing multiple StarPU applications over heterogeneous machines: a supervised approach
Communication dans un congrès -
Partitioning a square into rectangles: NP-completeness and approximation algorithms
(Algorithmica. vol. 34, pp. 217-239, 2002)Article de revue