Sciweavers

IPPS
1999
IEEE
14 years 2 days ago
Dynamic Interval Routing on Asynchronous Rings
Danny Krizanc, Flaminia L. Luccio, Rajeev Raman
IPPS
1999
IEEE
14 years 2 days ago
On the Design and Evaluation of Job Scheduling Algorithms
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...
Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyap...
IPPS
1999
IEEE
14 years 2 days ago
Lazy Logging and Prefetch-Based Crash Recovery in Software Distributed Shared Memory Systems
In this paper, we propose a new, efficient logging protocol, called lazy logging, and a fast crash recovery protocol, called the prefetch-based crash recovery (PCR), for software ...
Angkul Kongmunvattana, Nian-Feng Tzeng
IPPS
1999
IEEE
14 years 2 days ago
Hardwired-Clusters Partial-Crossbar: A Hierarchical Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
IPPS
1999
IEEE
14 years 2 days ago
The Biological Basis of the Immune System as a Model for Intelligent Agents
This paper describes the human immune system and its functionalities from a computational viewpoint. The objective of this paper is to provide the biological basis for an artificia...
Roger L. King, Aric B. Lambert, Samuel H. Russ, Do...
IPPS
1999
IEEE
14 years 2 days ago
Coscheduling through Synchronized Scheduling Servers - A Prototype and Experiments
Predictable network computing still involves a number of open questions. One such question is providing a controlled amount of CPU time to distributed processes. Mechanisms to cont...
Holger Karl
IPPS
1999
IEEE
14 years 2 days ago
Fully-Scalable Fault-Tolerant Simulations for BSP and CGM
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The faults are deterministic (i...
Sung-Ryul Kim, Kunsoo Park
IPPS
1999
IEEE
14 years 2 days ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
IPPS
1999
IEEE
14 years 2 days ago
A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing Systems
The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth r...
JunSeong Kim, David J. Lilja
IPPS
1999
IEEE
14 years 2 days ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Keiichi Kaneko, Hideo Ito