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

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (3)

  • Nuevo (3)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Forgotten Books, 2019

    1333255365 / 9781333255367

    • Tapa blanda

    Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 26,24

     Gastos de envío gratis 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 15 disponibles

    PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

  • Idioma: Inglés

    Editorial: Forgotten Books, 2019

    1333255365 / 9781333255367

    • Tapa blanda

    Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 25,14

    Envío por EUR 3,93 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 15 disponibles

    PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

  • Más imágenes

    Idioma: Inglés

    Editorial: Forgotten Books, London, 2018

    1333255365 / 9781333255367

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Forgotten Books, London, Reino UnidoForgotten Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 16,48

     Gastos de envío gratis 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: 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.…