ACM Transactions on Computer Systems

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:  
Spanner
ACM Transactions on Computer Systems - Tập 31 Số 3 - Trang 1-22 - 2013
James C. Corbett, Jay B. Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson C. Hsieh, Sebastian Kanthak, Eugene Kogan, Hongyi Li, Alexander Lloyd, Sergey Melnik, David Mwaura, David F. Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saitō, Michal Szymaniak, Christopher M. Taylor, Ruth Wang, Dale Woodford
Spanner is Google’s scalable, multiversion, globally distributed, and synchronously replicated database. It is the first system to distribute data at global scale and support externally-consistent distributed transactions. This article describes how Spanner is structured, its feature set, the rationale underlying various design decisions, and a novel time API that exposes clock uncertainty. This A... hiện toàn bộ
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems - Tập 11 Số 4 - Trang 319-352 - 1993
Thomas E. Anderson, Susan Owicki, James B. Saxe, Charles P. Thacker
Current technology trends make it possible to build communication networks that can support high-performance distributed computing. This paper describes issues in the design of a prototype switch for an arbitrary topology point-to-point network with link speeds of up to 1 Gbit/s. The switch deals in fixed-length ATM-style cells, which it can process at a rate of 37 million cells per second. It pro... hiện toàn bộ
Error bounds for performance prediction in queuing networks
ACM Transactions on Computer Systems - Tập 3 Số 3 - Trang 227-254 - 1985
Y. C. Tay, Rajan Suri
Analytic models based on closed queuing networks (CQNS) are widely used for performance prediction in practical systems. In using such models, there is always a prediction error, that is, a difference between the predicted performance and the actual outcome. This prediction error is due both to modeling errors and estimation errors, the latter being the difference between the estimated values of t... hiện toàn bộ
Eliminating receive livelock in an interrupt-driven kernel
ACM Transactions on Computer Systems - Tập 15 Số 3 - Trang 217-252 - 1997
Jeffrey C. Mogul, K. K. Ramakrishnan
Most operating systems use interface interrupts to schedule network tasks. Interrupt-driven systems can provide low overhead and good latency at low offered load, but degrade significantly at higher arrival rates unless care is taken to prevent several pathologies. These are various forms of receive livelock , in which the system spends all of its time processing interrupts, to the exclusion of ot... hiện toàn bộ
A logic of authentication
ACM Transactions on Computer Systems - Tập 8 Số 1 - Trang 18-36 - 1990
Michael T. Burrows, Martı́n Abadi, Roger M. Needham
Authentication protocols are the basis of security in many distributed systems, and it is therefore essential to ensure that these protocols function correctly. Unfortunately, their design has been extremely error prone. Most of the protocols found in the literature contain redundancies or security flaws. A simple logic has allowed us to describe the beliefs of trustworthy parties involved in auth... hiện toàn bộ
A √N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems - Tập 3 Số 2 - Trang 145-159 - 1985
Masashi Maekawa
An algorithm is presented that uses only c√N messages to create mutual exclusion in a computer network, where N is the number of nodes and c a constant between 3 and 5. The algorithm is symmetric and allows fully parallel operation.
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems - Tập 20 Số 4 - Trang 398-461 - 2002
Miguel Castro, Barbara Liskov
Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, Byzantine faults. This article describes a new replication algorithm, BFT, that can be used to build ... hiện toàn bộ
The LOCKSS peer-to-peer digital preservation system
ACM Transactions on Computer Systems - Tập 23 Số 1 - Trang 2-50 - 2005
Petros Maniatis, Mema Roussopoulos, TJ Giuli, David S. H. Rosenthal, Mary Baker
The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent Web caches that cooperate to detect and repair damage to their content by voting in “opinion polls.” Based on this experience, we present a design for and si... hiện toàn bộ
Tổng số: 8   
  • 1