Sciweavers

PPL
2008
264views more  PPL 2008»
13 years 4 months ago
A Performance Evaluation of the Nehalem Quad-Core Processor for Scientific Computing
In this work we present an initial performance evaluation of Intel's latest, secondgeneration quad-core processor, Nehalem, and provide a comparison to first-generation AMD a...
Kevin J. Barker, Kei Davis, Adolfy Hoisie, Darren ...
PPL
2008
117views more  PPL 2008»
13 years 4 months ago
Operating Systems in silicon and the Dynamic Management of Resources in Many-Core Chips
This discussion paper explores the problems of operating systems support when implementing concurrency controls at the level of the instruction set in processors designed for mult...
Chris R. Jesshope
IJPP
2006
145views more  IJPP 2006»
13 years 4 months ago
Deterministic Parallel Processing
Abstract. In order to address the problems faced in the wireless communications domain, picoChip has devised the picoArrayTM . The picoArrayTM is a tiled-processor architecture, co...
Gajinder Panesar, Daniel Towner, Andrew Duller, Al...
JACM
2008
90views more  JACM 2008»
13 years 4 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 4 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
CAL
2006
13 years 4 months ago
A case for fault tolerance and performance enhancement using chip multi-processors
This paper makes a case for using multi-core processors to simultaneously achieve transient-fault tolerance and performance enhancement. Our approach is extended from a recent late...
Huiyang Zhou
EUROPAR
2010
Springer
13 years 4 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
HPDC
2010
IEEE
13 years 4 months ago
A GPU accelerated storage system
Massively multicore processors, like, for example, Graphics Processing Units (GPUs), provide, at a comparable price, a one order of magnitude higher peak performance than traditio...
Abdullah Gharaibeh, Samer Al-Kiswany, Sathish Gopa...
SODA
2004
ACM
96views Algorithms» more  SODA 2004»
13 years 6 months ago
Non-migratory online deadline scheduling on multiprocessors
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
Ho-Leung Chan, Tak Wah Lam, Kar-Keung To
APPINF
2003
13 years 6 months ago
Comparing the Optimal Performance of Multiprocessor Architectures
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
Lars Lundberg, Kamilla Klonowska, Magnus Broberg, ...