Sciweavers

113
Voted
IJFCS
2006
63views more  IJFCS 2006»
15 years 20 days ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
IJFCS
2006
130views more  IJFCS 2006»
15 years 20 days ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
58
Voted
IJFCS
2006
61views more  IJFCS 2006»
15 years 20 days ago
An universality result for a (mem)brane calculus based on mate/drip operations
Luca Cardelli, Gheorghe Paun