Sciweavers

3844 search results - page 655 / 769
» Distributed Meeting Scheduling
Sort
View
IPPS
1998
IEEE
14 years 1 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
14 years 1 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
HPCN
1997
Springer
14 years 1 months ago
Ninf: A Network Based Information Library for Global World-Wide Computing Infrastructure
Ninf is an ongoing global network-wide computing infrastructure project which allows users to access computational resources including hardware, software and scientific data distri...
Mitsuhisa Sato, Hidemoto Nakada, Satoshi Sekiguchi...
ICDCS
1995
IEEE
14 years 1 months ago
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach
One of the mostsoughtaftersoftware innovation of thisdecade is the construction of systems using off-the-shelf workstations that actually deliver, and even surpass, the power and ...
Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin
ICS
1995
Tsinghua U.
14 years 1 months ago
On the Utility of Threads for Data Parallel Programming
Threads provide a useful programming model for asynchronous behavior because of their ability to encapsulate units of work that can then be scheduled for execution at runtime, bas...
Thomas Fahringer, Matthew Haines, Piyush Mehrotra