Scheduling of Dynamic Participants in Real-Time Distributed Systems

被引:2
作者
Sin, Mong Leng [1 ]
Bouroche, Melanie [1 ]
Cahill, Vinny [1 ]
机构
[1] Trinity Coll Dublin, Dept Comp Sci, Dublin 2, Ireland
来源
2011 30TH IEEE INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS) | 2011年
关键词
MUTUAL EXCLUSION; ALGORITHM;
D O I
10.1109/SRDS.2011.37
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Access to shared resources can be controlled by schedules or mutual exclusion. Such methods are not practical in an environment with dynamic participants, where nodes requiring access to shared resources can enter or leave the scene at any time. Current scheduling methods are usually centralized, demand that the system has a clear idea of when the resources are required and do not consider communication failures. Current implementations of distributed mutual exclusion use token-or permission-based methods. Dynamic participation amplifies the lost token problem in token-based approaches, while limited knowledge of the number of nodes makes obtaining quora and consensus in permission-based approaches impossible, rendering both mutual exclusion implementations impractical. This paper presents the CwoRIS protocol which enables short-term scheduling in real-time within an environment with dynamic participants. It motivates the need to support dynamic participants by means of a scenario for autonomous vehicle coordination in intersection crossing. The paper shows that the protocol is able to work in an environment with message loss and argues its correctness by showing mutual exclusion: there are no cases in which two nodes have access to the same resources at the same time.
引用
收藏
页码:245 / 254
页数:10
相关论文
共 21 条
[1]   AN EFFICIENT AND FAULT-TOLERANT SOLUTION FOR DISTRIBUTED MUTUAL EXCLUSION [J].
AGRAWAL, D ;
ELABBADI, A .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (01) :1-20
[2]  
[Anonymous], 2012, Scheduling
[3]  
Attiya H., 2010, IEEE T MOBILE COMP, V9
[4]   Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad hoc Networks [J].
Borran, Fatemeh ;
Prakash, Ravi ;
Schiper, Andre .
PROCEEDINGS OF THE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, 2008, :227-+
[5]  
Bouroche M., 2007, THESIS U DUBLIN
[6]  
Chang Y.-I., 1990, Proceedings. Ninth Symposium on Reliable Distributed Systems (Cat. No.90CH2912-4), P146, DOI 10.1109/RELDIS.1990.93960
[7]   Reconciling the theory and practice of (un)reliable wireless broadcast [J].
Chockler, G ;
Demirbas, M ;
Gilbert, S ;
Lynch, N ;
Newport, C ;
Nolte, T .
25TH IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, PROCEEDINGS, 2005, :42-48
[8]  
Dresner K., 2008, P 7 INT JOINT C AUT
[9]  
Dresner Kurt., 2005, P 4 INT JOINT C AUT, P471
[10]   IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS [J].
FISCHER, MJ ;
LYNCH, NA ;
PATERSON, MS .
JOURNAL OF THE ACM, 1985, 32 (02) :374-382