Sciweavers

645 search results - page 68 / 129
» concurrency 2007
Sort
View
112
Voted
SOSP
2007
ACM
15 years 9 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
115
Voted
CONCURRENCY
2010
130views more  CONCURRENCY 2010»
15 years 19 days ago
Enabling high-speed asynchronous data extraction and transfer using DART
As the complexity and scale of current scientific and engineering applications grow, managing and transporting the large amounts of data they generate is quickly becoming a signif...
Ciprian Docan, Manish Parashar, Scott Klasky
186
Voted
POPL
2007
ACM
16 years 26 days ago
Specialization of CML message-passing primitives
Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous ope...
John H. Reppy, Yingqi Xiao
92
Voted
HPCC
2007
Springer
15 years 6 months ago
Throttling I/O Streams to Accelerate File-IO Performance
To increase the scale and performance of scientific applications, scientists commonly distribute computation over multiple processors. Often without realizing it, file I/O is pa...
Seetharami R. Seelam, Andre Kerstens, Patricia J. ...
161
Voted
SMALLTALK
2007
Springer
15 years 6 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz