Automatic parallelization of canonical loops
نویسندگان
چکیده
منابع مشابه
Automatic parallelization of canonical loops
This paper presents a compilation technique that performs automatic parallelization of canonical loops. Canonical loops are a pattern observed in many well known algorithms, such as frequent itemsets, K-means and K nearest neighbors. Automatic parallelization allows application developers to focus on the algorithmic details of the problem they are solving, leaving for the compiler the task of g...
متن کاملGeneration of Synchronous Code for Automatic Parallelization of while Loops
Automatic parallelization of imperative programs has focused on nests of do loops with aane bounds and aane dependences, because in this case execution domains and dependences are precisely known at compile-time. Parallelization can then be done using a suitable space-time transformation , yielding a logically synchronous program. Code generation consists of scanning the transformed execution d...
متن کاملSoftware Pipeliner: Parallelization of Loops
Software pipelining, as an important parallel technique for loop structure, exploits the parallelism present among the iterations of a loop by overlapping the execution of successive iterations. This paper presents a practical and usable algorithm, Overlapping Modulo Scheduling(OMS), which is capable of modulo scheduling loops subjected to recurrence dependences and resource constraints for rea...
متن کاملRun-Time Parallelization for Loops
Current parallelizing compilers cannot extract a significant fraction of the available parallelism in a loop if it has a complex and/or statically insuficiently defined access pattern. In this paper, a run-time technique based on insp/exec scheme (inspector phase and executor phase) is proposed for finding parallelism on loops. Our inspector can determine the wavefronts of a loop with any compl...
متن کاملSpeculative Parallelization of Partially Parallel Loops
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. We have previously proposed a framework for their identification. We speculatively executed a loop as a doall, and applied a fully parallel data dependence test to determine if it had any cross–processor dependences; if th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2013
ISSN: 0167-6423
DOI: 10.1016/j.scico.2012.09.006