Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
Ever more scientists are employing large-scale distributed systems such as grids for their computational work, instead of tightly coupled high-performance computing systems. Howev...
Alexandru Iosup, Omer Ozan Sonmez, Shanny Anoep, D...
This paper presents a hybrid approach to automatic parallelization of computer programs which combines static extraction of threads (tasks) with dynamic scheduling for parallel an...
Ronald Moore, Melanie Klang, Bernd Klauer, Klaus W...
— In this paper, we study how the cooperative relaying can improve both capacity and fairness in cellular network. The capacity and fairness have a trade-off relationship, so inc...
Seungho Song, Kyuho Son, Hyang-Won Lee, Song Chong