A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids

Philip Chan, David Abramson. A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids. In Third International Conference on e-Science and Grid Computing, e-Science 2007, 10-13 December 2007, Bangalore, India. pages 352-359, IEEE Computer Society, 2007. [doi]

@inproceedings{ChanA07:0,
  title = {A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids},
  author = {Philip Chan and David Abramson},
  year = {2007},
  doi = {10.1109/E-SCIENCE.2007.6},
  url = {http://doi.ieeecomputersociety.org/10.1109/E-SCIENCE.2007.6},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/ChanA07%3A0},
  cites = {0},
  citedby = {0},
  pages = {352-359},
  booktitle = {Third International Conference on e-Science and Grid Computing, e-Science 2007, 10-13 December 2007, Bangalore, India},
  publisher = {IEEE Computer Society},
}