-
Albert-Laszlo Barabasi and Reka Albert.
Emergence of scaling in random networks.
Science,
286:509-512,
October 1999.
[PDF]
Keyword(s): Random graphs,
Scale-free graphs.
@Article{BarabasiAlbertScale99,
author = {Albert-Laszlo Barabasi and Reka Albert},
title = {Emergence of scaling in random networks},
journal = {Science},
year = 1999,
volume = 286,
pages = {509--512},
month = {October},
keywords = {Random graphs, Scale-free graphs},
pdf = {PAPERS/BarabasiAlbertScale99.pdf}
}
-
G. Bilardi,
A. Pietracaprina,
G. Pucci,
K. T. Herley,
and P. Spirakis.
BSP versus LogP.
Algorithmica,
24(3/4):405-422,
August 1999.
[PDF]
Keyword(s): BSP,
LogP.
Abstract: |
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, although issues surrounding the stalling phenomenon are also explored. Very efficient cross simulations between the two models are derived, showing their substantial equivalence for algorithmic design guided by asymptotic analysis. It is also shown that the two models can be implemented with similar performance on most point-to-point networks. In conclusion, within the limits of our analysis that is mainly of an asymptotic nature, BSP and (stall-free) LogP can be viewed as closely related variants within the bandwidth-latency framework for modeling parallel computation. BSP seems somewhat preferable due to its greater simplicity and portability, and slightly greater power. LogP lends itself more naturally to multiuser mode. |
@Article{BilardiPietracaprinaPucciBSPvsLogP99,
author = {G. Bilardi and A. Pietracaprina and G. Pucci and K. T. Herley and P. Spirakis},
title = {{BSP} versus {LogP}},
journal = {Algorithmica},
year = 1999,
volume = 24,
number = {3/4},
pages = {405--422},
month = {August},
keywords = {BSP, LogP},
pdf = {PAPERS/BilardiPietracaprinaPucciBSPvsLogP99.pdf},
abstract = {A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, although issues surrounding the stalling phenomenon are also explored. Very efficient cross simulations between the two models are derived, showing their substantial equivalence for algorithmic design guided by asymptotic analysis. It is also shown that the two models can be implemented with similar performance on most point-to-point networks. In conclusion, within the limits of our analysis that is mainly of an asymptotic nature, BSP and (stall-free) LogP can be viewed as closely related variants within the bandwidth-latency framework for modeling parallel computation. BSP seems somewhat preferable due to its greater simplicity and portability, and slightly greater power. LogP lends itself more naturally to multiuser mode.}
}
-
Michalis Faloutsos,
Petros Faloutsos,
and Christos Faloutsos.
On power-law relationships of the Internet topology.
In Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication,
pages 251-262,
1999.
ACM Press.
ISBN: 1-58113-135-6.
[PDF]
[doi:http://doi.acm.org/10.1145/316188.316229]
Keyword(s): Scale-free graphs.
@InProceedings{FaloutsosScale99,
author = {Michalis Faloutsos and Petros Faloutsos and Christos Faloutsos},
title = {On power-law relationships of the Internet topology},
booktitle = {Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication},
year = {1999},
isbn = {1-58113-135-6},
pages = {251--262},
location = {Cambridge, Massachusetts, United States},
doi = {http://doi.acm.org/10.1145/316188.316229},
publisher = {ACM Press},
keywords = {Scale-free graphs},
pdf = {PAPERS/FaloutsosScale99.pdf}
}
-
Lie-Quan Lee,
Jeremy Siek,
and Andrew Lumsdaine.
Generic Graph Algorithms for Sparse Matrix Ordering.
In International Symposium on Computing in Object-Oriented Parallel Environments,
volume 1732 of Lecture Notes in Computer Science,
pages 120-129,
1999.
Springer-Verlag.
[PDF]
@InProceedings{ lee99:iscope,
author = {Lie-Quan Lee and Jeremy Siek and Andrew Lumsdaine},
title = {Generic Graph Algorithms for Sparse Matrix Ordering},
booktitle = {International Symposium on Computing in Object-Oriented Parallel Environments},
year = 1999,
series = {Lecture Notes in Computer Science},
volume = 1732,
pages = {120--129},
publisher = {Springer-Verlag},
pdf = {http://lsc.nd.edu/downloads/research/ggcl/papers/iscope99.pdf}
}
-
Lie-Quan Lee,
Jeremy Siek,
and Andrew Lumsdaine.
The Generic Graph Component Library.
In Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications,
pages 339-414,
1999.
[PDF]
@InProceedings{ lee99:oopsla,
author = {Lie-Quan Lee and Jeremy Siek and Andrew Lumsdaine},
title = {The {G}eneric {G}raph {C}omponent {L}ibrary},
booktitle = {Proceedings of the 14th {ACM SIGPLAN} conference on Object-oriented programming, systems, languages, and applications},
year = 1999,
pages = {339--414},
pdf = {http://lsc.nd.edu/downloads/research/ggcl/papers/oopsla99_ggcl_final.pdf}
}