Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1196582> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Q1196582 abstract "Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is simple, easy to implement, and starvation-free. Round-robin scheduling can also be applied to other scheduling problems, such as data packet scheduling in computer networks. It is an Operating System concept.The name of the algorithm comes from the round-robin principle known from other fields, where each person takes an equal share of something in turn.".
- Q1196582 thumbnail Round-robin_schedule_quantum_3.png?width=300.
- Q1196582 wikiPageWikiLink Q1123036.
- Q1196582 wikiPageWikiLink Q1193100.
- Q1196582 wikiPageWikiLink Q1362921.
- Q1196582 wikiPageWikiLink Q1392979.
- Q1196582 wikiPageWikiLink Q1639854.
- Q1196582 wikiPageWikiLink Q1665191.
- Q1196582 wikiPageWikiLink Q16801758.
- Q1196582 wikiPageWikiLink Q17097315.
- Q1196582 wikiPageWikiLink Q17097321.
- Q1196582 wikiPageWikiLink Q173772.
- Q1196582 wikiPageWikiLink Q179310.
- Q1196582 wikiPageWikiLink Q193446.
- Q1196582 wikiPageWikiLink Q1978975.
- Q1196582 wikiPageWikiLink Q207971.
- Q1196582 wikiPageWikiLink Q2295611.
- Q1196582 wikiPageWikiLink Q2714551.
- Q1196582 wikiPageWikiLink Q457762.
- Q1196582 wikiPageWikiLink Q5251561.
- Q1196582 wikiPageWikiLink Q5300.
- Q1196582 wikiPageWikiLink Q565733.
- Q1196582 wikiPageWikiLink Q583970.
- Q1196582 wikiPageWikiLink Q5978010.
- Q1196582 wikiPageWikiLink Q7250364.
- Q1196582 wikiPageWikiLink Q7979905.
- Q1196582 wikiPageWikiLink Q830287.
- Q1196582 wikiPageWikiLink Q910548.
- Q1196582 wikiPageWikiLink Q9135.
- Q1196582 wikiPageWikiLink Q913876.
- Q1196582 comment "Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is simple, easy to implement, and starvation-free. Round-robin scheduling can also be applied to other scheduling problems, such as data packet scheduling in computer networks.".
- Q1196582 label "Round-robin scheduling".
- Q1196582 depiction Round-robin_schedule_quantum_3.png.