28888 search results - page 202 / 5778 » Computability and complexity in analysis |
COMPSAC
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
ICPADS
2002
IEEE
14 years 1 months ago
2002
IEEE
Efficient determination of processing termination at barrier synchronization points can occupy an important role in the overall throughput of parallel and distributed computing sy...
ISPDC
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
CCGRID
2007
IEEE
14 years 2 months ago
2007
IEEE
The number of processors embedded on high performance computing platforms is continuously increasing to accommodate user desire to solve larger and more complex problems. However,...
FOCS
1997
IEEE
14 years 16 days ago
1997
IEEE
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...