Add to ORKGthat provide data replication. In our previous work, we proposed a centralized algorithm for solving this problem in systems where data transfer information is centrally available. This algorithm finds the optimal scheduling by constructing augmenting paths in the data transfer bipartite graph, requiring O(nm log n+n 2 n) time, with n nodes and m edges in the bipartite graph
Abstract. This paper addresses the problem of scheduling a parallel program represented by a directe...
Scheduling DAGs with communication times is the theoret-ical basis for achieving ecient parallelism ...
In this contribution we present an optimised method for mapping of data-flow graphs onto parallel pr...
ABSTRACT The cost of data transfers, and in particular of I/O operations, is a growing problem in pa...
In distributed systems, the lack of global information about data transfer between clients and serve...
enable a group of collaborating but geographically separated researchers to effectively investigate ...
One typical use case of large-scale distributed computing in data centers is to decompose a computat...
Abstract—We present a data replication framework for dis-tributed graph processing. First we partiti...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and...
Abstract—Scheduling theory is a common tool to ana-lyze the performance of parallel and distributed ...
International audienceWe study the problem of redistributing data between clusters interconnected by...
Abstract—As for the problem of how to carry out task scheduling and data replication effectively in ...
Amount of data stored in enterprises are increasing rapidly. Volume of data stored in database is ap...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we stud...
Multi-tiered persistent storage provides a logical view where all available storage is distributed o...
Abstract. This paper addresses the problem of scheduling a parallel program represented by a directe...
Scheduling DAGs with communication times is the theoret-ical basis for achieving ecient parallelism ...
In this contribution we present an optimised method for mapping of data-flow graphs onto parallel pr...
ABSTRACT The cost of data transfers, and in particular of I/O operations, is a growing problem in pa...
In distributed systems, the lack of global information about data transfer between clients and serve...
enable a group of collaborating but geographically separated researchers to effectively investigate ...
One typical use case of large-scale distributed computing in data centers is to decompose a computat...
Abstract—We present a data replication framework for dis-tributed graph processing. First we partiti...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and...
Abstract—Scheduling theory is a common tool to ana-lyze the performance of parallel and distributed ...
International audienceWe study the problem of redistributing data between clusters interconnected by...
Abstract—As for the problem of how to carry out task scheduling and data replication effectively in ...
Amount of data stored in enterprises are increasing rapidly. Volume of data stored in database is ap...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we stud...
Multi-tiered persistent storage provides a logical view where all available storage is distributed o...
Abstract. This paper addresses the problem of scheduling a parallel program represented by a directe...
Scheduling DAGs with communication times is the theoret-ical basis for achieving ecient parallelism ...
In this contribution we present an optimised method for mapping of data-flow graphs onto parallel pr...