We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
Instant messaging (IM) has become increasingly popular due to its quick response time, its ease of use, and possibility of multitasking. It is estimated that there are several mil...
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
Andrea C. Arpaci-Dusseau, David E. Culler, Alan M....