IEEE Transactions on Computers
2326-3814
Cơ quản chủ quản: N/A
Các bài báo tiêu biểu
Performance modeling and prediction of nondedicated network computing
Tập 51 Số 9 - Trang 1041-1055 - 2002
The low cost and wide availability of networks of workstations have made them an
attractive solution for high performance computing. However, while a network of
workstations may be readily available, these workstations may be privately owned
and the owners may not want others to interrupt their priority in using the
computer. Assuming machine owners have a preemptive priority, in this paper, we
st...
#Predictive models #Computer networks #Workstations #Distributed computing #Parallel processing #Concurrent computing #Pervasive computing #High performance computing #Costs #Availability
The timewheel group communication system
Tập 51 Số 8 - Trang 883-899 - 2002
Describes the timewheel group communication system, which has been designed for
a timed asynchronous distributed system model. All protocols in the timewheel
group communication system have been designed to be fail-aware in the sense that
a process can detect, at any point in time, whether any of its properties is
violated. Although these protocols have been designed to operate in an
asynchronous ...
#Protocols #Broadcasting #Computer Society #Throughput #Stability #Fault tolerant systems #Delay #Distributed computing #Availability #Clocks
UCFS - a novel User-space, high performance, Customized File System for Web proxy servers
Tập 51 Số 9 - Trang 1056-1073 - 2002
Web proxy caching servers play a key role in today's Web infrastructure.
Previous studies have shown that disk I/O is one of the major performance
bottlenecks of proxy servers. Most conventional file systems do not work well
for proxy server workloads and have high overheads. This paper presents a novel,
User-space, Customized File System, called UCFS, that can drastically improve
the I/O performa...
#File systems #File servers #SQUIDs #Network servers #Web server #Utility programs #Web sites #Telecommunication traffic #Delay
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
The timely computing base model and architecture
Tập 51 Số 8 - Trang 916-930 - 2002
Current systems are very often based on large-scale, unpredictable and
unreliable infrastructures. However, users of these systems increasingly require
services with timeliness properties. This creates a difficult-to-solve
contradiction with regard to the adequate time model: should it be synchronous,
or asynchronous? In this paper, we propose an architectural construct and
programming model which...
#Computer architecture #Real time systems #Timing #Fault tolerant systems #Large-scale systems #Computer networks #Distributed computing #Explosives #Reliability theory
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
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
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
Một mạng hội nghị mới cho giao tiếp nhóm Dịch bởi AI
Tập 51 Số 9 - Trang 995-1010 - 2002
Một hội nghị đề cập đến một nhóm các thành viên trong một mạng lưới giao tiếp
với nhau trong phạm vi nhóm. Trong bài báo này, chúng tôi đề xuất một thiết kế
mới cho một mạng hội nghị hỗ trợ nhiều hội nghị không giao nhau. Thành phần
chính của mạng là một mạng đa giai đoạn được cấu thành từ các mô-đun chuyển mạch
có khả năng vào và ra. Một thuật toán tự định tuyến nhanh được phát triển để
thiết lập...
#Định tuyến #Chuyển mạch #Phần cứng #Chi phí #Công việc hợp tác #Ảnh hưởng độ trễ #Tính toán phân tán #Phát sóng #Chuyển mạch giao tiếp #Điện thoại
A unifying service discipline for providing rate-based guaranteed and fair queuing services based on the Timed Token protocol
Tập 51 Số 9 - Trang 1011-1025 - 2002
Multiservice networks face the challenge of managing several traffic classes
simultaneously. Service disciplines devised for multiservice networks therefore
need to be flexible, i.e., able to provide different types of service, in order
to accommodate different traffic classes efficiently. In this paper, we present
and analyze an innovative Timed Token Service Discipline (TTSD, which has been
give...
#Telecommunication traffic #Quality of service #Bandwidth #Traffic control #Delay #Communication system traffic control #Protocols #Processor scheduling #Computational complexity #Switches