M. Gholipour

Qazvin Islamic Azad University, Kazvin, Qazvīn, Iran

Are you M. Gholipour?

Claim your profile

Publications (12)0 Total impact

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper concisely describes the very main and new features of our soccer playing robots along with the improvements made since the previous years. Our major concerns for this year's competitions have been developing a complete passing scenario, equipping robots with new kicker tools, also developing new features in vision and software which are cooperative team behavior synchronization and emotional intelligence.
    01/2011;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Leader election is an important problem in distributed computing systems. In this problem, when the leader is crashed, other nodes must elect another leader. Garcia-Molinapsilas Bully Algorithm is a classic solution to cope with this problem. In this paper we introduce a new method based on electing a leader and alternatives. If the leader crash, the alternative takes, care of the leader's responsibilities. Our results revealed that often, after a leader crash, leader alternative elect as a leader and continue to work. increases. We show that our proposed algorithm is more efficient than the Garcia Molinapsilas one in term of time, message complexity and in the fewer stages.
    Communication Theory, Reliability, and Quality of Service, 2009. CTRQ '09. Second International Conference on; 08/2009
  • [Show abstract] [Hide abstract]
    ABSTRACT: Tasks scheduling problem is a key factor for a distributed system in order to achieve better efficiency. The problem of tasks scheduling in a distributed system can be stated as allocating tasks to the processor of each computer. The objective of this problem is minimizing makespan and communication cost, while maximizing CPU utilization. Scheduling problem is known as being NP-complete. Hence, many genetic algorithms have been proposed to search optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without consideration to techniques that can reduce the complexity of the optimization. In other words, the main shortcoming of these approaches is to spend much time doing scheduling, and hence, needing exhaustive time. Therefore, in this paper we use memetic algorithm to cope with this shortcoming. We apply Tabu search as local search in our proposed memetic algorithm. Extended simulation results demonstrate that the proposed method outperforms the existent GA-based method in terms of communication cost, CPU utilization and makespan.
    2010 Third International Conference on Communication Theory, Reliability, and Quality of Service. 07/2009;
  • Source
    M Gholipour, M R Meybodi
    [Show abstract] [Hide abstract]
    ABSTRACT: The spatiotemporal character of mobicast in sensor networks relates to obligation to deliver a mes-sage to all the nodes that will be present at time t in some geographic zone Z, where both the location and the shape of the delivery zone are the functions of time over some interval t start t end . In this paper a learning automata based mobicast protocol for sensor networks to support applica-tions which require spatiotemporal coordination has been proposed. The proposed protocol which we call it LA-Mobicast uses the shape and the size of the forwarding zone to achieve high predicted accuracy. The proposed protocol use learning automata to adaptively determine the location and the shape of the forwarding zone in such away that the same number of wake-up sensor nodes be maintained. The proposed protocol is a fully distributed algorithm which requires lesser com-munication overhead in determining the forwarding zone and the mobicast message forwarding overhead. In order to show the performance of the proposed protocol, computer simulations have been conducted and the results obtained are compared with the results obtained for five existing mobicast protocols. The results of comparison show that the proposed protocol outperforms exist-ing mobicast protocols in terms of slack time, message exchange, node involved and guarantee percent.
    01/2008;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In distributed operating systems orphan detection is a key subject. There exist some methods for cope with orphans. One of them is DSG method which overcomes to previous method. In this paper initially we introduce DSG method and then we present its advantages. After it we intended to prevent burst traffic in a special scenario that can be accrued in DSG environment.
    07/2005;
  • [Show abstract] [Hide abstract]
    ABSTRACT: Orphan detection methods demonstrate different performance, memory consumption in different scenarios. Dedicated Server Group (DSG) method is one of the most proper one. In this paper, we overviewed DSG method and analyzed its advantages and disadvantages. Based on the analytical results, we improved the DSG method in both process overhead and communication/traffic overhead. The dependability of improved method is evaluated by Markov chain modeling using SHARPE package and the Availability, Reliability, and Mean-Time to Failure are calculated.
    07/2005;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In distributed systems which use RPC, if a failed process sent a request before failing, the receiver of this request becomes an orphan process and must roll back to undo the effects of receiving the message. There are two types of orphan: one of them mostly called "crash- orphan" in which client crashes. Another which causes orphan process is called abort-orphan in which parent's process is aborted (Baumann and Rothermel). Orphans are undesirable because they waste system resources and can make inconsistent data (Herlihy and Mckendry, 1990). In this paper initially we present two novel methods for orphan detection. Finally we compare our new methods with the older ones.
    Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on; 04/2005
  • [Show abstract] [Hide abstract]
    ABSTRACT: Different orphan detection methods prefer different tradeoffs between performance, storage overhead, and simplicity of recovery. There exist some methods for orphan detection. One of them called DSG method that has been presented in [1]. In this paper initially we introduce DSG method and then we present its advantages. Finally we improve this method in either process overhead and communication/traffic overhead.
    04/2005;
  • Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, part of the 23rd Multi-Conference on Applied Informatics, Innsbruck, Austria, February 15-17, 2005; 01/2005
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Leader election is an important problem in distributed computing, and it is applied in many scientific fields such as communication network [1,2,3,4,5], centralized mutual exclusion algorithm [6,7], centralized control IPC, Berkeley algorithm, etc. Synchronization between processes often requires one process acting as a coordinator. The coordinator might not remain the same, because it might get crashed. Bully election algorithm is one of the classic methods which is used to determine the process with highest priority number as the coordinator. In this paper, we will discuss the drawbacks of Garcia_Molina's Bully algorithm and then we will present an optimized method for the Bully algorithm called modified bully algorithm. Our analytical simulation shows that, our algorithm is more efficient rather than the Bully algorithm with fewer message passing and fewer stages.
    01/2005;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Leader election is an important problem in distributed computing, and it is applied in many scientific fields such as communication network (1,2,3,4,5), centralized mutual exclusion algorithm (6,7), centralized control IPC, Berkeley algorithm, etc. Synchronization between processes often requires one process acting as a coordinator. The coordinator might not remain the same, because might get crashed. Bully election algorithm is one of the classic methods which is used to determine the process with highest priority number as the coordinator. In this paper, we will discuss the drawbacks of Garcia_Molina's Bully algorithm and then we will present an optimized method for the Bully algorithm called modified bully algorithm. Our analytical simulation shows that, our algorithm is more efficient rather than the Bully algorithm with fewer message passing and fewer stages.
    01/2005;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper concisely describes the very main and new features of our soccer playing robots along with the improvements made since the previous years. Our major concerns for this year's competitions have been developing a complete passing scenario, equipping robots with new kicker tools, also developing new features in vision and software which are cooperative team behavior synchronization and emotional intelligence.