Results 1  10
of
836,696
A design of a parallel dictionary using skip lists
, 1996
"... We present a topdown design of a parallel PRAM dictionary using skip lists. More precisely, we give detailed algorithms to search for, insert or delete k elements in a skip list of n elements in parallel. The algorithms are iterative and easy to implement on real machines. We discuss some implementa ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
We present a topdown design of a parallel PRAM dictionary using skip lists. More precisely, we give detailed algorithms to search for, insert or delete k elements in a skip list of n elements in parallel. The algorithms are iterative and easy to implement on real machines. We discuss some
Skip Graphs
 Proc. of the 14th Annual ACMSIAM Symp. on Discrete Algorithms
, 2003
"... Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peertopeer systems, and by providin ..."
Abstract

Cited by 306 (9 self)
 Add to MetaCart
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peertopeer systems
The protection of information in computer systems
"... This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main sectio ..."
Abstract

Cited by 819 (2 self)
 Add to MetaCart
of protecting information in computers. Access The ability to make use of information stored in a computer system. Used frequently as a verb, to the horror of grammarians. Access control list A list of principals that are authorized to have access to some object. Authenticate To verify the identity of a person
Scalable molecular dynamics with NAMD.
 J Comput Chem
, 2005
"... Abstract: NAMD is a parallel molecular dynamics code designed for highperformance simulation of large biomolecular systems. NAMD scales to hundreds of processors on highend parallel platforms, as well as tens of processors on lowcost commodity clusters, and also runs on individual desktop and la ..."
Abstract

Cited by 848 (63 self)
 Add to MetaCart
roadmap to the internal design of NAMD, implemented in Cϩϩ and based on Charmϩϩ parallel objects, are outlined. The factors affecting the serial and parallel performance of a simulation are discussed. Finally, typical NAMD use is illustrated with representative applications to a small, a medium, and a
A TopDown Design of a Parallel Dictionary using Skip Lists
, 1994
"... We present a top down design of a parallel PRAM dictionary using skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are simple and easy to implement on real machines. All of them are iterative. Th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a top down design of a parallel PRAM dictionary using skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are simple and easy to implement on real machines. All of them are iterative
Parallel Update And Search In Skip Lists
"... We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are simple and easy to explain and implement. All of them are iterative. They can be ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are simple and easy to explain and implement. All of them are iterative. They can
Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors
, 1999
"... Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported ..."
Abstract

Cited by 326 (5 self)
 Add to MetaCart
Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported
Skip Lists: A Randomized Dictionary
, 1999
"... Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a data structure such that the following three operations can be performed eciently: 1. Search(x): Given a real number x, nd the largest element of S[f1g that is less than or equal to x. (By introducing ..."
Abstract
 Add to MetaCart
Introduction We consider the dictionary problem: Given a set S of n real numbers, store them in a data structure such that the following three operations can be performed eciently: 1. Search(x): Given a real number x, nd the largest element of S[f1g that is less than or equal to x. (By
Extracting paraphrases from a parallel corpus
 In Proc. of the ACL/EACL
, 2001
"... While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of th ..."
Abstract

Cited by 252 (6 self)
 Add to MetaCart
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations
On the Cost of Persistence and Authentication in Skip Lists
"... We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design decisions ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures that allow us to study the performance overhead of authentication and persistence. We explore various design
Results 1  10
of
836,696