Runtime System Support for Running Applications with Dynamic and Asynchronous Task Parallelism in Software DSM Systems

Mendes, Renata de S.; Whately, Lauro; Castro, Marcela; Bentes, Cristiana; Amorim, Cláudio Luis de

doi:10.1109/sbac-pad.2006.25

Cited by 4 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work we propose a novel agent communication system based on distributed-shared memory (DSM) mechanisms, widely used in parallel systems [11,16,20], that allows the implementation of a shared address space on a distributed system, without centralizing the blackboard in a single node. Our idea is to distribute the shared data over the system nodes and use a message passing sub-system totally transparent to the programmer, in the same way a software DSM system does.…”

Section: Introductionmentioning

confidence: 99%

Using Distributed-Shared Memory Mechanisms for Agents Communication in a Distributed System

Gonzaga¹,

Bentes²,

Farı́as³

et al. 2007

Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007)

View full text Add to dashboard Cite

In multi-agent systems, blackboard communication provides an easy way for agents to communicate. However, in a distributed architecture, the blackboard is commonly implemented in a single node, that is the "blackboard server". This approach may work well for a small number of agents. Nevertheless, when the number of agents increases, the blackboard server becomes the bottleneck for the system scalability. In this work we propose a novel agent communication system based on distributed-shared mechanisms that allows the implementation of a shared address space on a distributed system, without centralizing the blackboard. Our idea is to distribute the shared data over the nodes and use a message passing sub-system, totally transparent to the agents. We implemented this idea in a multi-agent system based on social laws, and used a distributed-shared memory system to handle the messaging. We created a conflict simulator, and showed that the distributed-shared mechanisms easy the implementation of a truly distributed blackboard.

show abstract

Section: Introductionmentioning

confidence: 99%

Using Distributed-Shared Memory Mechanisms for Agents Communication in a Distributed System

Gonzaga¹,

Bentes²,

Farı́as³

et al. 2007

Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007)

View full text Add to dashboard Cite

show abstract

“…A common approach taken in the development of programming tools and runtime environments (e.g. Athapascan-1 [2], Cilk [3], Clik [4], Pyrros [5], and GrADS [6]) is building an intermediate level between the program in execution and the scheduler describing the program structure in terms of a Directed Acyclic task Graph (DAG). Since the literature on scheduling strategies taking graphs as input is vast (e.g.…”

Section: Introductionmentioning

confidence: 99%

Anahy: A Programming Environment for Cluster Computing

Cavalheiro

Gaspary

Cardozo

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents Anahy, a programming environment for cluster computing. Anahy is presented in terms of its programming interface (API) and its scheduling mechanism. The main features of this environment are the specification of a POSIX thread-based API and the use of dynamic scheduling techniques based on Directed Acyclic Task Graphs (DAG). The main advantage obtained with these features is the dissociation between the description of the concurrency of an application and its parallel execution. The paper examines how Anahy builds a DAG describing the dependencies among tasks at execution time from a multithreaded program and how this DAG is handled by the runtime to apply dynamic scheduling techniques. The paper concludes discussing three case studies of applications developed in the context of Anahy environment.

show abstract