FRINK Linked Data Fragments server

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

• W2782155280 abstract "Concurrent programming has become popular in the recent years to facilitate exploitation of hardwarecapabilities. Because threads are executed concurrently on di�erent processors, and are subjectto operating system scheduling decisions, page faults, interrupts, etc., we must think of the computationas completely asynchronous, so that the steps of di�erent threads can be interleaved arbitrarily.This signi�cantly makes the task of designing correct concurrent data structures quite challenging.Furthermore, the issues of correctness and performance are closely tied to each other: algorithmicenhancements that seek to improve performance often make it more difficult to design and verify acorrect data structure implementation.Firstly, we considered the problem of graph coloring on static graphs. The basic motivation behindthis problem was to limit the number of threads being created at runtime (irrespective of the sizeof the graph to be colored). We explored four different approaches: (1) barrier synchronization; (2)jones plassman; (3) locking variants and (4) using transactions. The barrier synchronization andJones Plassman Algorithm do not fare well and are not comparable to the sequential coloring. Onthe other hand, locks and transactions seem to perform fairly well in terms of time taken for coloringmaintaining a reasonable number of colors used. We also present ideas to cut long waiting chainsformed by locks.Concurrent data structures or CDS such as concurrent stacks, queues, lists etc. have become verypopular in the past few years due to the rise of multi-core systems and due to their performancebenefits over their sequential counterparts. But one of the greatest challenges with CDSs is developingcorrect structures and then proving their correctness either through automatic verification orthrough hand-written proofs [1]. Considering the complexity of developing a CDS and verifying itscorrectness, we address the most basic problem of this domain in this chapter: given the set of LPsof a CDS, how to show its correctness? We have developed a hand-crafted technique of provingcorrectness of the CDSs by validating it LPs which is inspired by rely-guarantee approach [2, 3].Our technique can be applied to prove the correctness of several commonly used CDSs developed inliterature such as Lock-free Linked based Sets [4], hoh-locking-list [5, 6], lazy-list [6, 7], Skiplists [8],etc.Graph is a common data-structure that is being used in various fields where they are very large anddynamic in nature. Dynamic graphs are the one's which are subjected to a sequence of changeslike insertion, deletion of vertices and/or edges [9]. We have been specifically motivated by theproblem of Serialization Graph Testing (SGT) scheduler [10] from Databases and TransactionalMemory [11]. The SGT scheduler maintains the property that conict graph always remains acyclicto ensure correctness. The traditional solution employed by SGT in Databases & STMs to maintaindynamic graphs is to use a single coarse lock to protect the entire graph. We propose a solutionfor this problem by developing a concurrent directed graph data-structure which allows threads toconcurrently add/delete/contains on vertices/edges while ensuring linearizability. Furthermore, wealso provide a linearizable solution for SGT i.e. (1) identifying all conicting & real-time edges, (2)adding all those edges while ensuring acyclicity. Both these occur atomically while ensuring thatthe history generated satisfies strict-serializability." @default.
• W2782155280 created "2018-01-12" @default.
• W2782155280 creator A5004856023 @default.
• W2782155280 creator A5054571968 @default.
• W2782155280 date "2017-01-01" @default.
• W2782155280 modified "2023-09-27" @default.
• W2782155280 title "Exploiting Concurrency in Graph algorithms" @default.
• W2782155280 hasPublicationYear "2017" @default.
• W2782155280 type Work @default.
• W2782155280 sameAs 2782155280 @default.
• W2782155280 citedByCount "0" @default.
• W2782155280 crossrefType "dissertation" @default.
• W2782155280 hasAuthorship W2782155280A5004856023 @default.
• W2782155280 hasAuthorship W2782155280A5054571968 @default.
• W2782155280 hasConcept C11413529 @default.
• W2782155280 hasConcept C120314980 @default.
• W2782155280 hasConcept C132525143 @default.
• W2782155280 hasConcept C138101251 @default.
• W2782155280 hasConcept C151319957 @default.
• W2782155280 hasConcept C160403385 @default.
• W2782155280 hasConcept C162324750 @default.
• W2782155280 hasConcept C173608175 @default.
• W2782155280 hasConcept C193702766 @default.
• W2782155280 hasConcept C199360897 @default.
• W2782155280 hasConcept C203222032 @default.
• W2782155280 hasConcept C206729178 @default.
• W2782155280 hasConcept C21547014 @default.
• W2782155280 hasConcept C31258907 @default.
• W2782155280 hasConcept C41008148 @default.
• W2782155280 hasConcept C55439883 @default.
• W2782155280 hasConcept C56348326 @default.
• W2782155280 hasConcept C76946457 @default.
• W2782155280 hasConcept C80444323 @default.
• W2782155280 hasConceptScore W2782155280C11413529 @default.
• W2782155280 hasConceptScore W2782155280C120314980 @default.
• W2782155280 hasConceptScore W2782155280C132525143 @default.
• W2782155280 hasConceptScore W2782155280C138101251 @default.
• W2782155280 hasConceptScore W2782155280C151319957 @default.
• W2782155280 hasConceptScore W2782155280C160403385 @default.
• W2782155280 hasConceptScore W2782155280C162324750 @default.
• W2782155280 hasConceptScore W2782155280C173608175 @default.
• W2782155280 hasConceptScore W2782155280C193702766 @default.
• W2782155280 hasConceptScore W2782155280C199360897 @default.
• W2782155280 hasConceptScore W2782155280C203222032 @default.
• W2782155280 hasConceptScore W2782155280C206729178 @default.
• W2782155280 hasConceptScore W2782155280C21547014 @default.
• W2782155280 hasConceptScore W2782155280C31258907 @default.
• W2782155280 hasConceptScore W2782155280C41008148 @default.
• W2782155280 hasConceptScore W2782155280C55439883 @default.
• W2782155280 hasConceptScore W2782155280C56348326 @default.
• W2782155280 hasConceptScore W2782155280C76946457 @default.
• W2782155280 hasConceptScore W2782155280C80444323 @default.
• W2782155280 hasLocation W27821552801 @default.
• W2782155280 hasOpenAccess W2782155280 @default.
• W2782155280 hasPrimaryLocation W27821552801 @default.
• W2782155280 hasRelatedWork W1509811574 @default.
• W2782155280 hasRelatedWork W1589338698 @default.
• W2782155280 hasRelatedWork W1593164383 @default.
• W2782155280 hasRelatedWork W2037603313 @default.
• W2782155280 hasRelatedWork W2114661031 @default.
• W2782155280 hasRelatedWork W2155419214 @default.
• W2782155280 hasRelatedWork W2174306348 @default.
• W2782155280 hasRelatedWork W2237920773 @default.
• W2782155280 hasRelatedWork W2274732609 @default.
• W2782155280 hasRelatedWork W2401048407 @default.
• W2782155280 hasRelatedWork W2405736458 @default.
• W2782155280 hasRelatedWork W2738757008 @default.
• W2782155280 hasRelatedWork W2773629481 @default.
• W2782155280 hasRelatedWork W2776556322 @default.
• W2782155280 hasRelatedWork W2776844453 @default.
• W2782155280 hasRelatedWork W27825682 @default.
• W2782155280 hasRelatedWork W2963146589 @default.
• W2782155280 hasRelatedWork W3092639686 @default.
• W2782155280 hasRelatedWork W3197952234 @default.
• W2782155280 hasRelatedWork W90337718 @default.
• W2782155280 isParatext "false" @default.
• W2782155280 isRetracted "false" @default.
• W2782155280 magId "2782155280" @default.
• W2782155280 workType "dissertation" @default.