We consider a scheduling problem for packet based wireless systems with time-varying channel conditions. Designing scheduling mechanisms that take advantage of time-varying channel conditions, which are different for different users, is necessary to improve the wireless system performance. Such scheduling mechanisms are called opportunistic. In this paper we formulate an opportunistic schedulin...

This paper presents several scheduling/coscheduling techniques employed in some recent research projects. Two types of local scheduling, proportional-sharing scheduling and predictive scheduling are introduced here. With proportional-share scheduling, the resource consumption rights of each active process are proportional to the relative shares that it is allocated. While the system implementin...

Parallel applications on multiprocessors achieve better performance when they run on simpler microkernel scheduling mechanisms with appropriated user level scheduling policies. Our purpose is to offer to application programmers a set of new and simple primitives to get more control over the user-level thread scheduling. This paper presents a new library scheduling approach, based in the CThread...

To increase the throughput of parallel video server interconnected by a shared network environment, such as Ethernet, elimination of network collision is highly desired. A special mechanism, serialized con ict-free scheduling, is presented in the paper. Performance study of (1) server-push video severs with con ictfree scheduling algorithm and serialized con ict-free scheduling mechanisms, (2) ...

Wireless Mesh Networking is an emerging technology in order to provide a possibility to build a network that can grow in terms of coverage to offer service access (i.e. internet access) for a large number of people with different needs. Security has become the main concern to provide safe communication between different mesh nodes. The aim of this research is to study various security mechanism...

Grids link together computers, data, sensors, large scale scientific instruments, visualization systems, networks and people. They can provide very large pools of computer resources, enable distributed collaborations and deliver increased efficiency and on-demand computing capabilities. The complexity of Grids on one hand and the requirements towards performance and capability on the other hand...

Mesh-based Peer-to-Peer streaming (MPS) mechanisms incorporate swarming content delivery and thus are able to support scalable streaming of live content. Their key component is a packet scheduling scheme at each peer that determines pulled packet from neighbors while accommodating in-time arrival and diversity of delivered packets. Besides packet scheduling scheme, the overall performance of a ...

We present a scheduling architecture that enables the implementation of deadline-based scheduling policies. The architecture is used to give real-time capabilities to a custom Java virtual machine. This framework retains a clear separation between generic kernel mechanisms and upper level scheduling classes. A pure earliest deadline first algorithm can be implemented, but enhanced policies such...

messiahs is a set of mechanisms supporting task placement in heterogeneous, distributed, autonomous systems. messiahs provides a substrate on which scheduling algorithms can be implemented. The chief design goals for messiahs include support for autonomy, flexibility, scalability and efficiency. These mechanisms were designed to support diverse task placement and load balancing algorithms. This...