IEEE Transactions on Computers
2326-3814
Cơ quản chủ quản: N/A
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
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
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
Using application benefit for proactive resource allocation in asynchronous real-time distributed systems
Tập 51 Số 8 - Trang 945-962 - 2002
This paper presents two proactive resource allocation algorithms, called RBA*
and OBA, for asynchronous real-time distributed systems. The algorithms consider
an application model where timeliness requirements are expressed using Jensen's
benefit functions and propose adaptation functions to describe anticipated
application workload during future time intervals. Furthermore, the algorithms
conside...
#Resource management #Real time systems #Quality of service #Aggregates #Runtime #Application software #Adaptation model #Ethernet networks #Timing #Heuristic algorithms
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
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
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
Theory of Extended Linear Machines
Tập 51 Số 9 - Trang 1106-1110 - 2002
This paper extends the theory of autonomous linear machines (LMs). The theory of
the extension field has provided the foundation for the design of such machines
referred to as Extended Linear Machines (ELM). An analytical framework has been
reported to completely characterize the vector subspace generated by an ELM and
also different variations of LMs having cyclic, as well as noncyclic vector
sub...
#Vectors #Character generation #Galois fields #Error correction codes #Cryptography #Physics computing #Bridges #Linear feedback shift registers #Very large scale integration #Testing