Advances in signal processing allow us to model the audio signal in terms of mathematical representation. Compressed audio signal are also important for low-bit-rate media in order to minimize transmission cost. Appli...
详细信息
Advances in signal processing allow us to model the audio signal in terms of mathematical representation. Compressed audio signal are also important for low-bit-rate media in order to minimize transmission cost. Applications such as movies on compact disc, audio conferencing, and digital television also require a good model for the audio compression. We present a model for compressed audio signal. By varying different modelling parameters, we obtain the simulation result of the proposed model of the audio coder. Simulation results found that it has a good compression Ssignal-to-noise ratio compared with NICAM, CD, and OCF coders.
Scientific applications often require some strategy for temporary data storage to do the largest possible simulations. The use of virtual memory for temporary data storage has received criticism because of performance...
详细信息
Scientific applications often require some strategy for temporary data storage to do the largest possible simulations. The use of virtual memory for temporary data storage has received criticism because of performance problems. However, modern virtual memory found in recent operating systems such as Cenju-3/DE give application writers control over virtual memory policies. We demonstrate that custom virtual memory policies can dramatically reduce virtual memory overhead and allow applications to run out-of-core efficiently. We also demonstrate that the main advantage of virtual memory, namely programming simplicity, is not lost.
The reliability of a real-time digital control computer depends not only on the reliability of the hardware and software used, but also on the time delay in computing the control output, because of the negative effect...
详细信息
The reliability of a real-time digital control computer depends not only on the reliability of the hardware and software used, but also on the time delay in computing the control output, because of the negative effects of computingtime delay on control system performance. For a given fixed sampling interval, the effects of computingtime delay are classified into the delay and loss problems, The delay problem, occurs when the computingtime delay is nonzero but smaller than the sampling interval, while the loss problem occurs when the computingtime delay is greater than, or equal to, the sampling interval, i,e., loss of the control output, These two problems are analyzed as a means of evaluating real-time control systems, First, a generic analysis of the effects of computingtime delay is presented along with necessary conditions for system stability, Then, we present both qualitative and quantitative analyses of the computingtime delay effects on a robot control system, deriving upper bounds of the computingtime delay with respect to system stability and system performance.
Ensuring that a distributed system with strict dependability constraints meets its prescribed specification is a growing challenge that confronts software developers and system engineers. This paper presents a techniq...
Ensuring that a distributed system with strict dependability constraints meets its prescribed specification is a growing challenge that confronts software developers and system engineers. This paper presents a technique for probing and fault injection of fault-tolerant distributed protocols. The proposed technique, called script-driven probing and fault injection, can be used for studying the behaviour of distributed systems and for detecting design and implementation errors of fault-tolerant protocols. The focus of this work is on fault injection techniques that can be used to demonstrate three aspects of a target protocol: detection of design or implementation errors;identification of violations of protocol specifications;and insight into design decisions made by the implementers. The emphasis of our approach is on experimental techniques intended to identify specific ''problems'' in a protocol or its implementation rather than the evaluation of system dependability through statistical metrics such as fault coverage. To demonstrate the capabilities of this technique, the paper describes a probing and fault injection toot, called the PFI tool (probe/fault injection tool), and a summary of several extensive experiments that studied the behaviour of two protocols: the Transmission Control Protocol (TCP) and a group membership protocol (GMP).
Ensuring that a system meets its prescribed specification is a growing challenge that confronts software developers and system engineers. Meeting this challenge is particularly important for distributed systems with s...
详细信息
ISBN:
(纸本)3540600426
Ensuring that a system meets its prescribed specification is a growing challenge that confronts software developers and system engineers. Meeting this challenge is particularly important for distributed systems with strict dependability and timeliness constraints. This paper presents a technique, called script-driven probing and fault injection, for the evaluation and validation of dependable protocols. The proposed approach can be used to demonstrate three aspects of a target protocol: i) detection of design or implementation errors, ii) identification of violations of protocol specifications, and iii) insight into design decisions made by the implementers. To demonstrate the capabilities of this technique, the paper briefly describes a probing and fault injection tool called the PFI tool, and several experiments on two protocols: the Transmission Control Protocol (TCP) [4, 24] and the Group Membership Protocol (GMP) [19]. The tool can be used to delay, drop, reorder, duplicate, and modify messages. It can also introduce new messages into the system to probe participants. In the case of TCP, we used the PFI tool to duplicate the experiments reported in [7] on several TCP implementations without access to the vendors' TCP source code in a very short time. We also ran several new experiments that are difficult to perform using past approaches based on packet monitoring and filtering. In the case of GMP, we used the tool to test the fault-tolerance capabilities of an implementation under various failure models including daemon/link crash, send/receive omissions, and timing failures. Furthermore, by selective reordering of messages and spontaneous transmission of new messages, we were able to guide a distributed computation into hard to reach global states without instrumenting the protocol implementation.
This paper presents pp-mess-sim, an object-oriented discrete-event simulation environment for evaluating multicomputer networks. The simulator provides a toolboz of various network topologies, communication workloads,...
详细信息
Scheduling messages on the controller area network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. If fixed priority scheduling such as deadline monotonic (DM) is used to ca...
详细信息
Opens in BICMOS structures are analyzed here. It is shown that some opens cannot be detected by stuck-fault or other functional tests, since some transistors in BiCMOS gates do not affect the logical function of the g...
详细信息
Opens in BICMOS structures are analyzed here. It is shown that some opens cannot be detected by stuck-fault or other functional tests, since some transistors in BiCMOS gates do not affect the logical function of the gate. A switch-level model for CMOS circuits is extended to include bipolar devices. With this switch-level model, opens that cannot be detected by stuck-faults or other functional tests are easily identified. It is also shown that, in BICMOS circuits, an open defect in one transistor can accelerate the wearout of another nondefective transistor.
To guarantee the delivery of real-time messages before their deadline, a real-time connection or channel must be established before the transmission of any real-time messages. During this channel-establishment phase, ...
详细信息
To guarantee the delivery of real-time messages before their deadline, a real-time connection or channel must be established before the transmission of any real-time messages. During this channel-establishment phase, one must first select a route between the source and destination of this channel and then reserve sufficient resources along this route so that the worst-case end-to-end delay over the selected route may not exceed the user-specified delay bound. We propose a table-driven distributed route-selection scheme that is guaranteed to find a "qualified" route, if any, that meets the performance requirement of the requested channel without compromising any of the existing guarantees. The proposed scheme uses the Bellman-Ford shortest path algorithm to build real-time delay tables, and hence, can solve the route-selection problem by a simple table look-up. Several examples are presented to demonstrate the effectiveness of the proposed distributed route-selection scheme.
暂无评论