Sciweavers

1673 search results - page 187 / 335
» Generalized Elastic Scheduling
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 12 days ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
15 years 11 months ago
Constant-time admission control for Deadline Monotonic tasks
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...
Alejandro Masrur, Samarjit Chakraborty, Georg F&au...
ASPLOS
1992
ACM
15 years 10 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
FOCS
2008
IEEE
16 years 27 days ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
SIGSOFT
2003
ACM
16 years 7 months ago
Making sense of runtime architecture for mobile phone software
We present a metamodel for runtime architecture and demonstrate with experimental results how this metamodel can be used to recover, analyze and improve runtime architecture of mo...
Alexander Ran, Raimondas Lencevicius