182 search results - page 16 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
IWOMP
2007
Springer
15 years 3 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
ICPP
2002
IEEE
15 years 2 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
FCCM
2002
IEEE
15 years 2 months ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
ISLPED
1995
ACM
15 years 1 months ago
1995
ACM
ABSTRACT { Sub-micron technologies and the increasing size and complexity of integrated components have aggravated the e ect of long interconnects and buses, compared to that of ga...