Sciweavers

3098 search results - page 125 / 620
» On distributed smooth scheduling
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
ICS
1995
Tsinghua U.
15 years 10 months ago
Run-Time Methods for Parallelizing Partially Parallel Loops
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...
Lawrence Rauchwerger, Nancy M. Amato, David A. Pad...
GLOBECOM
2009
IEEE
15 years 9 months ago
BER Performance Analysis of Multiuser Diversity with Antenna Selection in MRC MIMO Systems
— In this paper, we present a performance analysis for the user scheduling for the multiuser MRC MIMO systems exploiting the user and antenna diversities. We consider two schedul...
Mohammad Torabi, David Haccoun, Wessam Ajib
TIT
2008
119views more  TIT 2008»
15 years 6 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
PPAM
2007
Springer
16 years 17 days ago
A Formal Model of Multi-agent Computations
Abstract. The paper contains an extension of a formal model of multiagent computing system developed in previous publications towards considering a more general system state. We pr...
Maciej Smolka