Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Edge_chasing> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Edge_chasing abstract "In computer science, edge-chasing is an algorithm for deadlock detection in distributed systems. Whenever a process A is blocked for some resource, a probe message is sent to all processes A may depend on. The probe message contains the process id of A along with the path that the message has followed through the distributed system. If a blocked process receives the probe it will update the path information and forward the probe to all the processes it depends on. Non-blocked processes may discard the probe.If eventually the probe returns to process A, there is a circular waiting loop of blocked processes, and a deadlock is detected. Efficiently detecting such cycles in the “wait-for graph” of blocked processes is an important implementation problem.".
- Edge_chasing wikiPageID "1473427".
- Edge_chasing wikiPageLength "940".
- Edge_chasing wikiPageOutDegree "7".
- Edge_chasing wikiPageRevisionID "520849493".
- Edge_chasing wikiPageWikiLink Category:Distributed_algorithms.
- Edge_chasing wikiPageWikiLink Circular_wait.
- Edge_chasing wikiPageWikiLink Computer_science.
- Edge_chasing wikiPageWikiLink Deadlock.
- Edge_chasing wikiPageWikiLink Distributed_computing.
- Edge_chasing wikiPageWikiLink Distributed_systems.
- Edge_chasing wikiPageWikiLink Process_(computer_science).
- Edge_chasing wikiPageWikiLink Process_(computing).
- Edge_chasing wikiPageWikiLink Wait-for_graph.
- Edge_chasing wikiPageWikiLinkText "Edge chasing".
- Edge_chasing wikiPageWikiLinkText "edge chasing".
- Edge_chasing hasPhotoCollection Edge_chasing.
- Edge_chasing wikiPageUsesTemplate Template:Unreferenced.
- Edge_chasing subject Category:Distributed_algorithms.
- Edge_chasing hypernym Algorithm.
- Edge_chasing type Article.
- Edge_chasing type Software.
- Edge_chasing type Algorithm.
- Edge_chasing type Article.
- Edge_chasing comment "In computer science, edge-chasing is an algorithm for deadlock detection in distributed systems. Whenever a process A is blocked for some resource, a probe message is sent to all processes A may depend on. The probe message contains the process id of A along with the path that the message has followed through the distributed system. If a blocked process receives the probe it will update the path information and forward the probe to all the processes it depends on.".
- Edge_chasing label "Edge chasing".
- Edge_chasing sameAs m.0549nh.
- Edge_chasing sameAs Q5337690.
- Edge_chasing sameAs Q5337690.
- Edge_chasing wasDerivedFrom Edge_chasing?oldid=520849493.
- Edge_chasing isPrimaryTopicOf Edge_chasing.