TY - GEN
T1 - Region synchronization in message passing systems
AU - Singh, G.
AU - Su, Ye
N1 - Publisher Copyright:
© 2002 IEEE.
Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.
PY - 2002
Y1 - 2002
N2 - The development of correct synchronization code for distributed programs is a challenging task. In this paper, we propose an aspect oriented technique for developing synchronization code for message passing systems. Our approach is to factor out synchronization as a separate aspect, synthesize synchronization code and then compose it with the functional code. Specifically, we allow the designer of an application to first design the functional code. The designer can then annotate the functional code with regions and specify a high-level "global invariant" specifying the synchronization policy. A synchronization policy essentially gives the occupancy rules for the various regions. The solution to this problem, which we term the region synchronization problem, involves deriving a set of rules for entering and exiting each region. We provide a systematic invariant into a message passing algorithm for a point-to-point message passing system. We show that many existing synchronization problems can be specified as instances of the region synchronization problem. Hence, our algorithms can be used to solve a large class of synchronization problems.
AB - The development of correct synchronization code for distributed programs is a challenging task. In this paper, we propose an aspect oriented technique for developing synchronization code for message passing systems. Our approach is to factor out synchronization as a separate aspect, synthesize synchronization code and then compose it with the functional code. Specifically, we allow the designer of an application to first design the functional code. The designer can then annotate the functional code with regions and specify a high-level "global invariant" specifying the synchronization policy. A synchronization policy essentially gives the occupancy rules for the various regions. The solution to this problem, which we term the region synchronization problem, involves deriving a set of rules for entering and exiting each region. We provide a systematic invariant into a message passing algorithm for a point-to-point message passing system. We show that many existing synchronization problems can be specified as instances of the region synchronization problem. Hence, our algorithms can be used to solve a large class of synchronization problems.
KW - Contracts
KW - Counting circuits
KW - Design methodology
KW - Distributed computing
KW - Formal specifications
KW - Message passing
KW - Operating systems
KW - Parallel processing
KW - Unified modeling language
UR - http://www.scopus.com/inward/record.url?scp=12744254571&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=12744254571&partnerID=8YFLogxK
U2 - 10.1109/ICPP.2002.1040883
DO - 10.1109/ICPP.2002.1040883
M3 - Conference contribution
AN - SCOPUS:12744254571
T3 - Proceedings of the International Conference on Parallel Processing
SP - 276
EP - 283
BT - Proceedings - International Conference on Parallel Processing, ICPP 2002
A2 - Abdelrahman, Tarek S.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Conference on Parallel Processing, ICPP 2002
Y2 - 18 August 2002 through 21 August 2002
ER -