Zobrazeno 1 - 10
of 693
pro vyhledávání: '"Wait-for graph"'
In highly automated devices, deadlock is a case that occurs when no system can permit its event which may give irrelevant economic losses. A process can request or release resources that are either available or are on hold by others. If a process req
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::534654fb3be9e3add1b849a6f815dc1a
https://zenodo.org/record/7118341
https://zenodo.org/record/7118341
Publikováno v:
Journal of Computer Science and Technology, Vol 3, Iss 02, Pp 38-44 (2003)
Deadlock detection is one of the most discussed problems in the literature. Although several al- gorithms have been proposed, the problem is still open. In general, the correct operation of an algorithm depends on the requirement model being consider
Externí odkaz:
https://doaj.org/article/e679587c1a6149ca93dc9ec4afcd7655
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
2021 Third International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV).
In Distributed Database System (DBS) and multitasking system, the occurrence of deadlocks is one of the most serious problems. If a site request for a resource that is already in the another site which is waiting for another resource then the scenari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2ab2770ff52f774808833f4a88ffa33
https://doi.org/10.1109/icicv50876.2021.9388399
https://doi.org/10.1109/icicv50876.2021.9388399
Autor:
Nadeem Akhtar, Mohd Vasim Ahamad
A social network can be defined as a complex graph, which is a collection of nodes connected via edges. Nodes represent individual actors or people in the network, whereas edges define relationships among those actors. Most popular social networks ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0e97cd5f181e7f143fe3035efa40b5b
https://doi.org/10.4018/978-1-7998-7297-9.ch025
https://doi.org/10.4018/978-1-7998-7297-9.ch025
Publikováno v:
Lecture Notes on Data Engineering and Communications Technologies ISBN: 9783030707125
In distributed system, a single database is spread physically across computers in multiple locations called distributed database. One of the most serious problems in distributed database is deadlock. The deadlock is a state of the system in which tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e59f51c6b9cbdba21f56c28900e87aa
https://doi.org/10.1007/978-3-030-70713-2_43
https://doi.org/10.1007/978-3-030-70713-2_43
Publikováno v:
HPDC
We reduce the cost of communication and synchronization in graph processing by analyzing the fastest way to process graphs: pushing the updates to a shared state or pulling the updates to a private state. We investigate the applicability of this push
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9de9e8d912999b9a5275ba7ba307b14b
http://arxiv.org/abs/2010.16012
http://arxiv.org/abs/2010.16012
Autor:
Sherif Sakr
Publikováno v:
Big Data 2.0 Processing Systems ISBN: 9783030441869
Big Data 2.0 Processing Systems ISBN: 9783319387758
Big Data 2.0 Processing Systems ISBN: 9783319387758
Recently, people, devices, processes, and other entities have been more connected than at any other point in history. In general, a graph is a natural, neat, and flexible structure to model the complex relationships, interactions, and interdependenci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc1ec6b823a6c605af9efdbca25feedc
https://doi.org/10.1007/978-3-030-44187-6_4
https://doi.org/10.1007/978-3-030-44187-6_4
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.