Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2295611> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q2295611 subject Q7415169.
- Q2295611 abstract "In computer science, starvation is a problem encountered in concurrent computing where a process is perpetually denied necessary resources to process its work. Starvation may be caused by errors in a scheduling or mutual exclusion algorithm, but can also be caused by resource leaks, and can be intentionally caused via a denial-of-service attack such as a fork bomb.The impossibility of starvation in a concurrent algorithm is called starvation-freedom, lockout-freedom or finite bypass, is an instance of liveness, and is one of the two requirements for any mutual exclusion algorithm (the other being correctness). The name "finite bypass" means that any process (concurrent part) of the algorithm is bypassed at most a finite number times before being allowed access to the shared resource.".
- Q2295611 wikiPageWikiLink Q1046373.
- Q2295611 wikiPageWikiLink Q1047554.
- Q2295611 wikiPageWikiLink Q1123036.
- Q2295611 wikiPageWikiLink Q1146920.
- Q2295611 wikiPageWikiLink Q128392.
- Q2295611 wikiPageWikiLink Q131406.
- Q2295611 wikiPageWikiLink Q17097321.
- Q2295611 wikiPageWikiLink Q205663.
- Q2295611 wikiPageWikiLink Q21198.
- Q2295611 wikiPageWikiLink Q2668095.
- Q2295611 wikiPageWikiLink Q3561421.
- Q2295611 wikiPageWikiLink Q4692574.
- Q2295611 wikiPageWikiLink Q520734.
- Q2295611 wikiPageWikiLink Q524059.
- Q2295611 wikiPageWikiLink Q623276.
- Q2295611 wikiPageWikiLink Q7315829.
- Q2295611 wikiPageWikiLink Q7366294.
- Q2295611 wikiPageWikiLink Q7415169.
- Q2295611 wikiPageWikiLink Q771906.
- Q2295611 wikiPageWikiLink Q9662.
- Q2295611 comment "In computer science, starvation is a problem encountered in concurrent computing where a process is perpetually denied necessary resources to process its work.".
- Q2295611 label "Starvation (computer science)".