Sciweavers

1048 search results - page 71 / 210
» A generalized scheduling approach for dynamic dataflow appli...
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Random-access scheduling with service differentiation in wireless networks
— Recent years have seen tremendous growth in the deployment of Wireless Local Area Networks (WLANs). An important design issue in such networks is that of distributed scheduling...
Piyush Gupta, Yogesh Sankarasubramaniam, Alexander...
EUROSYS
2007
ACM
15 years 1 months ago
Dynamic updates: another middleware service?
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...
Susanne Cech Previtali
IEAAIE
2001
Springer
15 years 2 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
ISLPED
2004
ACM
123views Hardware» more  ISLPED 2004»
15 years 3 months ago
An efficient voltage scaling algorithm for complex SoCs with few number of voltage modes
Increasing demand for larger high-performance applications requires developing more complex systems with hundreds of processing cores on a single chip. To allow dynamic voltage sc...
Bita Gorjiara, Nader Bagherzadeh, Pai H. Chou
PLDI
2009
ACM
15 years 4 months ago
A randomized dynamic program analysis technique for detecting real deadlocks
We present a novel dynamic analysis technique that finds real deadlocks in multi-threaded programs. Our technique runs in two stages. In the first stage, we use an imprecise dyn...
Pallavi Joshi, Chang-Seo Park, Koushik Sen, Mayur ...