Sciweavers

879 search results - page 106 / 176
» Designing Closer to the Edge
Sort
View
JSSPP
2001
Springer
14 years 1 months ago
Core Algorithms of the Maui Scheduler
The Maui scheduler has received wide acceptance in the HPC community as a highly configurable and effective batch scheduler. It is currently in use on hundreds of SP, O2K, and Li...
David B. Jackson, Quinn Snell, Mark J. Clement
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
14 years 1 months ago
Visual Semantics - Or: What You See is What You Compute
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
Martin Erwig
SOFSEM
1997
Springer
14 years 1 months ago
Path Layout in ATM Networks
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
Shmuel Zaks
DAC
1993
ACM
14 years 1 months ago
Rotation Scheduling: A Loop Pipelining Algorithm
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Me...
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 1 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale