When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced...When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. Several problems in the designing of large-scale multimedia servers are addressed, with the following contributions: (1) a striping scheme is proposed that minimizes the number of seeks and hence maximizes the performance; (2) a simple and efficient mechanism is presented to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system; and (3) the characteristics and resource requirements of several scheduling schemes are investigated in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. It is believed that the results are of value in the design of effective large-scale multimedia servers. Keywords realtime multimedia - storage server - scheduling - data placement - buffer management - variable bit rate This work was supported in part by the University IT Research Center Project and Sunmoon University Research Project.Kyung-Oh Lee is an associate professor in the Faculty of Computer and Information Sciences, Sunmoon University, Korea. He received his B.S., M.S. and Ph.D. degrees in computer science from Seoul National University in 1989, 1994 and 1999, respectively. His current research interests include multimedia system, database, mobile communication. He is a member of KIPS (Korea Information Processing Society).Jungho-Ho Park is a professor in the Divisions of Computer and Information Sciences, Sunmoon University, Korea. He received his M.S. and Ph.D. degrees in computer science from Osaka University in 1987 and 1990, respectively. His current research interests include distributed algorithms, e-learning and electronic commerce. He is a director of KIPS (Korea Information Processing Society) and a vice president of KIPS-IT certification.Yoon-Young Park is an associate professor in the Faculty of Computer and Information Sciences, Sunmoon University, Korea. He received his M.S. and Ph.D. degrees in computer science from Seoul National University in 1985 and 1994, respectively. His current research interests include embedded systems and sensor networks. He is a member of KIPS (Korea Information Processing Society).展开更多
文摘When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. Several problems in the designing of large-scale multimedia servers are addressed, with the following contributions: (1) a striping scheme is proposed that minimizes the number of seeks and hence maximizes the performance; (2) a simple and efficient mechanism is presented to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system; and (3) the characteristics and resource requirements of several scheduling schemes are investigated in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. It is believed that the results are of value in the design of effective large-scale multimedia servers. Keywords realtime multimedia - storage server - scheduling - data placement - buffer management - variable bit rate This work was supported in part by the University IT Research Center Project and Sunmoon University Research Project.Kyung-Oh Lee is an associate professor in the Faculty of Computer and Information Sciences, Sunmoon University, Korea. He received his B.S., M.S. and Ph.D. degrees in computer science from Seoul National University in 1989, 1994 and 1999, respectively. His current research interests include multimedia system, database, mobile communication. He is a member of KIPS (Korea Information Processing Society).Jungho-Ho Park is a professor in the Divisions of Computer and Information Sciences, Sunmoon University, Korea. He received his M.S. and Ph.D. degrees in computer science from Osaka University in 1987 and 1990, respectively. His current research interests include distributed algorithms, e-learning and electronic commerce. He is a director of KIPS (Korea Information Processing Society) and a vice president of KIPS-IT certification.Yoon-Young Park is an associate professor in the Faculty of Computer and Information Sciences, Sunmoon University, Korea. He received his M.S. and Ph.D. degrees in computer science from Seoul National University in 1985 and 1994, respectively. His current research interests include embedded systems and sensor networks. He is a member of KIPS (Korea Information Processing Society).
