Practical Real-Time Approaches for Scheduling VBR Video in a Client-Server Computing Environment

Scheduling of multiple variable-bit-rate (VBR) video packet streams at the server is one of the most crucial issues in the design of a enterprise video-on-demand (VoD) system. Scheduling is important to guarantee the requested QoS levels while maximizing the utilization of the resources. But the scheduling problem is difficult due to the inherent varying resource requirements of the video streams. Although much work on smoothing and scheduling algorithms has been done, these previous techniques, which usually require the knowledge of future frame sizes and are of a high time complexity, are not suitable because in the video application environment envisioned in our study, real-time response from the server is required. In this paper, we propose and evaluate four real-time approaches using real MPEG data. Our results reveal that the proposed real-time techniques introduce only a slight jitter effect on the video display. Furthermore, time-division-based algorithms are superior to rate-based ones.published_or_final_versio

Hong Kong domestic health spending: Financial years 1989/90 to 2009/10

published_or_final_versio

Hong Kong domestic health spending: Financial years 1989/90 to 2008/09

published_or_final_versio

從324個服務使用者剖析香港寧養社會工作

第一節﹕承載多元寧養旅程postprin

The involvement of tau in nucleolar transcription and the stress response

Tau is known for its pathological role in neurodegenerative diseases, including Alzheimer’s disease (AD) and other tauopathies. Tau is found in many subcellular compartments such as the cytosol and the nucleus. Although its normal role in microtubule binding is well established, its nuclear role is still unclear. Here, we reveal that tau localises to the nucleolus in undifferentiated and differentiated neuroblastoma cells (SHSY5Y), where it associates with TIP5, a key player in heterochromatin stability and ribosomal DNA (rDNA) transcriptional repression. Immunogold labelling on human brain sample confirms the physiological relevance of this finding by showing tau within the nucleolus colocalises with TIP5. Depletion of tau results in an increase in rDNA transcription with an associated decrease in heterochromatin and DNA methylation, suggesting that under normal conditions tau is involved in silencing of the rDNA. Cellular stress induced by glutamate causes nucleolar stress associated with the redistribution of nucleolar non-phosphorylated tau, in a similar manner to fibrillarin, and nuclear upsurge of phosphorylated tau (Thr231) which doesn’t colocalise with fibrillarin or nucleolar tau. This suggests that stress may impact on different nuclear tau species. In addition to involvement in rDNA transcription, nucleolar non-phosphorylated tau also undergoes stress-induced redistribution similar to many nucleolar protein

Practical algorithms for scheduling video data in a local area network environment

Simultaneous transmission of multiple high quality video streams from a server to the clients is becoming an increasingly important class of traffic in a network of workstations or cluster environment. With a powerful symmetric multiprocessor (SMP) as the server and a high-speed network, such transmission is practicable from a hardware point of view. However, the actual construction of such a video data server system entails tackling a number of difficult problems related to the provision of strict quality of service (QoS) guarantees. Among others, the smoothing and scheduling of multiple video packet streams are two crucial issues. Smoothing is concerned with reducing the rate variability of video streams in view of the fact that video data are usually compressed in a variable bit rate fashion. Scheduling is important to guarantee the requested QoS levels while maximizing the utilization of the resources. Although much work on smoothing has been done, it is not clear which scheduling scheme is suitable for multiplexing smoothed video data to the network. In this paper we present an extensive performance study of the EDF and RM scheduling algorithms which are modified to provide QoS guarantees for smoothed video data. With a probabilistic definition of QoS, admission control conditions are incorporated into the two algorithms. Furthermore, a counter-based scheduling module is included as the core scheduling mechanism which adaptively adjusts the actual QoS levels assigned to requests. Our theoretical analysis of the two modified algorithms, called QEDF and QRM, shows that the QRM algorithm is more robust than the QEDF algorithm for different workload and utilization conditions. We also propose to use a new metric called meta-QoS to quantify the overall performance of a packet scheduler given a set of simultaneous requests. In our experiments based on an SMP-based Linux platform, we find that the QRM algorithm can sustain a rather stable level of meta-QoS even when the workload and utilization levels are increased. On the other hand, the QEDF algorithm, due to its conservative admission control policy, is found to be not suitable for a high level of utilization and a large number of requests. In view of the lower complexity of the QRM algorithm, it seems that the QRM approach is a more suitable candidate for packet scheduling in the client-server environment considered in our study. © Springer Science+Business Media, LLC 2007.link_to_subscribed_fulltex