1 |
Semaphore Solutions for General Mutual Exclusion ProblemsYue, Kwok B. (Kwok Bun) 08 1900 (has links)
Automatic generation of starvation-free semaphore solutions to general mutual exclusion problems is discussed. A reduction approach is introduced for recognizing edge-solvable problems, together with an O(N^2) algorithm for graph reduction, where N is the number of nodes. An algorithm for the automatic generation of starvation-free edge-solvable solutions is presented. The solutions are proved to be very efficient. For general problems, there are two ways to generate efficient solutions. One associates a semaphore with every node, the other with every edge. They are both better than the standard monitor—like solutions. Besides strong semaphores, solutions using weak semaphores, weaker semaphores and generalized semaphores are also considered. Basic properties of semaphore solutions are also discussed. Tools describing the dynamic behavior of parallel systems, as well as performance criteria for evaluating semaphore solutions are elaborated.
|
2 |
Optické snímače / OptosensorsJakoubek, Martin January 2008 (has links)
Master’s Thesis solves a problem of vehicle detection for a system control of stoplights on crossroads for a long distance. First, there is a resolution how it is possible to detect cars and select from two sensor’s principles; second, chosen specific microwave detector is a result of sensor market research and finally, there is a description and processing of sensor.
|
3 |
Validation et mise en oeuvre de la synchronisation dans un système multiprocesseur à mémoire dupliquéeLatapie, Guy 14 November 1980 (has links) (PDF)
ON PRESENTE LES PRINCIPAUX OUTILS QUI PERMETTENT DE SPECIFIER ET D'IMPLEMENTER LES MECANISMES DE SYNCHRONISATION DANS UN SYSTEME MONOPROCESSEUR PUIS MULTIPROCESSEUR. ON DEFINIT ET ON MONTRE LES REGLES D'EVOLUTION DES RESEAUX DE PETRI ET ON DETAILLE LES DIVERSES METHODES D'ANALYSE QU'ILS AUTORISENT. ON PROPOSE UN MODELE DERIVE APPELE RESEAUX DE PETRI A JETONS INDIVIDUALISES. ON DECRIT UN ALGORITHME DE SYNCHRONISATION ET ON PROPOSE UNE MISE EN OEUVRE DE CET ALGORITHME A PARTIR DES RESEAUX DE PETRI A JETONS INDIVIDUALISES
|
Page generated in 0.0167 seconds