About: Top-nodes algorithm     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatAlgorithms, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FTop-nodes_algorithm

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:

AttributesValues
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
  • http://commons.wikimedia.org/wiki/Special:FilePath/AlgoRayroleArbre.svg
  • http://commons.wikimedia.org/wiki/Special:FilePath/AlgoRayroleResa.svg
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
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software