Matches in SemOpenAlex for { <https://semopenalex.org/work/W1551731318> ?p ?o ?g. }
Showing items 1 to 86 of
86
with 100 items per page.
- W1551731318 endingPage "14" @default.
- W1551731318 startingPage "1" @default.
- W1551731318 abstract "Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the amount of parallelism can usually be expressed as a function of the problem size, so it is reasonably straightforward to determine how many processors should be allocated to execute a regular algorithm of a certain size (this is called the processor allocation problem). In contrast, parallelism in irregular algorithms can be a function of input parameters, and the amount of parallelism can vary dramatically during the execution of the irregular algorithm. Therefore, the processor allocation problem for irregular algorithms is very difficult. In this paper, we describe the first systematic strategy for addressing this problem. Our approach is based on a construct called the conflict graph, which (i) provides insight into the amount of parallelism that can be extracted from an irregular algorithm, and (ii) can be used to address the processor allocation problem for irregular algorithms. We show that this problem is related to a generalization of the unfriendly seating problem and, by extending Tur'an's theorem, we obtain a worst-case class of problems for optimistic parallelization, which we use to derive a lower bound on the exploitable parallelism. Finally, using some theoretically derived properties and some experimental facts, we design a quick and stable control strategy for solving the processor allocation problem heuristically." @default.
- W1551731318 created "2016-06-24" @default.
- W1551731318 creator A5010522931 @default.
- W1551731318 creator A5013181067 @default.
- W1551731318 date "2012-01-01" @default.
- W1551731318 modified "2023-09-27" @default.
- W1551731318 title "Processor Allocation for Optimistic Parallelization of Irregular Programs" @default.
- W1551731318 cites W1552092932 @default.
- W1551731318 cites W1561299197 @default.
- W1551731318 cites W1975850297 @default.
- W1551731318 cites W1976922833 @default.
- W1551731318 cites W2005575653 @default.
- W1551731318 cites W2048305092 @default.
- W1551731318 cites W2057512681 @default.
- W1551731318 cites W2097061393 @default.
- W1551731318 cites W2102182691 @default.
- W1551731318 cites W2106547329 @default.
- W1551731318 cites W2124861237 @default.
- W1551731318 cites W2136952590 @default.
- W1551731318 cites W2496163386 @default.
- W1551731318 cites W2912209775 @default.
- W1551731318 cites W2950654313 @default.
- W1551731318 cites W4231150350 @default.
- W1551731318 cites W4234858060 @default.
- W1551731318 cites W4236407101 @default.
- W1551731318 cites W4256158364 @default.
- W1551731318 doi "https://doi.org/10.1007/978-3-642-31125-3_1" @default.
- W1551731318 hasPublicationYear "2012" @default.
- W1551731318 type Work @default.
- W1551731318 sameAs 1551731318 @default.
- W1551731318 citedByCount "0" @default.
- W1551731318 crossrefType "book-chapter" @default.
- W1551731318 hasAuthorship W1551731318A5010522931 @default.
- W1551731318 hasAuthorship W1551731318A5013181067 @default.
- W1551731318 hasBestOaLocation W15517313182 @default.
- W1551731318 hasConcept C11413529 @default.
- W1551731318 hasConcept C121332964 @default.
- W1551731318 hasConcept C134306372 @default.
- W1551731318 hasConcept C164833996 @default.
- W1551731318 hasConcept C169590947 @default.
- W1551731318 hasConcept C17349429 @default.
- W1551731318 hasConcept C173608175 @default.
- W1551731318 hasConcept C177148314 @default.
- W1551731318 hasConcept C199360897 @default.
- W1551731318 hasConcept C2781172179 @default.
- W1551731318 hasConcept C33923547 @default.
- W1551731318 hasConcept C41008148 @default.
- W1551731318 hasConcept C42992933 @default.
- W1551731318 hasConcept C62520636 @default.
- W1551731318 hasConcept C84114770 @default.
- W1551731318 hasConceptScore W1551731318C11413529 @default.
- W1551731318 hasConceptScore W1551731318C121332964 @default.
- W1551731318 hasConceptScore W1551731318C134306372 @default.
- W1551731318 hasConceptScore W1551731318C164833996 @default.
- W1551731318 hasConceptScore W1551731318C169590947 @default.
- W1551731318 hasConceptScore W1551731318C17349429 @default.
- W1551731318 hasConceptScore W1551731318C173608175 @default.
- W1551731318 hasConceptScore W1551731318C177148314 @default.
- W1551731318 hasConceptScore W1551731318C199360897 @default.
- W1551731318 hasConceptScore W1551731318C2781172179 @default.
- W1551731318 hasConceptScore W1551731318C33923547 @default.
- W1551731318 hasConceptScore W1551731318C41008148 @default.
- W1551731318 hasConceptScore W1551731318C42992933 @default.
- W1551731318 hasConceptScore W1551731318C62520636 @default.
- W1551731318 hasConceptScore W1551731318C84114770 @default.
- W1551731318 hasLocation W15517313181 @default.
- W1551731318 hasLocation W15517313182 @default.
- W1551731318 hasLocation W15517313183 @default.
- W1551731318 hasOpenAccess W1551731318 @default.
- W1551731318 hasPrimaryLocation W15517313181 @default.
- W1551731318 hasRelatedWork W1516145173 @default.
- W1551731318 hasRelatedWork W1545342238 @default.
- W1551731318 hasRelatedWork W1577309527 @default.
- W1551731318 hasRelatedWork W1608806855 @default.
- W1551731318 hasRelatedWork W1850053445 @default.
- W1551731318 hasRelatedWork W1972912085 @default.
- W1551731318 hasRelatedWork W2047238167 @default.
- W1551731318 hasRelatedWork W2313503008 @default.
- W1551731318 hasRelatedWork W2378666660 @default.
- W1551731318 hasRelatedWork W99192079 @default.
- W1551731318 isParatext "false" @default.
- W1551731318 isRetracted "false" @default.
- W1551731318 magId "1551731318" @default.
- W1551731318 workType "book-chapter" @default.