A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Filters
Transactional client-server cache consistency: alternatives and performance
1997
ACM Transactions on Database Systems
The results show that the interactions among dimensions of the design space can impact performance in many ways, and that classifications of algorithms as simply "pessimistic" or "optimistic" do not accurately ...
Many such algorithms have been proposed in the literature and, as all provide the same functionality, performance is a primary concern in choosing among them. ...
One such class of systems is shared-disk (or data sharing) parallel database systems, which consist of multiple nodes with private processors and memory that share a common disk pool [Bhide and Stonebraker ...
doi:10.1145/261124.261125
fatcat:nkl25ic6xbdx3mje3fiu5ha6hy
The evolution of Coda
2002
ACM Transactions on Computer Systems
Failure-resilient, scalable, and secure read-write access to shared information by mobile and static users over wireless and wired networks is a fundamental computing challenge. ...
The article closes with a discussion of the technical and nontechnical lessons that can be learned from the evolution of the system. ...
The views and conclusions in this paper are those of the author, and do not represent the opinions, express or implied, of the U.S. ...
doi:10.1145/507052.507053
fatcat:lob5fyaqh5edrlbxctvkzupcby
We design, develop, and evaluate Yesquel, a system that provides performance and scalability comparable to NOSQL with all the features of a SQL relational system. ...
Yesquel has a new architecture and a new distributed data structure, called YDBT, which Yesquel uses for storage, and which performs well under contention by many concurrent clients. ...
We are indebted especially to Roy Levin and Michael D. Schroeder for creating a rich and fertile research environment, where this work could blossom, at the late MSR Silicon Valley. ...
doi:10.1145/2815400.2815413
dblp:conf/sosp/AguileraLW15
fatcat:rfsszlwqtrgxteambhez3dk4qa
Consistency without ordering
2012
USENIX Conference on File and Storage Technologies
We utilize a formal model to prove that NoFS provides data consistency in the event of system crashes; we show through experiments that NoFS is robust to such crashes, and delivers excellent performance ...
In this paper, we introduce the No-Order File System (NoFS), a simple, lightweight file system that employs a novel technique called backpointer-based consistency to provide crash consistency without ordering ...
This material is based upon work supported by the NSF under CCF-0811657 and CNS-0834392 as well as donations from Google, NetApp, and Samsung. ...
dblp:conf/fast/ChidambaramSAA12
fatcat:forhx6psg5a6tpkygl5y6kbboy
Farsite
2002
ACM SIGOPS Operating Systems Review
data with a Byzantine-fault-tolerant protocol; it is designed to be scalable by using a distributed hint mechanism and delegation certificates for pathname translations; and it achieves good performance ...
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. ...
These workloads exhibit high access locality, a low persistent update rate, and a pattern of read/write sharing that is usually sequential and rarely concurrent [22, 48] . ...
doi:10.1145/844128.844130
fatcat:ktl2mecjtfcqxp6g3zgv6osomy
Farsite
2002
Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02
data with a Byzantine-fault-tolerant protocol; it is designed to be scalable by using a distributed hint mechanism and delegation certificates for pathname translations; and it achieves good performance ...
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. ...
These workloads exhibit high access locality, a low persistent update rate, and a pattern of read/write sharing that is usually sequential and rarely concurrent [22, 48] . ...
doi:10.1145/1060289.1060291
fatcat:mekfwe6xsrebpjhkqara6wh2wm
Safe Commits for Transactional Featherweight Java
[chapter]
2010
Lecture Notes in Computer Science
In the lock-based setting, using explicit locks in a non-lexical scope to protect critical regions might be the source of aliasing problems or misuse of locks. ...
As a leader of the group, Olaf Owe is a great supporter both in research and personal life. ...
Acknowledgements We thank the anonymous reviewers for their helpful suggestions. ...
doi:10.1007/978-3-642-16265-7_21
fatcat:juc6xoj4pbdqrokxzcr2zqr7ei
ChronoSphere: a graph-based EMF model repository for IT landscape models
2019
Journal of Software and Systems Modeling
In order to solve these challenges and meet the requirements that arise from this application domain, we combine domain-driven modeling concepts with scalable graph-based repository technology and a custom ...
Finally, we evaluate our approach in a case study where our open-source repository implementation is employed in a production environment in an industrial context, as well as in a comparative benchmark ...
, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. ...
doi:10.1007/s10270-019-00725-0
pmid:31975977
pmcid:PMC6944265
fatcat:zucm7gknrvhx5hunqi4iuptg7y
Managing battery lifetime with energy-aware adaptation
2004
ACM Transactions on Computer Systems
By monitoring energy supply and demand and by maintaining a history of application energy use, the approach can dynamically balance energy conservation and application quality. ...
We demonstrate that a collaborative relationship between the operating system and applications can be used to meet user-specified goals for battery duration. ...
We also thank Brian Noble, Kip Walker, and Eric Tilton for their contributions to the Odyssey platform. Keith Farkas, Todd Mowry, and Dan Siewiorek provided valuable insights throughout this project. ...
doi:10.1145/986533.986534
fatcat:mgli7ii5gbeyrffspjfrxl53ty
HopsFS: Scaling Hierarchical File System Metadata Using NewSQL Databases
[article]
2017
arXiv
pre-print
Recent improvements in both the performance and scalability of shared-nothing, transactional, in-memory NewSQL databases have reopened the research question of whether distributed metadata for hierarchical ...
Finally, as metadata is now stored in a commodity database, it can be safely extended and easily exported to external systems for online analysis and free-text search. ...
Acknowledgements This work is funded by Swedish Foundation for Strategic Research project "E2E-Clouds", and by EU FP7 project "Scalable, Secure Storage and Analysis of Biobank Data" under Grant Agreement ...
arXiv:1606.01588v2
fatcat:vzav2dsmtfgylejtp547ysmahu
L-Store: A Real-time OLTP and OLAP System
[article]
2017
arXiv
pre-print
In this paper, we present Lineage-based Data Store (L-Store) that combines the real-time processing of transactional and analytical workloads within a single unified engine by introducing a novel lineage-based ...
But to derive real-time actionable insights from the data, it is important to bridge the gap between managing the data that is being updated at a high velocity (i.e., OLTP) and analyzing a large volume ...
validation in the optimistic concurrency is only needed for ging (both undo-redo logs). ...
arXiv:1601.04084v2
fatcat:maxm46zinrcsrln5bkf2qg37ci
Architectures and algorithms for on-line failure recovery in redundant disk arrays
1994
Distributed and parallel databases
The two key issues addressed are the data layout, the mapping by which data and parity blocks are assigned to physical disk blocks in an array, and the reconstruction algorithm, which is the technique ...
This paper describes and evaluates mechanisms by which this disk array failure-recovery performance can be improved. ...
an empty disk queue. ...
doi:10.1007/bf01266332
fatcat:wrfq7jllqrhmboau5bdq4gzfci
Scaling data mining in massively parallel dataflow systems
2014
Proceedings of the 2014 SIGMOD PhD symposium on - SIGMOD'14 PhD Symposium
pessimistic recovery, and the optimistic recovery mechanism proposed in this paper. ...
The main objective of these data structures is to use as little memory as possible and to avoid object allocation and full garbage collection invocations in the JVM. ...
doi:10.1145/2602622.2602631
dblp:conf/sigmod/Schelter14
fatcat:kejcowbahrfl7mguzivnolwtoq
Memory leads the way to better computing
2015
Nature Nanotechnology
The report itself was drawn from the results of a series of meetings over the second half of 2007, and as such reflects a snapshot in time. ...
The goal of the study was to assay the state of the art, and not to either propose a potential system or prepare and propose a detailed roadmap for its development. ...
In several cases the language-based implementations uses a lexically scoped threads mechanism, such as cobegin/coend, in which the lifetime of a thread is visible in the program text. ...
doi:10.1038/nnano.2015.29
pmid:25740127
fatcat:d6iiuuwcozbxlgn4kxxzdzwd4m
HopsFS: Scaling Hierarchical File System Metadata Using NewSQL Databases
[chapter]
2018
Encyclopedia of Big Data Technologies
I would also like to extend my deepest gratitude to my second advisor Seif Haridi for his constructive discussion and feedback on this thesis and the included research papers. ...
Without his guidance and support, this thesis would not have been possible. ...
owns the lock) is set and persisted in the database. ...
doi:10.1007/978-3-319-63962-8_146-1
fatcat:tmuujviqnvfspjjefocgf62tzu
« Previous
Showing results 1 — 15 out of 193 results