Results 1 - 10 of 636,378

Concurrent Constraint Programming

by Vijay A. Saraswat, Martin Rinard , 1993
"... This paper presents a new and very rich class of (con-current) programming languages, based on the notion of comput.ing with parhal information, and the con-commitant notions of consistency and entailment. ’ In this framework, computation emerges from the inter-action of concurrently executing agent ..."
Abstract - Cited by 502 (16 self) - Add to MetaCart
agents that communi-cate by placing, checking and instantiating constraints on shared variables. Such a view of computation is in-teresting in the context of programming languages be-cause of the ability to represent and manipulate partial information about the domain of discourse, in the con

key-value stores

by Ricardo Vilaça, Rui Oliveira, José Pereira
"... correlation-aware data placement strategy for ..."
Abstract - Add to MetaCart
correlation-aware data placement strategy for

Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema

by Jeen Broekstra, Arjohn Kampman, Frank Van Harmelen , 2002
"... RDF and RDF Schema are two W3C standards aimed at enriching the Web with machine-processable semantic data. ..."
Abstract - Cited by 537 (11 self) - Add to MetaCart
RDF and RDF Schema are two W3C standards aimed at enriching the Web with machine-processable semantic data.

Monads for functional programming

by Philip Wadler , 1995
"... The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modification o ..."
Abstract - Cited by 1481 (39 self) - Add to MetaCart
of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.

Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System

by Douglas Terry, Marvin Theimer, Karin Petersen, Alan Demers, Mike Spreitzer, Carl Hauser - In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles , 1995
"... Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any accessible replica. Bayou's design has focused on supporting apph ..."
Abstract - Cited by 506 (14 self) - Add to MetaCart
apphcation-specific mechanisms to detect and resolve the update conflicts that naturally arise in such a system, ensuring that replicas move towards eventual consistency, and defining a protocol by which the resolution of update conflicts stabilizes. It includes novel methods for conflict detection, called

Robust Data Sharing with Key-Value Stores

by Cristina Bǎsescu, Christian Cachin, Ittay Eyal, Robert Haas, et al.
"... A key-value store (KVS) offers functions for storing and retrieving values associated with unique keys. KVSs have become the most popular way to access Internet-scale “cloud” storage systems. We present an efficient wait-free algorithm that emulates multi-reader multi-writer storage from a set of po ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
A key-value store (KVS) offers functions for storing and retrieving values associated with unique keys. KVSs have become the most popular way to access Internet-scale “cloud” storage systems. We present an efficient wait-free algorithm that emulates multi-reader multi-writer storage from a set

A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots

by Sebastian Thrun, Wolfram Burgard, Dieter Fox, Henry Hexmoor, Maja Mataric - Machine Learning , 1998
"... . This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximum-likelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract - Cited by 487 (47 self) - Add to MetaCart
. This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximum-likelihood estimation problem. It then devises a practical algorithm for generating the most likely map from

The Lifting Scheme: A Construction Of Second Generation Wavelets

by Wim Sweldens , 1997
"... . We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads to ..."
Abstract - Cited by 541 (16 self) - Add to MetaCart
to a faster, in-place calculation of the wavelet transform. Several examples are included. Key words. wavelet, multiresolution, second generation wavelet, lifting scheme AMS subject classifications. 42C15 1. Introduction. Wavelets form a versatile tool for representing general functions or data sets

A Hierarchical Internet Object Cache

by Anawat Chankhunthod , Peter B. Danzig, Chuck Neerdaels, Michael F. Schwartz, Kurt J. Worrell - IN PROCEEDINGS OF THE 1996 USENIX TECHNICAL CONFERENCE , 1995
"... This paper discusses the design andperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulation study of Internet traffic. We believe that the conventional wisdom, that the benefits of hierarch ..."
Abstract - Cited by 501 (6 self) - Add to MetaCart
of magnitude under concurrent load. These measurements indicate that hierarchy does not measurably increase access latency. Our software can also be configured as a Web-server accelerator; we present data that our httpd-accelerator is ten times faster than Netscape's Netsite and NCSA 1.4 servers. Finally

FlashStore: High Throughput Persistent KeyValue Store

by Biplob Debnath, Sudipta Sengupta, Jin Li
"... We present FlashStore, a high throughput persistent keyvalue store, that uses flash memory as a non-volatile cache between RAM and hard disk. FlashStore is designed to store the working set of key-value pairs on flash and use one flash read per key lookup. As the working set changes over time, space ..."
Abstract - Cited by 34 (2 self) - Add to MetaCart
, space is made for the current working set by destaging recently unused key-value pairs to hard disk and recycling pages in the flash store. FlashStore organizes key-value pairs in a log-structure on flash to exploit faster sequential writeperformance. Itusesanin-memoryhashtabletoindex them, with hash
Results 1 - 10 of 636,378