2355 search results - page 232 / 471 » Scheduling in the Z-Polyhedral Model |
188
click to vote
SIGECOM
2004
ACM
16 years 3 days ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
178
Voted
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
186
click to vote
LCPC
2009
Springer
15 years 11 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
175
click to vote
EMSOFT
2009
Springer
15 years 10 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
181
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...