Results 1 - 10 of 283

Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing

by Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy Mccauley, Michael J. Franklin, Scott Shenker, Ion Stoica , 2011
"... We present Resilient Distributed Datasets (RDDs), a distributed memory abstraction that lets programmers perform in-memory computations on large clusters in a fault-tolerant manner. RDDs are motivated by two types of applications that current computing frameworks handle inefficiently: iterative algo ..."
Abstract - Cited by 239 (27 self) - Add to MetaCart
algorithms and interactive data mining tools. In both cases, keeping data in memory can improve performance by an order of magnitude. To achieve fault tolerance efficiently, RDDs provide a restricted form of shared memory, based on coarsegrained transformations rather than fine-grained updates to shared

Exploiting Atomic Broadcast in Replicated Databases (Extended Abstract)

by Divyakant Agrawal, Gustavo Alonso, Amr El Abbadi, Ioana Stanoi , 1997
"... In spite of the fact that many applications require replicated databases either for performance or fault-tolerance, replication has remained a research issue until recently. Today, the demand for practical replication schemes has greatly increased and some simple protocols are being implemented in d ..."
Abstract - Cited by 69 (16 self) - Add to MetaCart
in databases (Oracle and Sybase, for instance) or in application development tools (Lotus Notes). These, however, are ad hoc implementations and the issue of replicated data management is still a source of controversy among database practitioners and researchers. On one hand, traditional synchronous protocols

Exploiting Atomic Broadcast in Replicated Databases

by Fernando Pedone , 1998
"... Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We argue in this paper that this approach is not always adequate to efficient ..."
Abstract - Cited by 57 (13 self) - Add to MetaCart
if implemented with an atomic broadcast termination protocol than if implemented with atomic commitment. 1 Introduction Replication is considered a cheap software based way to increase data availability when compared to hardware based specialised techniques [16]. However, designing a replication scheme

Lightweight recoverable virtual memory

by M. Satyanarayanan, Henry H. Mashburn, Puneet Kumar, David C. Steere, James J. Kistler - ACM Transactions on Computer Systems , 1994
"... Recoverable virtual memory refers to regions of a virtual This combination of circumstances is most likely to be found in situations involving the meta-data of storage address space on which transactional guarantees are repositories. Thus RVM can benefit a wide range of offered. This paper describes ..."
Abstract - Cited by 122 (10 self) - Add to MetaCart
describes RVM, an efficient, portable, applications from distributed file systems and databases, to and easily used implementation of recoverable virtual object-oriented repositories, CAD tools, and CASE tools. memory for Unix environments. A unique characteristic RVM can also provide runtime support

Optimizations for Dynamic Inverted Index Maintenance

by Doug Cutting, Jan Pedersen , 1990
"... For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic requirement. B-trees are an effective tool in implementing such indices. The Zipfian distribution of postings suggests space and time optimizations unique to this task. In particular, we present two nov ..."
Abstract - Cited by 90 (2 self) - Add to MetaCart
For free-text search over rapidly evolving corpora, dynamic update of inverted indices is a basic requirement. B-trees are an effective tool in implementing such indices. The Zipfian distribution of postings suggests space and time optimizations unique to this task. In particular, we present two

Learning and Design of Principal Curves

by Balázs Kégl, Adam Krzyzak, Tamás Linder, Kenneth Zeger , 2000
"... Principal curves have been defined as ``self consistent'' smooth curves which pass through the ``middle'' of a $d$-dimensional probability distribution or data cloud. They give a summary of the data and also serve as an efficient feature extraction tool. We take a new approach by ..."
Abstract - Cited by 105 (4 self) - Add to MetaCart
Principal curves have been defined as ``self consistent'' smooth curves which pass through the ``middle'' of a $d$-dimensional probability distribution or data cloud. They give a summary of the data and also serve as an efficient feature extraction tool. We take a new approach

Distributed

by Waqaas Munawar, Olaf L, Muhammad Hamad Alizai, Klaus Wehrle, Rwth Aachen
"... Abstract—Wireless Sensor Networks (WSNs) are deployed for long periods of time, during which a need often arises to dynamically reprogram or retask them. An array of solutions has been proposed to this effect, ranging from full image replacement to virtual machines. However, the capabilities of Tiny ..."
Abstract - Add to MetaCart
Abstract—Wireless Sensor Networks (WSNs) are deployed for long periods of time, during which a need often arises to dynamically reprogram or retask them. An array of solutions has been proposed to this effect, ranging from full image replacement to virtual machines. However, the capabilities

A Performance Comparison of Asynchronous Atomic Broadcast Protocols

by Flaviu Cristian, Richard De Beijer, Shivakant Mishra - Distributed Systems Engineering , 1994
"... Atomic broadcast ensures that concurrent updates to replicated data maintained by a process group are consistently delivered to all group members despite random communication delays and failures. By simplifying the programming of applications that use replicated data, atomic broadcast provides basic ..."
Abstract - Cited by 29 (4 self) - Add to MetaCart
Atomic broadcast ensures that concurrent updates to replicated data maintained by a process group are consistently delivered to all group members despite random communication delays and failures. By simplifying the programming of applications that use replicated data, atomic broadcast provides

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
, proposed in my trilogy The Information Age: Economy, Society, and Culture (see the updated, and revised 'New Millennium edition' of this work: Castells 2000a). Since, in my view, theor y is simply a research tool, and not the end product of research, the purpose of this exercise is to help

Experience with distributed programming in Orca

by Henri E. Bal, M. Frans Kaashoek, Andrew S. Tanenbaum - in Proc. IEEE CS International Conference on Computer Languages , 1990
"... Orca is a language for programming parallel applications on distributed computing systems. Although processors in such systems communicate only through message passing and not through shared memory, data types and create instances (objects) of these types, which may be shared among processes. All op ..."
Abstract - Cited by 43 (10 self) - Add to MetaCart
Orca is a language for programming parallel applications on distributed computing systems. Although processors in such systems communicate only through message passing and not through shared memory, data types and create instances (objects) of these types, which may be shared among processes. All
Results 1 - 10 of 283