700 search results - page 33 / 140 » A Proposal for Task Parallelism in OpenMP |
139
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
143
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
The earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (...
232
click to vote
ISCA
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
160
Voted
HPCC
2009
Springer
15 years 1 months ago
2009
Springer
Abstract--The Grid is an heterogeneous and dynamic environment which enables distributed computation. This makes it a technology prone to failures. Some related work uses replicati...
148
Voted
ISORC
2002
IEEE
15 years 8 months ago
2002
IEEE
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...