Bluetooth is a low cost, low power consumption, short-range radio technology working on the 2.4 GHz frequency band. Recently, several typical polling schemes have been presented to enhance the performance on asymmetric transmissions between the master and slave. However, such polling algorithms consider only either the uplink queue or the downlink queue state for scheduling. In this paper, we propose an algorithm for Bluetooth Piconets scheduling, called the Uplink and Downlink queue Polling Scheme (UDPS). The goal of this scheduling algorithm is to alleviate the wasted bandwidth by diminishing the visit to inactive slaves. Distinguishing from previous polling schemes that have been proposed, this algorithm considers on both uplink and downlink queue states for increasing the throughput and reducing the delay time of the piconets communication. This study proposes UDPS, a new Polling Scheme for Bluetooth piconets addresses both Uplink and Downlink queues, considering to remain fair and efficient in asymmetric flow rates. Simulations confirm that the performance of the UDPS compares favorably with that of traditional polling approaches.

In wireless communication networks, power consumption is an important issue due to the limited battery power available at the mobile stations. Power management is addressed efficiently by the IEEE 802.11 standard. In this paper, we change the polling order in the polling list of AP (Access Point) to further save the power of CF-Pollable (Contention Free) stations in power saving mode. The proposed schemes can reduce the power consumption of stations in power saving mode or have balanced opportunity of polling.

Time-sensitive applications that are also CPU intensive like video games, video playback, eye-candy desktops etc. are increasingly common. These applications run on commodity operating systems that are targeted at diverse hardware, and hence they cannot assume that sufficient CPU is always available. Increasingly, these applications are designed to be adaptive. When executing multiple such applications, the operating system must not only provide good timeliness but also (optionally) allow co-ordinating their adaptations so that applications can deliver uniform fidelity. In this work, we present a starvation-free, fair, process scheduling algorithm that provides predictable and low latency execution without the use of reservations and assists adaptive time sensitive tasks with achieving consistent quality through cooperation. We combine an event-driven application model called cooperative polling with a fair-share scheduler. Cooperative polling allows sharing of timing or priority information across applications via the kernel thus providing good timeliness, and the fair-share scheduler provides fairness and full utilization. Our experiments show that cooperative polling leverages the inherent efficiency advantages of voluntary context switching versus involuntary pre-emption. In CPU saturated conditions, we show that the scheduling responsiveness of cooperative polling is five times better than a well-tuned fair-share scheduler, and orders of magnitude better than the best-effort scheduler used in the mainstream Linux kernel.

Den ökade användningen av nätuppkopplade mobilapplikationer har resulterat i en överbelastning i 3G-nätet. Förslag för att avlasta nätet har bland annat varit genom alternativa uppkopplingar, vilket innebär en uppoffring av 3G-nätets tillgänglighet. Detta leder till frågor om andra avlastningsmetoder. Arbetets målsättning var att se hur en applikations datatrafik påverkas av att klassiska intervallanrop ersätts av avvaktande AJAX-anrop. Detta görs genom att implementera respektive anropsmetod i två identiska alfapetapplikationer. Mätdata erhölls genom att låta användare spela längre omgångar av respektive applikation, vilket även genererar realistiska uppdateringar. Resultaten visar att den klientgenererade bandbreddskonsumtionen minskas vid användning av avvaktande AJAX-anrop. Detta gör den, i kontrast med klassiska intervallanrop, till en möjlig avlastningsmetod.

Thesis (M.P.A.)--Ball State University, 2009. / Title from PDF t.p. (viewed on Feb. 08, 2010). Includes bibliographical references (p. 71-75).

Time-sensitive applications that are also CPU intensive like video games, video playback, eye-candy desktops etc. are increasingly common. These applications run on commodity operating systems that are targeted at diverse hardware, and hence they cannot assume that sufficient CPU is always available. Increasingly, these applications are designed to be adaptive. When executing multiple such applications, the operating system must not only provide good timeliness but also (optionally) allow co-ordinating their adaptations so that applications can deliver uniform fidelity. In this work, we present a starvation-free, fair, process scheduling algorithm that provides predictable and low latency execution without the use of reservations and assists adaptive time sensitive tasks with achieving consistent quality through cooperation. We combine an event-driven application model called cooperative polling with a fair-share scheduler. Cooperative polling allows sharing of timing or priority information across applications via the kernel thus providing good timeliness, and the fair-share scheduler provides fairness and full utilization. Our experiments show that cooperative polling leverages the inherent efficiency advantages of voluntary context switching versus involuntary pre-emption. In CPU saturated conditions, we show that the scheduling responsiveness of cooperative polling is five times better than a well-tuned fair-share scheduler, and orders of magnitude better than the best-effort scheduler used in the mainstream Linux kernel.

Time-sensitive applications that are also CPU intensive like video games, video playback, eye-candy desktops etc. are increasingly common. These applications run on commodity operating systems that are targeted at diverse hardware, and hence they cannot assume that sufficient CPU is always available. Increasingly, these applications are designed to be adaptive. When executing multiple such applications, the operating system must not only provide good timeliness but also (optionally) allow co-ordinating their adaptations so that applications can deliver uniform fidelity. In this work, we present a starvation-free, fair, process scheduling algorithm that provides predictable and low latency execution without the use of reservations and assists adaptive time sensitive tasks with achieving consistent quality through cooperation. We combine an event-driven application model called cooperative polling with a fair-share scheduler. Cooperative polling allows sharing of timing or priority information across applications via the kernel thus providing good timeliness, and the fair-share scheduler provides fairness and full utilization. Our experiments show that cooperative polling leverages the inherent efficiency advantages of voluntary context switching versus involuntary pre-emption. In CPU saturated conditions, we show that the scheduling responsiveness of cooperative polling is five times better than a well-tuned fair-share scheduler, and orders of magnitude better than the best-effort scheduler used in the mainstream Linux kernel. / Science, Faculty of / Computer Science, Department of / Graduate

Bluetooth is an emerging technology to build a solution for providing short range, low power, low cost, and ubiquitous wireless environments. In this paper we propose a algorithm for asynchronous data traffic at the Medium Access Control (MAC) layer to meet Bluetooth characteristic and compare with other scheduling algorithms. The algorithm, named Efficient Utilization Polling (EUP), uses a single bit of the payload packet header as supplied knowledge of queues of slaves to the master to dynamically adapt the polling intervals. We also propose a differentiation mechanism, named Shifting Polling Window (SPW), which is based on EUP and differentiates throughput between different classes and still keeps the link utilization almost the same.

Diss.--Philosophische Fakultät--München--Ludwig-Maximilians-Universität, 1983. Titre de soutenance : Der Traditionsrotulus des Augustinerchorherrenstiftes Polling. / Bibliogr. p. 172-196. Index.

Project (M.P.P.) - Simon Fraser University, 2006. / Theses (Master of Public Policy Program) / Simon Fraser University. Also issued in digital format and available on the World Wide Web.