Dynamic scheduling techniques for interactive hypermedia servers

被引:2
|
作者
Hamidzadeh, B [1 ]
Tsun-Ping, J
机构
[1] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada
[2] Hong Kong Polytech Univ, Dept Elect Engn, Kowloon, Peoples R China
关键词
dynamic resource management and scheduling; interactive hypermedia;
D O I
10.1109/30.754416
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Future multimedia-on-demand systems will bring interactive applications in education, entertainment, advertisement, and visualisation to a large number of users at homes, offices, classrooms and laboratories. A class of multimedia data, called hypermedia, is represented by graph structures whose branches represent different video and audio segments and whose nodes represent user interactions. To provide satisfactory service in an interactive hypermedia system, disruptions and delays in the concurrent delivery of continuous media data streams from storage devices cannot be tolerated. Slow response to new requests generated by on-line users is also highly undesirable. The frequent arrivals and completions of user requests can seriously degrade the throughput of typical servers that are designed to maintain performance at the steady state. To address these issues, we propose a dynamic approach to the retrieval of continuous media and sporadic data in an interactive hypermedia server. The throughput and efficiency of our server are improved by observing runtime information to skip or reorder service sequences, as well as maximising disk reads. Through pipelining the admission of new streams with the departure of ongoing streams, the performance is also immune to the presence of transients. User response times under identical loads are reduced significantly with respect to other existing approaches. Furthermore, our scheduler can efficiently redirect disk bandwidth to service sporadic requests when the demand on real-time services decreases. We evaluate our technique by comparing its performance with static techniques via thorough experiments under different buffer capacities, stream lengths and request arrival rates. Results of experiments show that our approach can significantly improve continuous media data throughput, user response time, as well as sporadic data throughput, and is thus a plausible approach for more interactive multimedia applications such as hypermedia.
引用
收藏
页码:46 / 56
页数:11
相关论文
共 50 条
  • [31] An interactive hypermedia learning system: LMM
    Yoo, YD
    PROCEEDINGS OF ICCE'98, VOL 1 - GLOBAL EDUCATION ON THE NET, 1998, : 504 - 510
  • [32] INVESTIGATING THE USE OF INTERACTIVE HYPERMEDIA SYSTEMS
    EVANS, P
    INTERACTIVE MULTIMEDIA IN UNIVERSITY EDUCATION: DESIGNING FOR CHANGE IN TEACHING AND LEARNING, 1994, 59 : 259 - 271
  • [33] HYPERMEDIA - INTERACTIVE EXPLORATION OF A MEDIEVAL TOWN
    CALVANI, A
    EDUCATIONAL & TRAINING TECHNOLOGY INTERNATIONAL, 1990, 27 (01): : 51 - 57
  • [34] On designing comprehensible interactive hypermedia manuals
    Narayanan, NH
    Hegarty, M
    INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES, 1998, 48 (02) : 267 - 301
  • [35] h-DDSS: Heterogeneous Dynamic Dedicated Servers Scheduling in Cloud Computing
    Narman, Husnu S.
    Hossain, Md. Shohrab
    Atiquzzaman, Mohammed
    2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 3475 - 3480
  • [36] Optimal dynamic scheduling in a multiclass fluid model of Internet servers with transient overload
    Chang, JX
    Ayhan, H
    Dai, J
    Liu, Z
    Squillante, MS
    Xia, CH
    42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, 2003, : 721 - 727
  • [37] Hypermedia in dynamic environments
    Zhang, L
    Bieber, M
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL VI, PROCEEDINGS: INFORMATION SYSTEMS, TECHNOLOGIES AND APPLICATIONS: I, 2003, : 271 - 275
  • [38] Connection scheduling in Web servers
    Crovella, ME
    Frangioso, R
    Harchol-Balter, M
    USENIX ASSOCIATION PROCEEDINGS OF THE 2ND USENIX SYMPOSIUM ON INTERNET TECHNOLOGIES AND SYSTEMS (USITS'99), 1999, : 243 - 254
  • [39] Appointment Scheduling for Multiple Servers
    Kuiper, Alex
    Lee, Robert H.
    MANAGEMENT SCIENCE, 2022, 68 (10) : 7422 - 7440
  • [40] A new scheduling algorithm for servers
    Yao, Nianmin
    Yao, Wenbin
    Cai, Shaobin
    Ni, Jun
    FIRST INTERNATIONAL MULTI-SYMPOSIUMS ON COMPUTER AND COMPUTATIONAL SCIENCES (IMSCCS 2006), PROCEEDINGS, VOL 1, 2006, : 639 - +