The top-nodes algorithm is an algorithm for managing a resource reservation calendar. The algorithm has been first published in 2003, and has been improved in 2009. It is used when a resource is shared among many users (for example bandwidth in a telecommunication link, or disk capacity in a large data center). The algorithm allows users to:
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Algorithme des nœuds chapeaux (fr)
- Top-nodes algorithm (en)
|
rdfs:comment
| - L’algorithme des nœuds chapeaux est un algorithme de gestion d'un calendrier de ressources. Il a été inventé en 2003, et amélioré en 2009. Il est utilisé pour partager une ressource entre un grand nombre d'utilisateurs (par exemple pour réserver de la bande passante dans un réseau télécom, ou de l'espace disque dans un centre de calcul). (fr)
- The top-nodes algorithm is an algorithm for managing a resource reservation calendar. The algorithm has been first published in 2003, and has been improved in 2009. It is used when a resource is shared among many users (for example bandwidth in a telecommunication link, or disk capacity in a large data center). The algorithm allows users to: (en)
|
foaf:depiction
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
thumbnail
| |
has abstract
| - L’algorithme des nœuds chapeaux est un algorithme de gestion d'un calendrier de ressources. Il a été inventé en 2003, et amélioré en 2009. Il est utilisé pour partager une ressource entre un grand nombre d'utilisateurs (par exemple pour réserver de la bande passante dans un réseau télécom, ou de l'espace disque dans un centre de calcul). (fr)
- The top-nodes algorithm is an algorithm for managing a resource reservation calendar. The algorithm has been first published in 2003, and has been improved in 2009. It is used when a resource is shared among many users (for example bandwidth in a telecommunication link, or disk capacity in a large data center). The algorithm allows users to:
* check if an amount of resource is available during a specific period of time,
* reserve an amount of resource for a specific period of time,
* delete a previous reservation,
* move the calendar forward (the calendar covers a defined duration, and it must be moved forward as time goes by). (en)
|
gold:hypernym
| |
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is foaf:primaryTopic
of | |