Sciweavers

500 search results - page 74 / 100
» Process Scheduling for the Parallel Desktop
Sort
View
HIPC
2009
Springer
13 years 6 months ago
Optimizing the use of GPU memory in applications with large data sets
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
Nadathur Satish, Narayanan Sundaram, Kurt Keutzer
EUROPAR
2006
Springer
14 years 19 days ago
Master-Slave Tasking on Asymmetric Networks
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of inde...
Cyril Banino-Rokkones, Olivier Beaumont, Lasse Nat...
ICFP
2010
ACM
13 years 10 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
SNPD
2008
13 years 10 months ago
Tools and Techniques for Model Checking Networked Programs
For software executing several threads in parallel, testing is unreliable, as it cannot cover all thread schedules. Model checking, however, can cover all possible thread interlea...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
BMCBI
2011
13 years 17 days ago
A user-friendly web portal for T-Coffee on supercomputers
Background: Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is t...
Josep Rius Torrento, Fernando Cores, Francesc Sols...