Excerpt from The Efficient Termination of Ada Tasks in a Multiprocessor Environment
An efficient implementation of Ada task termination for shared memory MIMD architectures is presented. The solution is highly parallel and distributed; termination is not synchronized by a centralized supervisor, and there are no critical sections. The handling of block and subprogram termination that depend on nested tasks is also included. This implementation can be easily adapted to message based systems.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Ihre gesetzlichen Garantierechte: Alle Verbraucher:innen in der EU profitieren von mindestens 2 Jahren gesetzlichem Garantieschutz für alle in der EU verkauften Konsumgüter. Mehr erfahren
Anbieter: Forgotten Books, London, Vereinigtes Königreich
Paperback. Zustand: New. No Jacket. Print on Demand. Safe, scalable Ada task termination in a multiprocessor world explains how to end tasks cleanly without race problems. The book shows how a counter-based approach can track active subtasks and guide a controlled termination wave. It emphasizes distributed termination, master blocks and master tasks, and how quiescence fits into safe shutdown. Readers will see practical ideas for coordinating activation, quiescence, and completion to avoid premature termination in complex Ada tasking systems.The text frames the problem of terminating nested and dynamically created tasks. It walks through concrete mechanisms, such as counters that include the task itself, and how master entities signal dependents to terminate. The discussion blends theory with steps you can implement on architectures ranging from shared memory to distributed systems. How no_term counters monitor active dependents and when a master can terminate How termination waves propagate from master tasks to their dependents How quiescence, completion, and terminate alternatives interact to avoid race conditions Practical considerations for implementing termination on MIMD and Ultracomputer-style systemsIdeal for readers exploring Ada concurrency and parallel programming in multiprocessor environments. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Bestandsnummer des Verkäufers 9781332871438_0
Anzahl: Mehr als 20 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332871438
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332871438
Anzahl: 15 verfügbar