FRINK Linked Data Fragments server

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

• W2023128081 abstract "Chip multiprocessors (CMPs), or multi-core processors, have become a common way of reducing chip complexity and power consumption while maintaining high performance. Speculative CMPs use hardware to enforce dependence, allowing a parallelizing compiler to generate multithreaded code without needing to prove independence. In these systems, a sequential program is decomposed into threads to be executed in parallel; dependent threads cause performance degradation, but do not affect correctness. Thread decomposition attempts to reduce the run-time overheads of data dependence, thread misprediction, and load imbalance. Because these overheads depend on the runtimes of the threads that are being created by the decomposition, reducing the overheads while creating the threads is a circular problem. Static compile-time decomposition handles this problem by estimating the run times of the candidate threads, but is limited by the estimates' inaccuracy. Dynamic execution-time decomposition in hardware has better run-time information, but is limited by the decomposition hardware's complexity and run-time overhead. We propose a third approach where a compiler instruments a profile run of the application to search through candidate threads and pick the best threads as the profile run executes. The resultant decomposition is compiled into the application so that a production run of the application has no instrumentation and does not incurany decomposition overhead. We avoid static decomposition's estimation accuracy problem by using actual profile-run execution times to pick threads, and we avoid dynamic decomposition's overhead by performing the decomposition at profile time. Because we allow candidate threads to span arbitrary sections of the application's call graph and loop nests, an exhaustive search of the decomposition space is prohibitive, even in profile runs. To address this issue, we make the key observation that the run-time overhead of a thread depends, to the first order, only on threads that overlap with the thread inexecution (e.g., in a four-core CMP, a given thread can overlap with at most three preceding and three following threads). This observation implies that a given thread affects only a few other threads, allowing pruning of the space. Using a CMP simulator, we achieve an average speedup of 3.51 on four cores for five of the SPEC CFP2000 benchmarks, which compares favorably to recent static techniques. We also discuss experiments with CINT2000." @default.
• W2023128081 created "2016-06-24" @default.
• W2023128081 creator A5045622261 @default.
• W2023128081 creator A5069759195 @default.
• W2023128081 creator A5086816733 @default.
• W2023128081 date "2007-03-14" @default.
• W2023128081 modified "2023-10-17" @default.
• W2023128081 title "Speculative thread decomposition through empirical optimization" @default.
• W2023128081 cites W1974831646 @default.
• W2023128081 cites W1986926028 @default.
• W2023128081 cites W2010220656 @default.
• W2023128081 cites W2024547254 @default.
• W2023128081 cites W2040466547 @default.
• W2023128081 cites W2044280736 @default.
• W2023128081 cites W2047301304 @default.
• W2023128081 cites W2078429521 @default.
• W2023128081 cites W2083868341 @default.
• W2023128081 cites W2106018697 @default.
• W2023128081 cites W2110652915 @default.
• W2023128081 cites W2111678563 @default.
• W2023128081 cites W2116210226 @default.
• W2023128081 cites W2119786518 @default.
• W2023128081 cites W2120518487 @default.
• W2023128081 cites W2122545654 @default.
• W2023128081 cites W2125340270 @default.
• W2023128081 cites W2131867938 @default.
• W2023128081 cites W2135992106 @default.
• W2023128081 cites W2136798749 @default.
• W2023128081 cites W2148339733 @default.
• W2023128081 cites W2150547581 @default.
• W2023128081 cites W2296006986 @default.
• W2023128081 cites W4229591902 @default.
• W2023128081 doi "https://doi.org/10.1145/1229428.1229474" @default.
• W2023128081 hasPublicationYear "2007" @default.
• W2023128081 type Work @default.
• W2023128081 sameAs 2023128081 @default.
• W2023128081 citedByCount "67" @default.
• W2023128081 countsByYear W20231280812012 @default.
• W2023128081 countsByYear W20231280812013 @default.
• W2023128081 countsByYear W20231280812014 @default.
• W2023128081 countsByYear W20231280812015 @default.
• W2023128081 countsByYear W20231280812016 @default.
• W2023128081 countsByYear W20231280812017 @default.
• W2023128081 countsByYear W20231280812018 @default.
• W2023128081 countsByYear W20231280812019 @default.
• W2023128081 countsByYear W20231280812022 @default.
• W2023128081 crossrefType "proceedings-article" @default.
• W2023128081 hasAuthorship W2023128081A5045622261 @default.
• W2023128081 hasAuthorship W2023128081A5069759195 @default.
• W2023128081 hasAuthorship W2023128081A5086816733 @default.
• W2023128081 hasConcept C111919701 @default.
• W2023128081 hasConcept C124681953 @default.
• W2023128081 hasConcept C138101251 @default.
• W2023128081 hasConcept C149635348 @default.
• W2023128081 hasConcept C169590947 @default.
• W2023128081 hasConcept C173608175 @default.
• W2023128081 hasConcept C18903297 @default.
• W2023128081 hasConcept C190902152 @default.
• W2023128081 hasConcept C199360897 @default.
• W2023128081 hasConcept C2779960059 @default.
• W2023128081 hasConcept C41008148 @default.
• W2023128081 hasConcept C55439883 @default.
• W2023128081 hasConcept C86803240 @default.
• W2023128081 hasConceptScore W2023128081C111919701 @default.
• W2023128081 hasConceptScore W2023128081C124681953 @default.
• W2023128081 hasConceptScore W2023128081C138101251 @default.
• W2023128081 hasConceptScore W2023128081C149635348 @default.
• W2023128081 hasConceptScore W2023128081C169590947 @default.
• W2023128081 hasConceptScore W2023128081C173608175 @default.
• W2023128081 hasConceptScore W2023128081C18903297 @default.
• W2023128081 hasConceptScore W2023128081C190902152 @default.
• W2023128081 hasConceptScore W2023128081C199360897 @default.
• W2023128081 hasConceptScore W2023128081C2779960059 @default.
• W2023128081 hasConceptScore W2023128081C41008148 @default.
• W2023128081 hasConceptScore W2023128081C55439883 @default.
• W2023128081 hasConceptScore W2023128081C86803240 @default.
• W2023128081 hasLocation W20231280811 @default.
• W2023128081 hasOpenAccess W2023128081 @default.
• W2023128081 hasPrimaryLocation W20231280811 @default.
• W2023128081 hasRelatedWork W1541585229 @default.
• W2023128081 hasRelatedWork W1583465708 @default.
• W2023128081 hasRelatedWork W1601646354 @default.
• W2023128081 hasRelatedWork W1606851719 @default.
• W2023128081 hasRelatedWork W1853049011 @default.
• W2023128081 hasRelatedWork W2078700326 @default.
• W2023128081 hasRelatedWork W2150593430 @default.
• W2023128081 hasRelatedWork W2158819012 @default.
• W2023128081 hasRelatedWork W1602178951 @default.
• W2023128081 hasRelatedWork W2479014312 @default.
• W2023128081 isParatext "false" @default.
• W2023128081 isRetracted "false" @default.
• W2023128081 magId "2023128081" @default.
• W2023128081 workType "article" @default.