Sciweavers

2177 search results - page 350 / 436
» Relative Margin Machines
Sort
View
JSSPP
1997
Springer
14 years 1 months ago
Memory Usage in the LANL CM-5 Workload
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
Dror G. Feitelson
TAPSOFT
1997
Springer
14 years 1 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
IPPS
1994
IEEE
14 years 1 months ago
Shared Virtual Memory and Generalized Speedup
Generalized speedup is de ned as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as trad...
Xian-He Sun, Jianping Zhu
STACS
1994
Springer
14 years 29 days ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
VLDB
1994
ACM
137views Database» more  VLDB 1994»
14 years 29 days ago
Performance of Data-Parallel Spatial Operations
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
Erik G. Hoel, Hanan Samet