↓ Skip to main content

Distributed Computing

Overview of attention for book
Cover of 'Distributed Computing'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Sense of direction in distributed computing
  3. Altmetric Badge
    Chapter 2 Top-down considerations on distributed computing
  4. Altmetric Badge
    Chapter 3 Inter-task co-ordination in long-lived distributed applications
  5. Altmetric Badge
    Chapter 4 Seamlessly selecting the best copy from internet-wide replicated web servers
  6. Altmetric Badge
    Chapter 5 Wait-free synchronization in quantum-based multiprogrammed systems
  7. Altmetric Badge
    Chapter 6 Computing in totally anonymous asynchronous shared memory systems
  8. Altmetric Badge
    Chapter 7 Transient fault detectors
  9. Altmetric Badge
    Chapter 8 Directed virtual path layouts in ATM networks
  10. Altmetric Badge
    Chapter 9 A decision-theoretic approach to reliable message delivery
  11. Altmetric Badge
    Chapter 10 Propagation and leader election in a multihop broadcast environment
  12. Altmetric Badge
    Chapter 11 The arrow distributed directory protocol
  13. Altmetric Badge
    Chapter 12 Efficient Byzantine agreement secure against general adversaries
  14. Altmetric Badge
    Chapter 13 Long-lived, fast, waitfree renaming with optimal name space and high throughput
  15. Altmetric Badge
    Chapter 14 The compactness of interval routing for almost all graphs
  16. Altmetric Badge
    Chapter 15 A wait-free classification of loop agreement tasks
  17. Altmetric Badge
    Chapter 16 A stabilizing repair timer
  18. Altmetric Badge
    Chapter 17 Java: Memory consistency and process coordination
  19. Altmetric Badge
    Chapter 18 A complete and constant time wait-free implementation of CAS from LL/SC and vice versa
  20. Altmetric Badge
    Chapter 19 Failure detection and consensus in the crash-recovery model
  21. Altmetric Badge
    Chapter 20 A more committed quorum-based three phase commit protocol
  22. Altmetric Badge
    Chapter 21 Multicast group communication as a base for a load-balancing replicated data service
  23. Altmetric Badge
    Chapter 22 Efficient deadlock-free multi-dimensional interval routing in interconnection networks
  24. Altmetric Badge
    Chapter 23 A new protocol for efficient cooperative transversal Web caching
  25. Altmetric Badge
    Chapter 24 Fairness of shared objects
  26. Altmetric Badge
    Chapter 25 Optimistic Atomic Broadcast
  27. Altmetric Badge
    Chapter 26 Approximate agreement with mixed mode faults: Algorithm and lower bound
  28. Altmetric Badge
    Chapter 27 Using remote access histories for thread scheduling in distributed shared memory systems
  29. Altmetric Badge
    Chapter 28 The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
  30. Altmetric Badge
    Chapter 29 Lifetime based consistency protocols for distributed objects
  31. Altmetric Badge
    Chapter 30 Deriving a scalable algorithm for mutual exclusion
  32. Altmetric Badge
    Chapter 31 OFC: A distributed fossil-collection algorithm for Time-Warp
Attention for Chapter 22: Efficient deadlock-free multi-dimensional interval routing in interconnection networks
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Efficient deadlock-free multi-dimensional interval routing in interconnection networks
Chapter number 22
Book title
Distributed Computing
Published in
Lecture notes in computer science, June 2006
DOI 10.1007/bfb0056489
Book ISBNs
978-3-54-065066-9, 978-3-54-049693-9
Authors

Rastislav KráĽovič, Branislav Rovan, Peter RuŽička, Daniel štefankovič, KráĽovič, Rastislav, Rovan, Branislav, RuŽička, Peter, štefankovič, Daniel

Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 14 February 2017.
All research outputs
#7,454,951
of 22,790,780 outputs
Outputs from Lecture notes in computer science
#2,486
of 8,127 outputs
Outputs of similar age
#22,648
of 64,738 outputs
Outputs of similar age from Lecture notes in computer science
#12
of 38 outputs
Altmetric has tracked 22,790,780 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 64,738 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 15th percentile – i.e., 15% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 38 others from the same source and published within six weeks on either side of this one. This one is in the 39th percentile – i.e., 39% of its contemporaries scored the same or lower than it.