Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots, the instruction scheduler faces the difficult problem of filling the many delay slots. This paper proposes two

delay spread values and various numbers of users. The results show that our proposed algorithm outperforms multiuser OFDM systems with static time-division multiple access (TDMA) or frequency-division multiple access (FDMA) techniques which employ fixed and predetermined time-slot or subcarrier

The effect of multipacket reception (MPR) on stability and delay of slotted ALOHA based random-access systems is considered. A general asymmetric MPR model is introduced and the medium-access control (MAC) capacity region is specified. An explicit characterization of the ALOHA stability region

Abstract — Long propagation delays and low bit rates of underwater acoustic networks make these systems fundamentally different from the packet radio networks. As a consequence, many of the network protocols designed for radio channels are either not applicable, or have extremely low efficiency

with delay constraints in terms of the catastrophe theory. A lifetime of a packet is confined within D slots, that is, a packet will be discarded after timer of D time-slots expired, unless packet transmission succeeds. Letting r be the packet transmission probability in a slot, we indicate that there exists

in the layout. Today, however, physical design and verification tools cannot remain oblivious to such foundry post-processing. Without an accurate estimate of the filling and slotting, RC extraction, delay calculation, and timing and noise analysis flows will all suffer from wild inaccuracies. Therefore, future

The effect of Multipacket Reception (MPR) on stability and delay of slotted ALOHA based random access systems is considered. A general asymmetric MPR model is introduced and the MAC capacity region is specified. An explicit characterization of the ALOHA stability region for the two user system

Dataflow architectures tolerate long unpredictable com-munication delays and support generation and coordi-nation of parallel activities directly in hardware, rather than assuming that program mapping will cause these issues to disappear. However, the proposed mecha-nisms are complex and introduce

Distributed real-time systems in all their forms, for example in-vehicle electronics, factory-floor controls or wireless sensor systems, need to communicate with bounded delays. TDMA (time division multiple access) protocols solve this by assigning messages to time slots such that no two nodes

The performance of a superpipeline processor heavily relies on its branch performance. Traditional branch strategies used in pipelined processors are delayed branches and branch with squashing. Delayed branches use safe instructions to fill delay slots. However, for a deeply pipelined processor, a