3934 search results - page 10 / 787 » Approximate Schedulability Analysis |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
ICC
2007
IEEE
14 years 8 days ago
2007
IEEE
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
TCS
2008
13 years 8 months ago
2008
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...