Sciweavers

64 search results - page 8 / 13
» Sequential and dynamic frameproof codes
Sort
View
EUROPAR
2010
Springer
14 years 10 months ago
Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
Jonathan Mak, Karl-Filip Faxén, Sverker Jan...
IJPP
2006
82views more  IJPP 2006»
14 years 9 months ago
Supporting Microthread Scheduling and Synchronisation in CMPs
Chip multiprocessors hold great promise for achieving scalability in future systems. Microthreaded chip multiprocessors add a means of exploiting legacy code in such systems. Usin...
Ian Bell, Nabil Hasasneh, Chris R. Jesshope
87
Voted
ICS
2001
Tsinghua U.
15 years 2 months ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
60
Voted
IFIP
1994
Springer
15 years 1 months ago
Program Speedups in Theory and Practice
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
Neil D. Jones
HPCA
2011
IEEE
14 years 1 months ago
Dynamic parallelization of JavaScript applications using an ultra-lightweight speculation mechanism
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
Mojtaba Mehrara, Po-Chun Hsu, Mehrzad Samadi, Scot...