The Experts below are selected from a list of 10872 Experts worldwide ranked by ideXlab platform
Sung-hoon Park - One of the best experts on this subject based on the ideXlab platform.
-
Solving Mutual Exclusion Problem in Mobile Cellular Networks
Computer Applications for Software Engineering Disaster Recovery and Business Continuity, 2020Co-Authors: Sung-hoon ParkAbstract:The Mutual Exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a Mutual Exclusion protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. In this paper, we describe a solution to the Mutual Exclusion problem from mobile computing systems. This solution is based on the token-based Mutual Exclusion algorithm.
-
ICITCS - Mutual Exclusion Algorithm in Mobile Cellular Networks
IT Convergence and Security 2012, 2012Co-Authors: Sung-hoon ParkAbstract:The Mutual Exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a Mutual Exclusion protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. In this paper, we describe a solution to the Mutual Exclusion problem from mobile computing systems. This solution is based on the token-based Mutual Exclusion algorithm.
-
A Design of Mutual Exclusion Protocol in Cellular Wireless Networks
2012 Ninth International Conference on Information Technology - New Generations, 2012Co-Authors: Sung-hoon ParkAbstract:The Mutual Exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a Mutual Exclusion protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. In this paper, we describe a solution to the Mutual Exclusion problem from mobile computing systems. This solution is based on the token-based Mutual Exclusion algorithm.
-
ITNG - A Design of Mutual Exclusion Protocol in Cellular Wireless Networks
2012 Ninth International Conference on Information Technology - New Generations, 2012Co-Authors: Sung-hoon ParkAbstract:The Mutual Exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a Mutual Exclusion protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. In this paper, we describe a solution to the Mutual Exclusion problem from mobile computing systems. This solution is based on the token-based Mutual Exclusion algorithm.
-
Token-Based Mutual Exclusion Algorithm in Mobile Cellular Networks
2012 26th International Conference on Advanced Information Networking and Applications Workshops, 2012Co-Authors: Sung-hoon ParkAbstract:The Mutual Exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a Mutual Exclusion protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. In this paper, we describe a solution to the Mutual Exclusion problem from mobile computing systems. This solution is based on the token-based Mutual Exclusion algorithm.
H. Kakugawa - One of the best experts on this subject based on the ideXlab platform.
-
A learning system for the problem of Mutual Exclusion in multithreaded programming
IEEE International Conference on Advanced Learning Technologies 2004. Proceedings., 2004Co-Authors: E. Yoshida, H. KakugawaAbstract:In this paper, we propose a GUI-based learning system for the problem of Mutual Exclusion in multithreaded programming (MTP) such as race conditions, deadlock and starvation. Threads are group of cooperating program executions with shared memory. A thread in execution is switched one after another, and thread executions are in concurrent. Because Mutual Exclusion is necessary for avoiding race conditions, understanding the problem of Mutual Exclusion and its solution is important for students. Deadlock and starvation are bugs of Mutual Exclusion algorithm such that threads are blocked forever, and threads cannot make progress, respectively. Finding such bugs is difficult because we must check every execution scheduling of threads. To this end, we have been developing a system for learning correct Mutual Exclusion algorithm in MTP. Our system is designed for university students studying computer science. Proposed system uses a model checking system to detect such bugs by analysis of multithreaded programs written in the MIPS R2000 assembly language. We describe the outline how learners use our system to understand the problem of Mutual Exclusion in MTP.
-
A quorum-based distributed algorithm for group Mutual Exclusion
Proceedings of the Fourth International Conference on Parallel and Distributed Computing Applications and Technologies, 2003Co-Authors: M. Toyomura, S. Kamei, H. KakugawaAbstract:The group Mutual Exclusion problem is a variant of Mutual Exclusion problem in a sense that only the same group of processes can enter their critical section simultaneously. We propose a quorum-based distributed algorithm for the group Mutual Exclusion problem in asynchronous message passing distributed systems. The message complexity of our algorithm is O(/spl bsol/Q/spl bsol/) in the best case and O(n/spl bsol/Q/spl bsol/) in the worst case, where /spl bsol/Q/spl bsol/ is a quorum size that the algorithm adopts, and n is the number of processes that make requests for resources.
N. Lynch - One of the best experts on this subject based on the ideXlab platform.
-
bounds on shared memory for Mutual Exclusion
Information & Computation, 1993Co-Authors: James E Burns, N. LynchAbstract:The shared memory requirements of Dijkstra?s Mutual Exclusion problem are examined. It is shown that n binary shared variables are necessary and sufficient to solve the problem of Mutual Exclusion with guaranteed global progress for n processes using only atomic reads and writes of shared variables for communication.
-
RTSS - Timing-based Mutual Exclusion
[1992] Proceedings Real-Time Systems Symposium, 1992Co-Authors: N. Lynch, N. ShavitAbstract:The benefits that can be obtained by using timing information in Mutual Exclusion algorithms are examined. A simple and efficient timing-based Mutual Exclusion algorithm is given. This algorithm always guarantees Mutual Exclusion (i.e. even when run asynchronously) and also avoids deadlock in case certain (realistic) inexact timing constraints are met. The algorithm uses only two shared read/write registers (a total of log n+1 bits), thus overcoming the n register lower bound for asynchronous algorithms. It is proved that the problem cannot be solved with only one shared register, so that this algorithm is optimal in terms of the number of registers. A lower bound is proved for the time complexity of any deadlock-free Mutual Exclusion protocol, as a function of the number of shared registers it employs. This bound shows that the algorithm described is near optimal, in terms of time complexity. It is shown that two natural ways of weakening the timing assumptions lead (unfortunately) to an n register lower bound. >
-
Timing-based Mutual Exclusion
[1992] Proceedings Real-Time Systems Symposium, 1992Co-Authors: N. Lynch, N. ShavitAbstract:The benefits that can be obtained by using timing information in Mutual Exclusion algorithms are examined. A simple and efficient timing-based Mutual Exclusion algorithm is given. This algorithm always guarantees Mutual Exclusion (i.e. even when run asynchronously) and also avoids deadlock in case certain (realistic) inexact timing constraints are met. The algorithm uses only two shared read/write registers (a total of log n+1 bits), thus overcoming the n register lower bound for asynchronous algorithms. It is proved that the problem cannot be solved with only one shared register, so that this algorithm is optimal in terms of the number of registers. A lower bound is proved for the time complexity of any deadlock-free Mutual Exclusion protocol, as a function of the number of shared registers it employs. This bound shows that the algorithm described is near optimal, in terms of time complexity. It is shown that two natural ways of weakening the timing assumptions lead (unfortunately) to an n register lower bound.
Daniel S Weld - One of the best experts on this subject based on the ideXlab platform.
-
temporal planning with Mutual Exclusion reasoning
International Joint Conference on Artificial Intelligence, 1999Co-Authors: David E Smith, Daniel S WeldAbstract:Many planning domains require a richer notion of time in which actions can overlap and have different durations. The key to fast performance in classical planners (e.g., Graphplan, IPP, and Blackbox) has been the use of a disjunctive representation with powerful Mutual Exclusion reasoning. This paper presents TGP, a new algorithm for temporal planning. TGP operates by incrementally expanding a compact planning graph representation that handles actions of differing duration. The key to TGP performance is tight Mutual Exclusion reasoning which is based on an expressive language for bounding mutexes and includes mutexes between actions and propositions. Our experiments demonstrate that Mutual Exclusion reasoning remains valuable in a rich temporal setting.
-
IJCAI - Temporal Planning with Mutual Exclusion Reasoning
1999Co-Authors: David E Smith, Daniel S WeldAbstract:Many planning domains require a richer notion of time in which actions can overlap and have different durations. The key to fast performance in classical planners (e.g., Graphplan, IPP, and Blackbox) has been the use of a disjunctive representation with powerful Mutual Exclusion reasoning. This paper presents TGP, a new algorithm for temporal planning. TGP operates by incrementally expanding a compact planning graph representation that handles actions of differing duration. The key to TGP performance is tight Mutual Exclusion reasoning which is based on an expressive language for bounding mutexes and includes mutexes between actions and propositions. Our experiments demonstrate that Mutual Exclusion reasoning remains valuable in a rich temporal setting.
N. Shavit - One of the best experts on this subject based on the ideXlab platform.
-
RTSS - Timing-based Mutual Exclusion
[1992] Proceedings Real-Time Systems Symposium, 1992Co-Authors: N. Lynch, N. ShavitAbstract:The benefits that can be obtained by using timing information in Mutual Exclusion algorithms are examined. A simple and efficient timing-based Mutual Exclusion algorithm is given. This algorithm always guarantees Mutual Exclusion (i.e. even when run asynchronously) and also avoids deadlock in case certain (realistic) inexact timing constraints are met. The algorithm uses only two shared read/write registers (a total of log n+1 bits), thus overcoming the n register lower bound for asynchronous algorithms. It is proved that the problem cannot be solved with only one shared register, so that this algorithm is optimal in terms of the number of registers. A lower bound is proved for the time complexity of any deadlock-free Mutual Exclusion protocol, as a function of the number of shared registers it employs. This bound shows that the algorithm described is near optimal, in terms of time complexity. It is shown that two natural ways of weakening the timing assumptions lead (unfortunately) to an n register lower bound. >
-
Timing-based Mutual Exclusion
[1992] Proceedings Real-Time Systems Symposium, 1992Co-Authors: N. Lynch, N. ShavitAbstract:The benefits that can be obtained by using timing information in Mutual Exclusion algorithms are examined. A simple and efficient timing-based Mutual Exclusion algorithm is given. This algorithm always guarantees Mutual Exclusion (i.e. even when run asynchronously) and also avoids deadlock in case certain (realistic) inexact timing constraints are met. The algorithm uses only two shared read/write registers (a total of log n+1 bits), thus overcoming the n register lower bound for asynchronous algorithms. It is proved that the problem cannot be solved with only one shared register, so that this algorithm is optimal in terms of the number of registers. A lower bound is proved for the time complexity of any deadlock-free Mutual Exclusion protocol, as a function of the number of shared registers it employs. This bound shows that the algorithm described is near optimal, in terms of time complexity. It is shown that two natural ways of weakening the timing assumptions lead (unfortunately) to an n register lower bound.
