TC
1998
13 years 4 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
TC
1998
13 years 4 months ago
1998
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
TC
1998
13 years 4 months ago
1998
—The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we pr...
TC
1998
13 years 4 months ago
1998
Abstract—A widely used bus-encryption microprocessor is vulnerable to a new practical attack. This type of processor decrypts onthe-fly while fetching code and data, which are st...
TC
1998
13 years 4 months ago
1998
—Within the scope of the multithreaded dataflow, the problem of scheduling/allocation of DOACROSS loops has been discussed and it was shown that the so-called staggered allocatio...
TC
1998
13 years 4 months ago
1998
TC
1998
13 years 4 months ago
1998
—The very high levels of integration and submicron device sizes used in current and emerging VLSI technologies for FPGAs lead to higher occurrences of defects and operational fau...
TC
1998
13 years 4 months ago
1998
—Many applications require communication services with guaranteed timeliness and fault tolerance at an acceptable level of overhead. We present a scheme for restoring real-time c...
TC
1998
13 years 4 months ago
1998
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
TC
1998
13 years 4 months ago
1998
—The achievement of media synchronization has been dealt with in the Object Composition Petri Net (OCPN) model and the extended OCPN (XOCPN) model. Yet these two models are not e...