We propose an efficient placement algorithm and per-disk prefetching method to effectively support interactive operations in the media server. Our placement policy is incorporated with an encoder having a special bitc...
详细信息
We propose an efficient placement algorithm and per-disk prefetching method to effectively support interactive operations in the media server. Our placement policy is incorporated with an encoder having a special bitcount control scheme that repeatedly tunes quantization parameters to adjust the bitcounts of video frames. This encoder can generate coded frames whose sizes are synchronized with the RAID stripe size, so that when various fast-forward levels are accessed we can reduce the seek and rotational latency and enhance the disk throughput of each disk in the RAID system. In the experimental results, the proposed placement policy and bitrate control scheme can significantly improve the average service time, which can enlarge the capacity of the interactive media server. Copyright 2005 ACM.
Service providing as an important activity in service-oriented architecture, which is the most popular architecture for applications of distributed environments needs a change to obtain better efficiency, so in this p...
详细信息
ISBN:
(纸本)0780392701
Service providing as an important activity in service-oriented architecture, which is the most popular architecture for applications of distributed environments needs a change to obtain better efficiency, so in this paper we will present neighbor providing and Extended Neighbor Providing (ENP) methods, which are apply the neighborhood computing in traditional methods. As evaluation of these methods we will use the efficiency, scalability, and reliability metrics obtained from the results of omnet++ simulation and we measured the users' satisfactions with their opinions about the quality of implemented ENP system.
A scheme is proposed to provide multiple QoS guarantees for survivable generalised multiprotocol label switching (GMPLS) networks. The shared risk link group (SRLG) information is considered to provide failure-indepen...
详细信息
In this paper, we propose a new technique, called a delayed locking technique, to improve the real-time performance of embedded Linux. The proposed technique employs the rule that entering a critical section is allowe...
详细信息
We propose a new random beamforming technique in forward link multiuser MIMO systems that exploits efficient multiuser diversity and spatial multiplexing gain. The common channels are allocated to more than one user s...
详细信息
Packet scheduling is an essential element of any QoS enabled packet-switched network. (QoS provisioning and packet scheduling play important roles in present and future Internet applications.) In terms of packet fair ...
详细信息
This paper explores the problem of efficiently ordering inter-processor communication operations in both statically and dynamically-scheduled multiprocessors for iterative dataflow graphs with probabilistic execution ...
详细信息
ISBN:
(纸本)1595930914
This paper explores the problem of efficiently ordering inter-processor communication operations in both statically and dynamically-scheduled multiprocessors for iterative dataflow graphs with probabilistic execution times. In most digital signal processing applications, the throughput of the system is significantly affected by communication costs. We explicitly model these costs within an effective graph-theoretic analysis framework. We show that ordered transaction schedules can significantly outperform both self-timed schedules and dynamic schedules for moderate task execution time variability. As the task execution time variability increases, we show that first self-timed and then dynamic scheduling policies are preferred. We perform an extensive experimental comparison on both real and simulated benchmarks to gauge the effect of synchronization and communication over-head costs on these crossover points. Copyright 2005 ACM.
Using a communication network, such as an IP network, in the control loop is increasingly becoming the norm. This process of network-based control (NBC) has a potentially profound impact in areas such as: teleoperatio...
详细信息
Open MPI is a project recently initiated to provide a fault-tolerant, multi-network capable implementation of MPI-2 [16], based on experiences gained from FT-MP1 [7], LA-MPI [10], LAM/MPI [23], and MVAPICH [18] projec...
详细信息
ISBN:
(纸本)0769523129
Open MPI is a project recently initiated to provide a fault-tolerant, multi-network capable implementation of MPI-2 [16], based on experiences gained from FT-MP1 [7], LA-MPI [10], LAM/MPI [23], and MVAPICH [18] projects. Its initial communication architecture is layered on top of TCP/IP. In this paper, we have designed and implemented Open MPI point-to-point layer on top of a high-end interconnect, Quadrics/Elan4 [21]. The restriction of Quadrics static process model has been overcome to accommodate the requirement of MPI-2 dynamic process management. Quadrics Queued-based Direct Memory Access (QDMA) and Remote Direct Memory Access (RDMA) mechanisms have been integrated to form a low-overhead, high-performance transport layer. Light-weight asynchronous progress is made possible with a combination of Quadrics chained event and QDMA mechanisms. Experimental results indicate that the resulting point-to-point transport layer is able to achieve comparable performance to Quadrics native QDMA operations, from which it is derived. Our implementation provides an MPI-2 compliant message passing library over Quadrics/Elan4 with a performance comparable to MPICH-Quadrics.
Home service robots have received much attention from both academia and industry because home service robots have wide range of potential applications such as home security, cleaning, etc. The robots need to add or up...
详细信息
暂无评论