IJFCS 2006 | Sciweavers

10

IJFCS
2006

63views more IJFCS 2006»

Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors

13 years 4 months ago

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

claim paper

Read More »

13

click to vote

IJFCS
2006

130views more IJFCS 2006»

Mealy multiset automata

13 years 4 months ago

Download www.sztaki.hu

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

claim paper

Read More »

6

click to vote

IJFCS
2006

61views more IJFCS 2006»

An universality result for a (mem)brane calculus based on mate/drip operations

13 years 4 months ago