Sciweavers

4797 search results - page 93 / 960
» The complexity of partition tasks
Sort
View
TJS
2008
78views more  TJS 2008»
13 years 8 months ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
TC
1998
13 years 8 months ago
Analysis of Checkpointing Schemes with Task Duplication
—This paper suggests a technique for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execut...
Avi Ziv, Jehoshua Bruck
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
14 years 10 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert
TKDE
2002
148views more  TKDE 2002»
13 years 8 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
PPSN
2004
Springer
14 years 2 months ago
Evaluation of Adaptive Nature Inspired Task Allocation Against Alternate Decentralised Multiagent Strategies
Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...
Richard Price, Peter Tiño