IEEE Transactions on Computers
2326-3814
Cơ quản chủ quản: N/A
Lĩnh vực:
Các bài báo tiêu biểu
Computing the shortest network under a fixed topology
Tập 51 Số 9 - Trang 1117-1120 - 2002
We show that, in any given uniform orientation metric plane, the shortest network interconnecting a given set of points under a fixed topology can be computed by solving a linear programming problem whose size is bounded by a polynomial in the number of terminals and the number of legal orientations. When the given topology is restricted to a Steiner topology, our result implies that the Steiner m......
#Computer networks #Network topology #Telecommunication network topology #Steiner trees #Costs #Circuit topology #Tree graphs #Linear programming #Polynomials #Law
A new addition formula for elliptic curves over GF(2/sup n/)
Tập 51 Số 8 - Trang 972-975 - 2002
We propose an addition formula in projective coordinates for elliptic curves over GF(2/sup n/). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10......
#Elliptic curves #Galois fields #Elliptic curve cryptography #Arithmetic #Security #Licenses #Differential equations
Automatic reconfiguration and yield of the TESH multicomputer network
Tập 51 Số 8 - Trang 963-972 - 2002
This paper considers defect tolerance issues for parallel computing systems based on a new interconnection network, namely "Tori connected mESHes (TESH)". Key features of this network are the following: it is hierarchical, thus allowing exploitation of computation locality and systematic expansion up to a million processors; and it appears to be well-suited for VLSI/ULSI realization, including 3D ......
#Routing #Parallel processing #Computer networks #Very large scale integration #Ultra large scale integration #Redundancy #Computer aided manufacturing #Multiprocessor interconnection networks #Concurrent computing #Switches
Cost-effective flow table designs for high-speed routers: architecture and performance evaluation
Tập 51 Số 9 - Trang 1089-1099 - 2002
Provision of QoS-related router functions such as traffic regulation, policy routing, and usage-based accounting requires that a flow table store state information for active flows. The design of such a flow table is not trivial for a high-speed Internet router (e.g., 100+ Gbps) with a large number of active flows (e.g., tens of millions) and a high packet arrival rate (e.g., tens of millions of p......
#Routing #Throughput #Traffic control #Search engines #Data structures #Analytical models #Statistical analysis #Performance analysis #Web and internet services #Logic
Unroll-based copy elimination for enhanced pipeline scheduling
Tập 51 Số 9 - Trang 977-994 - 2002
Enhanced pipeline scheduling (EPS) is a software pipelining technique which can achieve a variable initiation interval (II) for loops with control flow via its code motion pipelining. EPS, however, leaves behind many renaming copy instructions that cannot be coalesced due to interferences. These copies take resources and, more seriously, they may cause a stall if they rename a multilatency instruc......
#Pipeline processing #Interference #Delay #VLIW #Moon #Motion control #Performance evaluation #Testing #Optimizing compilers
On augmenting trace cache for high-bandwidth value prediction
Tập 51 Số 9 - Trang 1074-1088 - 2002
Value prediction is a technique that breaks true data dependences by predicting the outcome of an instruction and speculatively executes its data-dependent instructions based on the predicted outcome. As the instruction fetch rate and issue rate of processors increase, the potential data dependences among instructions issued in the same cycle also increase. Value prediction and speculative executi......
#Bandwidth #Hardware #Performance gain #Accuracy #Registers #Clocks #Prediction algorithms #Decoding
Acceleration of nonnumeric operations using hardware support for the Ordered Table Hashing algorithms
Tập 51 Số 9 - Trang 1026-1040 - 2002
The paper introduces a new approach to acceleration of nonnumeric, database, and information retrieval operations. While traditional techniques accelerate the most time-critical high-level software constructs, we propose novel low-level primitives and demonstrate how these primitives improve database operations. Radix sorting, hashing, and bit-vector operations are used to develop a new class of n......
#Acceleration #Hardware #Database machines #Very large scale integration #Information retrieval #Sorting #Statistics #Time factors #Digital arithmetic #Logic
Solving the group priority inversion problem in a timed asynchronous system
Tập 51 Số 8 - Trang 900-915 - 2002
Considers the priority inversion problem in an actively replicated system. Priority inversion was originally defined in the context of nonreplicated systems. Therefore, we first introduce the concept of group priority inversion, which extends the concept of (local) priority inversion to the context of a group of processors that perform an actively replicated processing. We then present the propert......
#Protocols #Fault tolerant systems #Real time systems #Delay #Synchronization #Computer Society #Processor scheduling #Mechanical factors #Predictive models #Detectors
A deterministic multivariate interpolation algorithm for small finite fields
Tập 51 Số 9 - Trang 1100-1105 - 2002
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show that it is possible to find an n-variable interpolating polynomial with at most t terms, using the number of field operations that is polynomial in t and n. The algorithm exploits the structure of the multivariate genera......
#Interpolation #Galois fields #Polynomials #Discrete transforms #Decoding #Testing #Circuits #Lagrangian functions
Fast asynchronous uniform consensus in real-time distributed systems
Tập 51 Số 8 - Trang 931-944 - 2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lack of bounded finite delays is antagonistic with timeliness requirements. We show how to circumvent this apparent contradiction, via the principle of "late binding" of a solution to some (partially) synchronous model. Thi......
#Real time systems #Detectors #Distributed computing #Computational modeling #Algorithm design and analysis #Fault tolerant systems #Delay #Safety #Computer crashes #Buildings