One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this work, the problem of scheduling using wavefront predictio...
详细信息
ISBN:
(纸本)0769511538
One of the primary tasks in the area of uniform dependence loops, is predicting the execution propagation, as well as finding an optimal time schedule. In this work, the problem of scheduling using wavefront prediction is presented. The geometric concepts of time instance subspaces and execution pattern are introduced. A quite simple and low complexity scheduling algorithm is presented. The index space is split into geometric subspaces and any point can be located in them. Each point is then scheduled according to the subspace where it belongs.
Feedback signaling plays a crucial role in flow control because the traffic source relies on the signaling information to make correct and timely flow-control decisions. Multicast flow-control signaling imposes two ad...
详细信息
ISBN:
(纸本)0780370163
Feedback signaling plays a crucial role in flow control because the traffic source relies on the signaling information to make correct and timely flow-control decisions. Multicast flow-control signaling imposes two additional challenges: scalability and feedback synchronization. We developed a binary-tree deterministic model (Zhang and Shin 1999) and an independent-marking statistical model (Zhang and Shin 2000) to study the delay performance of various multicast feedback-synchronization signaling algorithms. In this paper, we consider the general case in which the congestion markings at different links are dependent. We develop a Markov chain model defined by the link-marking state on each path in a multicast tree. The Markov chain can not only characterize link-marking dependencies, but also yield a tractable analytical model. We also develop a Markov-chain dependency-degree model which can he used to quantify/evaluate all possible Markov-chain dependency degrees without knowing a priori the dependency degree information. Using the Markov-chain and dependency-degree models, we derive the general expressions for the probability distribution of each path bring the multicast-tree bottleneck. Also derived are the closed-form expressions for the first and second moments of multicast signaling delays. The proposed Markov chain is also shown to asymptotically reach an equilibrium, and its limiting state distributions converge to the link-marking marginal probabilities when the Markov chain is irreducible. By applying these two models, we analyze and contrast the feedback-delay scalability of two representative multicast signaling protocols: soft-synchronization protocol and hop-by-hop (HBH) signaling algorithms.
We propose an efficient flow and error control scheme for high-throughput transport protocols by using a second-order rate control, called the /spl alpha/-control, and a new sliding-window scheme for error control. Th...
详细信息
ISBN:
(纸本)0769514294
We propose an efficient flow and error control scheme for high-throughput transport protocols by using a second-order rate control, called the /spl alpha/-control, and a new sliding-window scheme for error control. The /spl alpha/-control minimizes the packet retransmissions by adjusting the rate-gain parameter to the variations in the number and round-trip times (RTTs) of cross-traffic flows that share the bottleneck. Using selective retransmission, the sliding-window scheme guarantees lossless transmission. By applying the /spl alpha/-control, the proposed scheme can drive the flow-controlled system to a retransmission-less equilibrium state. Using the fluid analysis, we establish the flow-control system model, obtain the greatest lower bound for the target buffer occupancy, and derive closed-form expressions for packet losses, loss rate, and link-transmission efficiency. We prove that the /spl alpha/-control is feasible and optimal linear control in terms of efficiency and fairness. Also presented are the extensive simulation results that confirm the analytical results, and demonstrate the superiority of the proposed scheme to others in dealing with the variations of cross-traffic flows sharing the same bottleneck and their RTTs, controlling packet losses/retransmissions, and achieving buffer-usage fairness as well as high throughput.
Dependability of service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings and command-and-control applications. The Dependable R...
详细信息
Dependability of service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings and command-and-control applications. The Dependable Real-Time Protocol (DRTP), in which each dependable real-time connection is realized with one primary and one or more backup channels, has been shown to be an effective way of providing DoS. How to route both primary and backup channels for each dependable real-time connection is of vital importance to the success of failure recovery and to overhead reduction in providing DoS. In this paper, we propose and evaluate three different schemes for routing the primary and backup channels of each dependable real-time connection. Specifically, we present methods based on link-state information and bounded flooding to discover routes for the primary and backup channels while satisfying the required quality of service (QoS). The costs of the link-state and flooding algorithms are reduced significantly by using the fact that the probability of success in failure recovery can be estimated with simple link-state information, and by bounding the flooded region within an ellipse with the two communication end-points as loci. Our in-depth simulations have shown that the proposed routing schemes are highly effective, providing a fault tolerance of 87% or higher with a network capacity overhead of less than 85%.
We present an architecture that supports reconfigurable software construction. In this architecture, the controller software consists of a set of well-defined components and a set of behavior specifications. Each comp...
详细信息
ISBN:
(纸本)0780365763
We present an architecture that supports reconfigurable software construction. In this architecture, the controller software consists of a set of well-defined components and a set of behavior specifications. Each component is modeled with event-based external interfaces, a control logic driver and service protocols. Behaviors of components and their integration are modeled as finite state machines and nested finite state machines. The behaviors of software can be specified in Control Plan programs and executed by control logic drivers at run-time. Such software supports executable code-level reconfiguration as well as remote behavioral reconfiguration. Reconfiguration with heterogeneous implementations and vendor-neutral products is also supported. Our evaluation of the motion control software for a milling machine controller demonstrated that the software constructed with this architecture has high reconfigurability and low development and maintenance costs.
We present the design, implementation, and evaluation of single assignment data structures and of a software controlled cache in an existing multi-threaded architecture platform – the Efficient Architecture for Runni...
We present the design, implementation, and evaluation of single assignment data structures and of a software controlled cache in an existing multi-threaded architecture platform – the Efficient Architecture for Running Threads (EARTH). The I-Structure Software-Controlled Cache (ISSC) exploits temporal and spatial locality of EARTH split-phased memory transactions for single-assignment memory references. Our experimental evaluation indicates that the caching mechanism for single-assignment storage makes the EARTH memory system more robust to variations in the latency of memory operations. As a consequence the system can be ported to a wider range of machine platforms and deliver speedup for both regular and irregular application.
In this paper we report new results concerning developing parallel multiprocessor scheduling algorithms working in cellular automata (CAs) - based scheduler. We consider the simplest case when a multiprocessor system ...
详细信息
The presence of precise exceptions in a processor leads to complications in its design. Some recent processor architectures have sacrificed this requirement for performance reasons at the cost of software complexity. ...
详细信息
ISBN:
(纸本)0769510388
The presence of precise exceptions in a processor leads to complications in its design. Some recent processor architectures have sacrificed this requirement for performance reasons at the cost of software complexity. We present an implementation strategy for precise exceptions in asynchronous processors that does not block the instruction fetch when exceptions do not occur; the cost of the exception handling mechanism is only encountered when an exception occurs during execution - an infrequent event.
Summary form only given. In order to investigate the diagnostic utility of OCT for identifying markers of dysplastic change, an integrated OCT colposcope has been developed and used for clinical imaging. The integrate...
详细信息
Summary form only given. In order to investigate the diagnostic utility of OCT for identifying markers of dysplastic change, an integrated OCT colposcope has been developed and used for clinical imaging. The integrated colposcope has a 300 mm long working distance and permits a simultaneous en face view of the cervix with real time OCT imaging. This design enables OCT images to be registered with the standard colposcopic view of cervical pathology. The OCT colposcope enables acquisition of cross-sectional tomographic images of cervical tissue. Images could be obtained with 15 /spl mu/m resolution at a rate of 4-8 frames per second for 500 and 250 transverse pixel images.
暂无评论