Object-based programming languages are being widely used to construct concurrent and distributed systems. In such systems, the complexity of performing some task is usually measured in terms of messages that are exchanged to perform the task, because communication is almost always the most time consuming operation in these environments. In this paper we analyze the problem of verifying if a message can be delivered. We model object-based systems as a graph grammars, and analyze this property as a graph grammar property. It turns out that this problem is NP-Hard. With suitable restrictions on the kind of graph grammar rules that are used, decidability can also be proven.

No abstract

No abstract

Este trabalho analisa a complexidade de uma implementação do método de desenvolvimento de algoritmos Divisão e Conquista numa arquitetura paralela com estrutura de árvore, comparando-a à complexidade de uma implementação seqüencial.