Sciweavers

1534 search results - page 14 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods
FSTTCS
1998
Springer
13 years 12 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
TPDS
1998
124views more  TPDS 1998»
13 years 7 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
EPEW
2006
Springer
13 years 11 months ago
A Precedence PEPA Model for Performance and Reliability Analysis
We propose new techniques to simplify the computation of the cycle times and the absorption times for a large class of PEPA models. These techniques allow us to simplify the model ...
Jean-Michel Fourneau, Leïla Kloul
STACS
1991
Springer
13 years 11 months ago
Optimal Parallel Recognition of Bracket Languages on Hypercubes
Bracket languages play an important role in the syntax analysis of programming languages. We investigate the parallel recognition and analysis of these languages as a first step ...
Gisela Pitsch, Elmar Schömer