Sciweavers

6138 search results - page 268 / 1228
» High performance computing through parallel processing
Sort
View
HOTI
2005
IEEE
15 years 9 months ago
Addressing Queuing Bottlenecks at High Speeds
Modern routers and switch fabrics can have hundreds of input and output ports running at up to 10 Gb/s; 40 Gb/s systems are starting to appear. At these rates, the performance of ...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley
112
Voted
PVM
2001
Springer
15 years 8 months ago
Dynamic Process Management in KSIX Cluster Middleware
Dynamic process management is a much-needed feature for applications and tools development in Beowulf cluster environment. A welldefined and efficient dynamic process management in...
Thara Angskun, Putchong Uthayopas, Arnon Rungsawan...
IPPS
2006
IEEE
15 years 10 months ago
Modelling job allocation where service duration is unknown
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
Nigel Thomas
EGH
2009
Springer
15 years 1 months ago
Efficient stream compaction on wide SIMD many-core architectures
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
Markus Billeter, Ola Olsson, Ulf Assarsson
135
Voted
ICS
1997
Tsinghua U.
15 years 8 months ago
Eliminating Cache Conflict Misses through XOR-Based Placement Functions
This paper makes the case for the use of XOR-based placement functions for cache memories. It shows that these XOR-mapping schemes can eliminate many conflict misses for direct-ma...
Antonio González, Mateo Valero, Nigel P. To...