Sciweavers

IPPS
2000
IEEE
13 years 8 months ago
Effective Load Sharing on Heterogeneous Networks of Workstations
We consider networks of workstations which are not only timesharing, but also heterogeneous with a large variation in the computing power and memory capacities of different workst...
Li Xiao, Xiaodong Zhang, Yanxia Qu
IPPS
2000
IEEE
13 years 8 months ago
Memory Management in a Combined VIA/SCI Hardware
Abstract In this document we make a brief review of memory management and DMA considerations in case of common SCI hardware and the Virtual Interface Architecture. On this basis we...
Mario Trams, Wolfgang Rehm, Daniel Balkanski, Stan...
IPPS
2000
IEEE
13 years 8 months ago
Monotonic Counters: A New Mechanism for Thread Synchronization
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
John Thornley, K. Mani Chandy
IPPS
2000
IEEE
13 years 8 months ago
Thread Migration and Load Balancing in Non-Dedicated Environments
Networks of workstations are fast becoming the standard environment for parallel applications. However, the use of “found” resources as a platform for tightly-coupled runtime ...
Kritchalach Thitikamol, Peter J. Keleher
IPPS
2000
IEEE
13 years 8 months ago
MAJC-5200: A High Performance Microprocessor for Multimedia Computing
The newly introduced Microprocessor Architecture for Java Computing MAJC supports parallelism in a hierarchy of levels: multiprocessors on chip,vertical micro threading, instruct...
Subramania Sudharsanan
IPPS
2000
IEEE
13 years 8 months ago
Study of a Multilevel Approach to Partitioning for Parallel Logic Simulation
Parallel simulation techniques are often employed to meet the computational requirements of large hardware simulations in order to reduce simulation time. In addition, partitionin...
Swaminathan Subramanian, Dhananjai Madhava Rao, Ph...
IPPS
2000
IEEE
13 years 8 months ago
Optimization of Motion Estimator for Run-Time-Reconfiguration Implementation
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
Camel Tanougast, Yves Berviller, Serge Weber