2355 search results - page 239 / 471 » Scheduling in the Z-Polyhedral Model |
153
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
147
click to vote
SCHEDULING
2008
15 years 6 months ago
2008
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
130
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...
196
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
We set out to answer a question we were asked by software project management: how much effort remains to be spent on a specific software project and how will that effort be distri...
178
click to vote
SBACPAD
2007
IEEE
16 years 29 days ago
2007
IEEE
One way to exploit Thread Level Parallelism (TLP) is to use architectures that implement novel multithreaded execution models, like Scheduled DataFlow (SDF). This latter model pro...