4889 search results - page 366 / 978 » A Refactoring Approach to Parallelism |
133
click to vote
JSSPP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The commercial exploitation of the emerging Grid and Cloud markets needs SLAs to sell computing run times. Job traces show that users have a limited ability to estimate t...
169
click to vote
CMA
2011
14 years 12 months ago
2011
We propose a new approach, based on the Conley index theory, for the detection and classification of critical regions in multidimensional data sets. The use of homology groups ma...
145
click to vote
IEEEPACT
1998
IEEE
15 years 9 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
143
click to vote
SPAA
1997
ACM
15 years 9 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
201
click to vote
FCCM
2011
IEEE
14 years 8 months ago
2011
IEEE
— This paper describes an architecture and FPGA synthesis toolchain for building specialized, energy-saving coprocessors called Irregular Code Energy Reducers (ICERs) for a wide ...