ISBN: 9781333255367 - fully parallel algorithm for implementing path expressions (classic reprint) (3 Ergebnisse)

ISBN: 
Mit der Detailsuche verfeinern

Optimieren Sie Ihre Suche

  • Bücher (3)

  • Neu (3)

bis

Benutzerdefinierte Preisspanne (EUR)

bis

  • Sprache: Englisch

    Verlag: Forgotten Books, 2019

    1333255365 / 9781333255367

    • Softcover

    Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 26,24

     Versand gratis 
    Versand innerhalb von USA

    Anzahl: 15 verfügbar

    PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

  • Sprache: Englisch

    Verlag: Forgotten Books, 2019

    1333255365 / 9781333255367

    • Softcover

    Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 25,14

    EUR 3,93 Versand 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: 15 verfügbar

    PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

  • Weitere Bilder

    Sprache: Englisch

    Verlag: Forgotten Books, London, 2018

    1333255365 / 9781333255367

    • Softcover
    • Print-on-Demand

    Anbieter: Forgotten Books, London, Vereinigtes KönigreichForgotten Books

    Verkäufer/-in mit 5 Sternen
    Verkäufer/-in kontaktieren

    Zustand: Neu

    EUR 16,48

     Versand gratis 
    Versand von Vereinigtes Königreich nach USA

    Anzahl: Mehr als 20 verfügbar

    Paperback. Zustand: New. No Jacket. Print on Demand. Discover flexible, scalable synchronization for parallel systems with path expressions. This book presents a high-level language for coordinating many processes that share data, aiming to make complex synchronization easier to implement and reason about. It argues that path expressions offer more flexible control than traditional approaches and can adapt to a variety of architectures.Path expressions define when events may execute and which may occur concurrently, using a structured syntax that supports sequencing, selection, and repetition. The discussion covers semantics, models, and practical considerations for implementing these ideas in real machines. The work also examines how arbitration works in parallel environments and introduces fairness concepts to ensure progress across competing events.- Learn how path expressions constrain event execution to achieve correct synchronization.- Explore the arbitration approach and how fairness can be realized in parallel systems.- See how the concepts are formalized and analyzed, including semantic models and complexity notes.- Read about portability and applicability to different shared-memory, MIMD architectures.Ideal for readers of parallel computing, synchronization theory, and systems architecture who want a high-level framework for coordinating concurrent processes. 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.…