DistOS 2014W Lecture 18: Difference between revisions
No edit summary |
No edit summary |
||
| Line 9: | Line 9: | ||
** how the information flow? | ** how the information flow? | ||
* each nod has neighbour table which that contains the node neighbour number. | * each nod has neighbour table which that contains the node neighbour number. | ||
** Tapestry API: | |||
* have four operations called | |||
* each node has ID and each endpoint has GUID (Globally unique identifier). | |||
Revision as of 15:00, 18 March 2014
- Tapestry
- Distributed .
- Simple key-value store.
- using DHT ( distributed hash table).
- look up table contains : key and value
- DNS as tree but Tapestry as hercically structure.
- More dtails about Tapestry:
- how the information flow?
- each nod has neighbour table which that contains the node neighbour number.
- Tapestry API:
- have four operations called
- each node has ID and each endpoint has GUID (Globally unique identifier).