FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3121054812> ?p ?o ?g. }

• W3121054812 endingPage "84" @default.
• W3121054812 startingPage "70" @default.
• W3121054812 abstract "Previous chapter Next chapter Full AccessProceedings Symposium on Algorithmic Principles of Computer Systems (APOCS)The Read-Only Semi-External ModelGuy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, and Julian ShunGuy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, and Julian Shunpp.70 - 84Chapter DOI:https://doi.org/10.1137/1.9781611976489.6PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract We introduce the Read-Only Semi-External (ROSE) Model for the design and analysis of algorithms on large graphs. As in the well-studied semi-external model for graph algorithms, we assume that the vertices but not the edges fit in a small fast (shared) random-access memory, the edges reside in an unbounded (shared) external memory, and transfers between the two memories are done in blocks of size B. A key difference in ROSE, however, is that the external memory can be read from but not written to. This difference is motivated by important practical considerations: because the graph is not modified, a single instance of the graph can be shared among parallel processors and even among unrelated concurrent graph algorithms without synchronization, that instance can be stored compressed without the need for re-compression, the graph can be accessed without cache coherence issues, and the wear-out problems of non-volatile memory, such as Optane NVRAM, can be avoided. Using ROSE, we analyze parallel algorithms (some existing, some new) for 18 fundamental graph problems. We show that these algorithms are work-efficient, highly parallel, and read the external memory using only a block-friendly (and compression-friendly) primitive: fetch all the edges for a given vertex. Analyzing the maximum times this primitive is called for any vertex yields an (often tight) bound on the (low) I/O cost of our algorithms. We present new, specially-designed ROSE algorithms for triangle counting, FRT trees, and strongly connected components, devising new parallel algorithm techniques for ROSE and beyond. Previous chapter Next chapter RelatedDetails Published:2021eISBN:978-1-61197-648-9 https://doi.org/10.1137/1.9781611976489Book Series Name:ProceedingsBook Code:APOSC21Book Pages:ii + 158" @default.
• W3121054812 created "2021-01-18" @default.
• W3121054812 creator A5014824446 @default.
• W3121054812 creator A5032160862 @default.
• W3121054812 creator A5033930662 @default.
• W3121054812 creator A5043897310 @default.
• W3121054812 creator A5051583907 @default.
• W3121054812 creator A5065818820 @default.
• W3121054812 date "2021-01-01" @default.
• W3121054812 modified "2023-10-13" @default.
• W3121054812 title "The Read-Only Semi-External Model" @default.
• W3121054812 cites W1543897857 @default.
• W3121054812 cites W1581008104 @default.
• W3121054812 cites W1582397847 @default.
• W3121054812 cites W1945708402 @default.
• W3121054812 cites W1965972569 @default.
• W3121054812 cites W1965996575 @default.
• W3121054812 cites W1968020161 @default.
• W3121054812 cites W1982056505 @default.
• W3121054812 cites W1986816824 @default.
• W3121054812 cites W1994727615 @default.
• W3121054812 cites W2000041758 @default.
• W3121054812 cites W2012931756 @default.
• W3121054812 cites W2013081353 @default.
• W3121054812 cites W2016559894 @default.
• W3121054812 cites W2020022171 @default.
• W3121054812 cites W2025919541 @default.
• W3121054812 cites W2026842524 @default.
• W3121054812 cites W2027018686 @default.
• W3121054812 cites W2038142281 @default.
• W3121054812 cites W2041185818 @default.
• W3121054812 cites W2041571997 @default.
• W3121054812 cites W2041994075 @default.
• W3121054812 cites W2046441184 @default.
• W3121054812 cites W2055245094 @default.
• W3121054812 cites W2056496054 @default.
• W3121054812 cites W2060675879 @default.
• W3121054812 cites W2065457989 @default.
• W3121054812 cites W2066636486 @default.
• W3121054812 cites W2075862701 @default.
• W3121054812 cites W2082353536 @default.
• W3121054812 cites W2089064856 @default.
• W3121054812 cites W2092720654 @default.
• W3121054812 cites W2095875205 @default.
• W3121054812 cites W2098147619 @default.
• W3121054812 cites W2103656237 @default.
• W3121054812 cites W2117169958 @default.
• W3121054812 cites W2150303531 @default.
• W3121054812 cites W2159031085 @default.
• W3121054812 cites W2165753192 @default.
• W3121054812 cites W2169528477 @default.
• W3121054812 cites W2171707538 @default.
• W3121054812 cites W2269957429 @default.
• W3121054812 cites W2282989799 @default.
• W3121054812 cites W2406481306 @default.
• W3121054812 cites W2469481711 @default.
• W3121054812 cites W2473485914 @default.
• W3121054812 cites W2562123954 @default.
• W3121054812 cites W2738607799 @default.
• W3121054812 cites W2739409954 @default.
• W3121054812 cites W2755088640 @default.
• W3121054812 cites W2781869913 @default.
• W3121054812 cites W2802440256 @default.
• W3121054812 cites W2805674303 @default.
• W3121054812 cites W2894525377 @default.
• W3121054812 cites W2921153466 @default.
• W3121054812 cites W2949839187 @default.
• W3121054812 cites W2963548574 @default.
• W3121054812 cites W2963938832 @default.
• W3121054812 cites W2964106805 @default.
• W3121054812 cites W2964244402 @default.
• W3121054812 cites W3022260960 @default.
• W3121054812 cites W3029618096 @default.
• W3121054812 cites W3034903651 @default.
• W3121054812 cites W3037631006 @default.
• W3121054812 cites W3041171185 @default.
• W3121054812 cites W3041758129 @default.
• W3121054812 cites W3098197211 @default.
• W3121054812 cites W3111546386 @default.
• W3121054812 cites W3121104049 @default.
• W3121054812 cites W3124031623 @default.
• W3121054812 cites W3124387147 @default.
• W3121054812 doi "https://doi.org/10.1137/1.9781611976489.6" @default.
• W3121054812 hasPublicationYear "2021" @default.
• W3121054812 type Work @default.
• W3121054812 sameAs 3121054812 @default.
• W3121054812 citedByCount "4" @default.
• W3121054812 countsByYear W31210548122021 @default.
• W3121054812 countsByYear W31210548122022 @default.
• W3121054812 countsByYear W31210548122023 @default.
• W3121054812 crossrefType "book-chapter" @default.
• W3121054812 hasAuthorship W3121054812A5014824446 @default.
• W3121054812 hasAuthorship W3121054812A5032160862 @default.
• W3121054812 hasAuthorship W3121054812A5033930662 @default.
• W3121054812 hasAuthorship W3121054812A5043897310 @default.
• W3121054812 hasAuthorship W3121054812A5051583907 @default.
• W3121054812 hasAuthorship W3121054812A5065818820 @default.
• W3121054812 hasConcept C11413529 @default.

• next