| Modularity: a first class concept to address distributed systems |
| Full text |
Pdf
(2.42 MB)
|
Source
|
ACM SIGACT News
archive
Volume 39 , Issue 2 (June 2008)
table of contents
COLUMN: ACM SIGACT news distributed computing column 30
table of contents
Pages 91-110
Year of Publication: 2008
ISSN:0163-5700
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 47, Citation Count: 0
|
|
|
ABSTRACT
Decomposing distributed systems into modules, each with a precise interface and a functional implementation independent specification, is highly effective both from a software engineering point of view and for theoretical purposes. The usefulness of this approach has been demonstrated in the past in several areas of distributed computing. Yet, despite its attractiveness, so far work on peer to peer systems failed to do so. This paper argues in favor of this approach and advocates such a decomposition for peer to peer systems. This allows designers to understand and explain both what a system does and how it does it.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
 |
3
|
|
| |
4
|
Bonnet F., Kermarrec A.-M. and Raynal M., Small-world networks: from theoretical bounds to practical systems. Proc. 11th Int'l Conference On Principles Of Distributed Systems (OPODIS'07), Springer-Verlag LNCS 4878, pp. 372--385, 2007.
|
 |
5
|
|
| |
6
|
|
| |
7
|
Dabek F., Zhao B., Druschel P., Kubiatowicz J., and Stoica I., Towards a common API for structured peer to peer overlays. Proc. 2nd Int'l Workshop on peer to peer Systems (IPTPS '03), Berkeley, CA, 2003.
|
 |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
|
 |
12
|
Kourosh Gharachorloo , Daniel Lenoski , James Laudon , Phillip Gibbons , Anoop Gupta , John Hennessy, Memory consistency and event ordering in scalable shared-memory multiprocessors, Proceedings of the 17th annual international symposium on Computer Architecture, p.15-26, May 28-31, 1990, Seattle, Washington, United States
|
 |
13
|
|
| |
14
|
|
| |
15
|
Jelasity M. and Babaoglu O., T-Man: Gossip-Based Overlay Topology Management Engineering Self-Organising Systems, 1(15), 2005.
|
 |
16
|
|
 |
17
|
|
| |
18
|
|
| |
19
|
Mostefaoui A., Mourgaya E., and Raynal M., Asynchronous implementation of failure detectors. Proc. Int'l IEEE Conference on Dependable Systems and Networks (DSN'03), IEEE Computer Press, pp. 351--360, 2003.
|
 |
20
|
|
| |
21
|
|
 |
22
|
Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard Karp , Scott Schenker, A scalable content-addressable network, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.161-172, August 2001, San Diego, California, United States
|
| |
23
|
Ion Stoica , Robert Morris , David Liben-Nowell , David R. Karger , M. Frans Kaashoek , Frank Dabek , Hari Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking (TON), v.11 n.1, p.17-32, February 2003
[doi> 10.1109/TNET.2002.808407]
|
| |
24
|
Voulgaris S., Gavidia D. and van Steen M., CYCLON: inexpensive membership management for unstructured P2P overlays. Journal of Network and Systems Management, 13(2):197--217, 2005.
|
| |
25
|
Watts D. J. and Stogatz S. H. Collective dynamics of small-world networks. Nature, 393, 1998.
|
| |
26
|
|
|