Sciweavers

740 search results - page 88 / 148
» Analysis of Scheduling Algorithms with Reservations
Sort
View
COORDINATION
2009
Springer
15 years 10 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
14 years 4 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely
FOCS
1995
IEEE
15 years 1 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
MOBIHOC
2006
ACM
15 years 9 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
INFOCOM
2003
IEEE
15 years 3 months ago
Uplink Scheduling in CDMA Packet-Data Systems
Abstract—Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the curre...
Krishnan Kumaran, Lijun Qian