An approach is proposed for the implementation of distributed semaphores in the IEC 61499 architecture on the basis of protocols for solving consensus in a network of unreliable processes that allows developing functi...
详细信息
ISBN:
(纸本)9781538648292
An approach is proposed for the implementation of distributed semaphores in the IEC 61499 architecture on the basis of protocols for solving consensus in a network of unreliable processes that allows developing function block-based control applications with complex types of interactions using the resources sharing. The models of distributed semaphores (in the form of coloured Petri nets) based on Paxos and Raft protocols for solving consensus are developed, simulation experiments are performed in the CPN Tools, comparative analysis and recommendations are given.
Early distributed shared memory systems used the shared virtual memory approach with fixed-size pages, usually 1-8 KB. As this does not match the variable granularity of sharing of most programs, recently the emphasis...
详细信息
Early distributed shared memory systems used the shared virtual memory approach with fixed-size pages, usually 1-8 KB. As this does not match the variable granularity of sharing of most programs, recently the emphasis has shifted to distributed object-oriented systems. With small object sizes, the overhead of inter-process communication could be large enough to make a distributed program too inefficient for practical use. To support research in this area, we have implemented a user-level distributed programming testbed, DIPC, that provides shared memory, semaphores and barriers. We develop a computationally-efficient model of distributed shared memory using approximate queueing network techniques. The model can accommodate several algorithms including central server, migration and read-replication. These models have been carefully validated against measurements on our distributed shared memory testbed. Results indicate that for large granularities of sharing and small access bursts, central server performs better than both migration and read-replication algorithms. Read-replication performs better than migration for small and moderate object sizes for applications with high degree of read-sharing and migration performs better than read-replication for large object sizes for applications having moderate degree of read-sharing. (C) 2000 Published by Elsevier Science B.V. All rights reserved.
With the interesting of researchers to develop the scheduling of multiprocessor and distributed system in hard real time embedded systems, we present a new locking protocol called Minimizing multiple-Priority Inversio...
详细信息
ISBN:
(纸本)9781479933815
With the interesting of researchers to develop the scheduling of multiprocessor and distributed system in hard real time embedded systems, we present a new locking protocol called Minimizing multiple-Priority Inversion Protocol (MPIP), in this protocol, we proposed a novel mechanism to turn from preemptive to non-preemptive state to minimize multiple-priority inversion caused by low priority task on local processor. We focus on distributed locking semaphore and we showed its ability to lock the shared memory, thus;working in Multi-processor environment. We assumed all shared resources as global to avoid resource nested. With properties of our protocol, we define a new upper bound blocking time. We submit our proposal to experimental evaluation to compare it with MPCP protocol in term of hard real time schedulability.
Interesting with technology of parallel processing and multi-core system, we present a new design for multi-core-GPUs platform system with different shared resources, as well as get the advantage of OpenMP parallel pr...
详细信息
ISBN:
(纸本)9781479979813
Interesting with technology of parallel processing and multi-core system, we present a new design for multi-core-GPUs platform system with different shared resources, as well as get the advantage of OpenMP parallel programming to design a new unit for real time system where this platform divided into two part;first: clustering the multi-core-GPUs-OpenMP unit-shared resources by a new method, where CPUs and GPUs grouped in one cluster with OpenMP unit and grouped the shared resources by unique global cluster and scheduled it by global scheduling as well as the local locking shared resources protocol. Second;present an innovative mechanism for scheduling GPUs-OpenMP unit with shared resources in multi-core system. The GPU has been tested with many operations by OpenCL language and used the GPU performance with multi-core system depending on local and distributed semaphores evaluations and compare it with MPCP protocol. The evaluations of our proposal were very good.
暂无评论