Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Cheramangalath, Unnikrishnan"'
Graph algorithms are challenging to implement due to their varying topology and irregular access patterns. Real-world graphs are dynamic in nature and routinely undergo edge and vertex additions, as well as, deletions. Typical examples of dynamic gra
Externí odkaz:
http://arxiv.org/abs/2305.17813
Autor:
Cheramangalath, Unnikrishnan
Graphs model relationships across real-world entities in web graphs, social network graphs, and road network graphs. Graph algorithms analyze and transform a graph to discover graph properties or to apply a computation. For instance, a pagerank algor
Externí odkaz:
http://etd.iisc.ernet.in/2005/3978
http://etd.iisc.ernet.in/abstracts/4866/G28548-Abs.pdf
http://etd.iisc.ernet.in/abstracts/4866/G28548-Abs.pdf
Graph algorithms are at the heart of several applications, and achieving high performance with them has become critical due to the tremendous growth of irregular data. However, irregular algorithms are quite challenging to parallelize automatically,
Externí odkaz:
http://arxiv.org/abs/1903.01665
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.
Autor:
Chekole, Eyasu Getahun, Cheramangalath, Unnikrishnan, Chattopadhyay, Sudipta, Ochoa, Martin, Huaqun, Guo
Memory-safety attacks have been one of the most critical threats against computing systems. Although a wide-range of defense techniques have been developed against these attacks, the existing mitigation strategies have several limitations. In particu
Externí odkaz:
http://arxiv.org/abs/1809.07477
Autor:
Chekole, Eyasu Getahun, Chattopadhyay, Sudipta, Ochoa, Martín, Guo, Huaqun, Cheramangalath, Unnikrishnan
Publikováno v:
In Computers & Security July 2020 94
