Browsing by Subject "Data structures"
Now showing items 120 of 29

Article
Balancing networks: State of the art
(1997)Balancing networks have recently been proposed by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 1991, pp. 348358 as a new class of distributed, lowcontention data structures ...

Conference Object
Brief Announcement: Optimally workcompetitive scheduling for cooperative computing with merging groups
(2002)The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous ...

Article
Classification capacity of a modular neural network implementing neurally inspired architecture and training rules
(2004)A threelayer neural network (NN) with novel adaptive architecture has been developed. The hidden layer of the network consists of slabs of single neuron models, where neurons within a slabbut not between slabs have the ...

Article
A combinatorial treatment of balancing networks
(1996)Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348358, May 1991), represent a new class of distributed, lowcontention data structures ...

Conference Object
Continuous all knearestneighbor querying in smartphone networks
(2012)Consider a centralized query operator that identifies to every smart phone user its k geographically nearest neighbors at all times, a query we coin Continuous All kNearest Neighbor (CAkNN). Such an operator could be ...

Article
The cost of concurrent, lowcontention Read&Modify&Write
(2005)The possibility or impossibility and the corresponding costs of devising concurrent, lowcontention implementations of atomic Read&Modify&Write (or RMW) operations in a distributed system were addressed. A natural class ...

Article
D3machine: A decoupled datadriven multithreaded architecture with variable resolution support
(2001)This paper presents the Decoupled DataDriven machine (D3machine), a multithreaded architecture with datadriven synchronization. The D3machine is an efficient and costeffective design that combines the advantages of ...

Article
Dynamic adaptive data structures for monitoring data streams
(2008)The monitoring of data streams is a very important issue in many different areas. Aspects such as accuracy, the speed of response, the use of memory and the adaptability to the changing nature of data may vary in importance ...

Article
Dynamic count filters
(2006)Bloom filters are not able to handle deletes and inserts on multisets over time. This is important in many situations when streamed data evolve rapidly and change patterns frequently. Counting Bloom Filters (CBF) have been ...

Conference Object
Efficient counting network
(1998)Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. Highperformance ...

Article
An efficient counting network
(2010)We present a novel counting network construction, where the number of input wires w is smaller than or equal to the number of output wires t. The depth of our network is Θ(lg2w), which depends only on w. In contrast, the ...

Article
Efficient indexing data structures for flashbased sensor devices
(2006)Flash memory is the most prevalent storage medium found on modern wireless sensor devices (WSDs). In this article we present two external memory index structures for the efficient retrieval of records stored on the local ...

Conference Object
FAST: a functional algorithm simulation testbed
(Publ by IEEE, 1994)In this paper we extend the practical range of simulations of parallel executions by what we call 'functional algorithm simulation,' that is, simulation without actually performing most of the numerical computations involved. ...

Article
The impact of network structure on the stability of greedy protocols
(2005)Some examples of the impact network structure has on stability behavior of greedy protocols and networks were presented. An important problem was to study the impact of network structure parameters on other greedy protocols. ...

Conference Object
Impact of timing on linearizability in counting networks
(IEEE, 1997)Counting networks form a new class of distributed, lowcontention data structures, made up of interconnected balancers and are suitable for solving a variety of multiprocessor synchronization problems that can be expressed ...

Article
Incorporating input/output operations into dynamic dataflow graphs
(1995)Driven by the 'sideeffect' environment of sequential von Neumann computing, Input/Output operations have evolved as state operations on shared files. In parallel programs, if multiple instances of an I/Operforming process ...

Article
Information retrieval techniques for peertopeer networks
(2004)An important challenge in peertopeer (P2P) networks is to efficiently search the contents of other peers. The authors survey existing search techniques for information retrieval in P2P networks, including recent techniques ...

Conference Object
Intelligent classification and retrieval of software components
(2006)This work proposes a new methodology for intelligent classification and retrieval of software components based on userdefined requirements. The classification scheme utilizes a dedicated genetic algorithm which evolves a ...

Article
Limits of data value predictability
(1999)The predictability of data values is studied at a fundamental level. Two basic predictor models are defined: Computational predictors perform an operation on previous values to yield predicted next values. Examples we study ...

Conference Object
Modeling program predictability
(IEEE Comp Soc, 1998)Basic properties of program predictability  for both values and control  are defined and studied. We take the view that program predictability originates at certain points during a program's execution, flows through ...