Isbn: 9781332092222 - on parallel searching (classic reprint) (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332092225 / 9781332092222

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,90

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

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

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332092225 / 9781332092222

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,39

    EUR 3,83 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

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

  • Altre immagini

    Lingua: Inglese

    Editore: Forgotten Books, 2018

    1332092225 / 9781332092222

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 15,75

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. Print on Demand. This book examines the potential and limitations of shared memory parallel computers for searching large data sets using only comparison-based algorithms. The author argues that while these computers can offer significant advantages over traditional serial computers, certain inherent limitations prevent them from achieving truly linear speedups. The book develops lower bounds on the time complexity of parallel searching algorithms, demonstrating that shared memory parallel computers with a fixed number of processors cannot achieve a speedup greater than a constant factor. The author also analyzes the impact of using more powerful comparison operators, such as polynomial comparisons, and shows that while these operators can improve the performance of parallel searching algorithms, they do not fundamentally change the overall complexity. Through these insights, this book provides a deeper understanding of the capabilities and limitations of shared memory parallel computers for searching problems. 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.…