FRINK Linked Data Fragments server

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

• W1569450356 abstract "Recent trends have led hardware manufacturers to place multiple processing cores on a single chip, making parallel programming the intended way of taking advantage of the increased processing power. However, bringing concurrency to average programmers is considered to be one of the major challenges in computer science today. The difficulty lies not only in writing correct parallel programs, but also in achieving the required efficiency and performance. For parallel programs, performance is not only about obtaining low execution times on a fixed number of cores, but also about maintaining efficiency as the number of available cores is increased. Ideally, programmers should have in their toolkit techniques that can be used when designing parallel programs, before any code is available for testing on production hardware, and which are then able to predict scalability once the program is implemented. Existing methods are either unreliable at predicting scalability, such as the case of disjoint-access parallelism, or do not apply to lock-based programs, which currently make up a large part of existing concurrent programs. Furthermore, using some of these techniques is so complicated that it outweighs the time required to implement, debug and test the program on real hardware. In this thesis we study the problem of predicting the scalability of concurrent programs without implementing them. This allows programmers in the design phase of a concurrent algorithm to choose only one or a few promising solutions that will be implemented, debugged and tested on production hardware. We first consider disjoint-access parallelism, an existing property that applies only to a very restricted class of programs. After an extensive practical evaluation spanning across a variety of scenarios, we find it to be ineffective at predicting scalability. For predicting the scalability of more general concurrent algorithms, we propose the obstruction degree, a new scalability metric based on the consistency requirements of algorithms. It applies to programs using locks, invalidation primitives and transactional memory. Our metric allows programmers to compare two given algorithms as well as predict their scalability limit, the maximum number of processors to which they can scale, thus allowing programmers to choose the appropriate size hardware for running their programs. We also examine the composition of relaxed memory transactions in order to combine the ease of programming offered by transactional memory with the increased scalability of transactions that circumvent the traditional transactional model. We present outheritance, a property we show to be both necessary and sufficient for ensuring the correct composition of relaxed transactions, and we show how to calculate the obstruction degree of compositions that use this new property. We use outheritance to build OE-STM, a new software transactional memory algorithm having elastic transactions that correctly compose." @default.
• W1569450356 created "2016-06-24" @default.
• W1569450356 creator A5030694946 @default.
• W1569450356 date "2014-01-01" @default.
• W1569450356 modified "2023-10-18" @default.
• W1569450356 title "Inferring Scalability from Program Pseudocode" @default.
• W1569450356 doi "https://doi.org/10.5075/epfl-thesis-6219" @default.
• W1569450356 hasPublicationYear "2014" @default.
• W1569450356 type Work @default.
• W1569450356 sameAs 1569450356 @default.
• W1569450356 citedByCount "0" @default.
• W1569450356 crossrefType "journal-article" @default.
• W1569450356 hasAuthorship W1569450356A5030694946 @default.
• W1569450356 hasConcept C111919701 @default.
• W1569450356 hasConcept C114614502 @default.
• W1569450356 hasConcept C118524514 @default.
• W1569450356 hasConcept C120314980 @default.
• W1569450356 hasConcept C150495011 @default.
• W1569450356 hasConcept C168065819 @default.
• W1569450356 hasConcept C173608175 @default.
• W1569450356 hasConcept C193702766 @default.
• W1569450356 hasConcept C199360897 @default.
• W1569450356 hasConcept C2781172179 @default.
• W1569450356 hasConcept C33923547 @default.
• W1569450356 hasConcept C41008148 @default.
• W1569450356 hasConcept C45340560 @default.
• W1569450356 hasConcept C48044578 @default.
• W1569450356 hasConcept C78766204 @default.
• W1569450356 hasConceptScore W1569450356C111919701 @default.
• W1569450356 hasConceptScore W1569450356C114614502 @default.
• W1569450356 hasConceptScore W1569450356C118524514 @default.
• W1569450356 hasConceptScore W1569450356C120314980 @default.
• W1569450356 hasConceptScore W1569450356C150495011 @default.
• W1569450356 hasConceptScore W1569450356C168065819 @default.
• W1569450356 hasConceptScore W1569450356C173608175 @default.
• W1569450356 hasConceptScore W1569450356C193702766 @default.
• W1569450356 hasConceptScore W1569450356C199360897 @default.
• W1569450356 hasConceptScore W1569450356C2781172179 @default.
• W1569450356 hasConceptScore W1569450356C33923547 @default.
• W1569450356 hasConceptScore W1569450356C41008148 @default.
• W1569450356 hasConceptScore W1569450356C45340560 @default.
• W1569450356 hasConceptScore W1569450356C48044578 @default.
• W1569450356 hasConceptScore W1569450356C78766204 @default.
• W1569450356 hasLocation W15694503561 @default.
• W1569450356 hasOpenAccess W1569450356 @default.
• W1569450356 hasPrimaryLocation W15694503561 @default.
• W1569450356 hasRelatedWork W1485039093 @default.
• W1569450356 hasRelatedWork W165190630 @default.
• W1569450356 hasRelatedWork W173542683 @default.
• W1569450356 hasRelatedWork W1857467995 @default.
• W1569450356 hasRelatedWork W1867865751 @default.
• W1569450356 hasRelatedWork W1999228907 @default.
• W1569450356 hasRelatedWork W2019994676 @default.
• W1569450356 hasRelatedWork W2064218620 @default.
• W1569450356 hasRelatedWork W2173810592 @default.
• W1569450356 hasRelatedWork W2245412218 @default.
• W1569450356 hasRelatedWork W2413014562 @default.
• W1569450356 hasRelatedWork W2468183093 @default.
• W1569450356 hasRelatedWork W2512132806 @default.
• W1569450356 hasRelatedWork W2760537745 @default.
• W1569450356 hasRelatedWork W2789380094 @default.
• W1569450356 hasRelatedWork W2890630702 @default.
• W1569450356 hasRelatedWork W3114438252 @default.
• W1569450356 hasRelatedWork W3128058472 @default.
• W1569450356 hasRelatedWork W838243904 @default.
• W1569450356 hasRelatedWork W899856837 @default.
• W1569450356 isParatext "false" @default.
• W1569450356 isRetracted "false" @default.
• W1569450356 magId "1569450356" @default.
• W1569450356 workType "article" @default.