Abstract
Scheduling for multi-item queries is a problem of practical importance in the field of data broadcast. Most previous works solve the problem under the pattern that at each broadcast moment, the server broadcasts a number of data items which constructs a broadcast cycle with fixed length. Within this pattern, if a query is not scheduled in the current cycle, it usually has to wait for quite a long time which prolongs the average access time. In this paper, we propose a preemptive scheduling method for multi-item queries in on-demand data broadcast. It breaks through the previous pattern. Simulation experiments show comparative improvements of average access time through our approach compared with the existing approaches.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 9th International Conference for Young Computer Scientists (ICYCS 2008) |
| Editors | Guojun Wang, Jianer Chen, Michael R. Fellows, Huadong Ma |
| Publisher | IEEE |
| Pages | 610-615 |
| Number of pages | 6 |
| ISBN (Print) | 9780769533988 |
| DOIs | |
| Publication status | Published - 12 Dec 2008 |
| Externally published | Yes |
| Event | 9th International Conference for Young Computer Scientists - Zhang Jia Jie, Hunan, China Duration: 18 Nov 2008 → 21 Nov 2008 Conference number: 9 http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=2969©ownerid=2 |
Conference
| Conference | 9th International Conference for Young Computer Scientists |
|---|---|
| Abbreviated title | ICYCS 2008 |
| Country/Territory | China |
| City | Hunan |
| Period | 18/11/08 → 21/11/08 |
| Internet address |
Fingerprint
Dive into the research topics of 'Preemptive Scheduling for Multi-item Queries in On-demand Data Broadcast'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver