Assessing Run-time Overhead of Securing Kepler
نویسندگان
چکیده
منابع مشابه
Run-Time Minimization of Reconfiguration Overhead in Dynamically Reconfigurable Systems
Dynamically Reconfigurable Hardware (DRHW) can take advantage of its reconfiguration capability to adapt at run-time its performance and its energy consumption. However, due to the lack of programming support for dynamic task placement on these platforms, little previous work has been presented studying these run-time performance/power trade-offs. To cope with the task placement problem we have...
متن کاملTechniques for Reducing the Overhead of Run-Time Parallelization
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we have introduced a novel framework for their identification: speculative parallelization. While we have previously shown that this method is inherently scalable its p...
متن کاملExploiting Term Hiding to Reduce Run-Time Checking Overhead
One of the most attractive features of untyped languages is the flexibility in term creation and manipulation. However, with such power comes the responsibility of ensuring the correctness of these operations. A solution is adding run-time checks to the program via assertions, but this can introduce overheads that are in many cases impractical. While static analysis can greatly reduce such over...
متن کاملVisual Behavior: Mice Run from Overhead Danger
Mice show an innate protective behavior to looming shadows approaching from above: they either run for cover or freeze in place. This newly discovered 'looming response' adds to the repertoire of stereotyped behaviors that can be utilized to study visual pathways.
متن کاملRun Time Compile Time Compile − time Specialization Run − time
Because of its wide applicability, many eecient implementations of the Fast Fourier Transform have been developed. We propose that an eecient implementation can be produced automatically and reliably by partial evaluation. Partial evaluation of an unoptimized implementation produces a speedup of over 9 times. The automatically generated result of partial evaluation has performance comparable to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.05.412