Optimal routing for end-to-end guarantees using network calculus

A Bouillard, B Gaujal, S Lagrange, É Thierry - Performance Evaluation, 2008 - Elsevier
In this paper we show how Network Calculus can be used to compute the optimal route for a
flow (wrt end-to-end guarantees on the delay or the backlog) in a network in the presence of …

Communication-aware load balancing for parallel applications on clusters

X Qin, H Jiang, A Manzanares… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
Cluster computing has emerged as a primary and cost-effective platform for running parallel
applications, including communication-intensive applications that transfer a large amount of …

Optimal routing for end-to-end guarantees: the price of multiplexing

A Bouillard, B Gaujal, S Lagrange, E Thierry - 2007 - ens-lyon.hal.science
In this paper we show how Network Calculus can be used to compute the optimal route for a
flow (wrt end-to-end guarantees on the delay or the backlog) in a network in the presence of …

A two-level scheduling strategy for optimising communications of data parallel programs in clusters

CH Hsu, SC Chen - International Journal of Ad Hoc and …, 2010 - inderscienceonline.com
Irregular data distribution and redistribution have been attracting attention recently since it
can distribute different size of data segments to heterogeneous processors. High …

CAD: An Efficient Data Management and Migration Scheme across Clouds for Data-Intensive Scientific Applications

CH Hsu, A Cuzzocrea, SC Chen - Data Management in Grid and Peer-to …, 2011 - Springer
Data management and migration are important research challenges of novel Cloud
environments. While moving data among different geographical domains, it is important to …

Scheduling in a dynamic heterogeneous distributed system using estimation error

AJ Page, TM Keane, TJ Naughton - Journal of Parallel and Distributed …, 2008 - Elsevier
In real-world dynamic heterogeneous distributed systems, allocating tasks to processors can
be an inefficient process, due to the dynamic nature of the resources, and the tasks to be …

A critical improvement on open shop scheduling algorithm for routing in interconnection networks

S Birmpilis, T Aslanidis - arXiv preprint arXiv:1702.08236, 2017 - arxiv.org
In the past years, Interconnection Networks have been used quite often and especially in
applications where parallelization is critical. Message packets transmitted through such …

[PDF][PDF] A comparison of Efficient Algorithms for Scheduling Parallel Data Redistribution

ME Kogias, T Aslanidis - International Journal of Computer Networks …, 2014 - academia.edu
Data redistribution in parallel is an often-addressed issue in modern computer networks. In
this context, we study the case of data redistribution over a switching network. Data from the …

Algorithms for Packet Routing in Switching Networks with Reconfiguration Overhead

T Aslanidis, ME Kogias - arXiv preprint arXiv:1404.2946, 2014 - arxiv.org
Given a set of messages to be transmitted in packages from a set of sending stations to a set
of receiving stations, we are required to schedule the packages so as to achieve the …

Message Routing In Wireless and Mobile Networks Using TDMA Technology

T Aslanidis, L Tsepenekas - arXiv preprint arXiv:1607.00604, 2016 - arxiv.org
In an era where communication has a most important role in modern societies, designing
efficient algorithms for data transmission is of the outmost importance. TDMA is a technology …