[PDF][PDF] Cross Cutting Condensed Graphs.
BP Mulcahy, SN Foley, JP Morrison - PDPTA, 2005 - Citeseer
BP Mulcahy, SN Foley, JP Morrison
PDPTA, 2005•CiteseerCondensed Graphs provide a graph based programming model that unifies availability-
driven, coerciondriven and control-driven computing. In this paper we explore the issues of
concurrency and synchronisation between condensed graph applications. A paradigm for
condensed graph synchronisation is proposed and an architectural pattern is developed that
forms the basis of a novel synchronisation mechanism.
driven, coerciondriven and control-driven computing. In this paper we explore the issues of
concurrency and synchronisation between condensed graph applications. A paradigm for
condensed graph synchronisation is proposed and an architectural pattern is developed that
forms the basis of a novel synchronisation mechanism.
Abstract
Condensed Graphs provide a graph based programming model that unifies availability-driven, coerciondriven and control-driven computing. In this paper we explore the issues of concurrency and synchronisation between condensed graph applications. A paradigm for condensed graph synchronisation is proposed and an architectural pattern is developed that forms the basis of a novel synchronisation mechanism.
Citeseer
Showing the best result for this search. See all results