IEEE Transactions on Computers

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Theory of Extended Linear Machines
IEEE Transactions on Computers - Tập 51 Số 9 - Trang 1106-1110 - 2002
K. Paul, D.R. Choudhury, P.P. Chaudhuri
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... hiện toàn bộ
#Vectors #Character generation #Galois fields #Error correction codes #Cryptography #Physics computing #Bridges #Linear feedback shift registers #Very large scale integration #Testing
A unifying service discipline for providing rate-based guaranteed and fair queuing services based on the Timed Token protocol
IEEE Transactions on Computers - Tập 51 Số 9 - Trang 1011-1025 - 2002
L. Lenzini, E. Mingozzi, G. Stea
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... hiện toàn bộ
#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
IEEE Transactions on Computers - Tập 51 Số 8 - Trang 945-962 - 2002
T. Hegazy, B. Ravindran
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... hiện toàn bộ
#Resource management #Real time systems #Quality of service #Aggregates #Runtime #Application software #Adaptation model #Ethernet networks #Timing #Heuristic algorithms
The timely computing base model and architecture
IEEE Transactions on Computers - Tập 51 Số 8 - Trang 916-930 - 2002
P. Verissimo, A. Casimiro
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... hiện toàn bộ
#Computer architecture #Real time systems #Timing #Fault tolerant systems #Large-scale systems #Computer networks #Distributed computing #Explosives #Reliability theory
Solving the group priority inversion problem in a timed asynchronous system
IEEE Transactions on Computers - Tập 51 Số 8 - Trang 900-915 - 2002
Yun Wang, E. Anceaume, F. Brasileiro, F. Greve, M. Hurfin
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... hiện toàn bộ
#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
IEEE Transactions on Computers - Tập 51 Số 9 - Trang 995-1010 - 2002
Yuanyuan Yang
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... hiện toàn bộ
#Đị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
On augmenting trace cache for high-bandwidth value prediction
IEEE Transactions on Computers - Tập 51 Số 9 - Trang 1074-1088 - 2002
Sang-Jeong Lee, Pen-Chung Yew
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... hiện toàn bộ
#Bandwidth #Hardware #Performance gain #Accuracy #Registers #Clocks #Prediction algorithms #Decoding
Automatic reconfiguration and yield of the TESH multicomputer network
IEEE Transactions on Computers - Tập 51 Số 8 - Trang 963-972 - 2002
B.M. Maziarz, V.K. Jain
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 ... hiện toàn bộ
#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
IEEE Transactions on Computers - Tập 51 Số 9 - Trang 1089-1099 - 2002
Jun Xu, M. Singhal
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... hiện toàn bộ
#Routing #Throughput #Traffic control #Search engines #Data structures #Analytical models #Statistical analysis #Performance analysis #Web and internet services #Logic
Performance modeling and prediction of nondedicated network computing
IEEE Transactions on Computers - Tập 51 Số 9 - Trang 1041-1055 - 2002
Linguo Gong, Xian-He Sun, E.F. Watson
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... hiện toàn bộ
#Predictive models #Computer networks #Workstations #Distributed computing #Parallel processing #Concurrent computing #Pervasive computing #High performance computing #Costs #Availability
Tổng số: 19   
  • 1
  • 2