Sciweavers

697 search results - page 42 / 140
» Strategies to Parallelize ILP Systems
Sort
View
PLDI
2012
ACM
13 years 1 months ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...
GEM
2008
15 years 16 days ago
Evaluating a Parallel Evolutionary Algorithm on the Chess Endgame Problem
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ide...
Wayne Iba, Kelsey Marshman, Benjamin Fisk
PC
1998
153views Management» more  PC 1998»
14 years 10 months ago
Compilation Techniques for Out-of-Core Parallel Computations
The difficulty of handling out-of-core data limits the performance of supercomputers as well as the potential of the parallel machines. Since writing an efficient out-of-core ve...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
IPPS
1999
IEEE
15 years 3 months ago
On the Design and Evaluation of Job Scheduling Algorithms
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...
Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyap...
APPT
2005
Springer
15 years 4 months ago
Static Partitioning vs Dynamic Sharing of Resources in Simultaneous MultiThreading Microarchitectures
Simultaneous MultiThreading (SMT) achieves better system resource utilization and higher performance because it exploits ThreadLevel Parallelism (TLP) in addition to “conventiona...
Chen Liu, Jean-Luc Gaudiot