Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Data (E) > Data Structures (E.1) > Distributed Data Structures (E.1...)  
 
Options:
 
  1-10 of 26 Reviews about "Distributed Data Structures (E.1...)": Date Reviewed
  Distributed systems: an algorithmic approach (2nd ed.)
Ghosh S.,  Chapman & Hall/CRC, Boca Raton, FL, 2015. 554 pp. Type: Book (978-1-466552-97-5)

Distributed systems are the cornerstone of past and future computing applications. But just when you think new mobile apps are making it easier to connect, along comes the complex reality of distributed networking, scaling across untold numbers of...

Mar 13 2015
  Think big with big data: identifying suitable big data strategies in corporate environments
Ebner K., Bühnen T., Urbach N.  HICSS 2014 (Proceedings of the 47th Annual Hawaii International Conference on System Sciences, Waikoloa Village, HI,  Jan 6-9, 2014) 3748-3757, 2014. Type: Proceedings

While “no insight without analysis” is even truer for big data, organizations today still face the challenge of identifying an adequate technical architecture for achieving that. For this task, in the case of traditional data routinely...

Sep 11 2014
  Distributed graph coloring: fundamentals and recent developments
Barenboim L., Elkin M.,  Morgan&Claypool Publishers, San Rafael, CA, 2013. 172 pp. Type: Book (978-1-627050-18-0)

Distributed computing has been an active area of research for a few decades now; we have witnessed significant advances in the principles of distributed computing and the design and analysis of distributed algorithms. Now is the right time for the...

Jul 21 2014
  Distributed data aggregation for sparse recovery in wireless sensor networks
Li S., Qi H.  DCOSS 2013 (Proceedings of the 2013 IEEE International Conference on Distributed Computing in Sensor Systems, May 20-23, 2013) 62-69, 2013. Type: Proceedings

We are standing on the threshold of an era of widely distributed but limited sensors: low-power, low-speed devices that collect data about their environment, both physical and virtual. The multihop wireless sensor network (WSN) is a widely applica...

Jan 3 2014
  Abstracting runtime heaps for program understanding
Marron M., Sanchez C., Su Z., Fahndrich M.  IEEE Transactions on Software Engineering 39(6): 774-786, 2013. Type: Article

Every software engineer, regardless of their level of experience in the industry, has been faced with debugging a null-pointer dereference bug, and the experience is rarely one that engineers recall with fondness. Bugs in memory allocation are dep...

Sep 20 2013
  Grid-based hierarchy structure for mining and querying vehicular ad-hoc networks
Samarah S.  DIVANet 2012 (Proceedings of the 2nd ACM International Symposium on Design and Analysis of Intelligent Vehicular Networks and Applications, Paphos, Cyprus,  Oct 21-22, 2012) 63-68, 2012. Type: Proceedings

Emerging research on information systems for vehicular traffic management points to self-organizing information systems built around vehicular ad-hoc networks (VANETs). VANETs provide timely broadcast and geocast capabilities for informing and man...

Jan 3 2013
  Replicated abstract data types: building blocks for collaborative applications
Roh H., Jeon M., Kim J., Lee J.  Journal of Parallel and Distributed Computing 71(3): 354-368, 2011. Type: Article

Collaborative distributed applications trade off local responsiveness with global consistency. Optimistic replication favors responsiveness by assuming inconsistency won’t happen, or happens infrequently with modest consequences. The many pr...

Jul 21 2011
  Dynamic load balancing in RCAN content addressable network
Boukhelef D., Kitagawa H.  ICUIMC 2009 (Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, Suwon, Korea,  Jan 15-16, 2009) 98-106, 2009. Type: Proceedings

The peer-to-peer (P2P) diagram is gaining popularity in data sharing among large numbers of nodes. It can be viewed as a decentralized overlay network over the Internet. The basic idea is that every node in the network takes the same responsibilit...

Jul 13 2009
  Skip graphs
Aspnes J., Shah G.  ACM Transactions on Algorithms 3(4): 37-es, 2007. Type: Article

Peer-to-peer (P2P) systems based on distributed hash tables (DHTs) are starting to deliver desirable features such as decentralization, scalability, fault tolerance, self stabilization, data availability, load balancing, and dynamic addition and d...

Apr 16 2008
  Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS
Fatourou P., Kallimanis N.  Principles of distributed computing (Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, Portland, Oregon,  Aug 12-15, 2007) 33-42, 2007. Type: Proceedings

An important issue in multiprocess systems is getting consistent views of shared memory. One solution is to use a snapshot object that is shared by all processes....

Nov 15 2007
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy