Verwandte Artikel zu Approximate Parallel Scheduling, Vol. 1: The Basic...
Approximate Parallel Scheduling, Vol. 1: The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time (Classic Reprint) - Softcover
Inhaltsangabe
Excerpt from Approximate Parallel Scheduling, Vol. 1: The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time
Input: A linked list of length n. It is given in an array of length n, not necessarily in the order of the linked list. Each of the n elements (except the last element in the linked list) has the array index of its successor in the linked list.
The problem: For each element, compute the number of elements following it in the linked list.
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.
Reseña del editor
Excerpt from Approximate Parallel Scheduling, Vol. 1: The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time
Input: A linked list of length n. It is given in an array of length n, not necessarily in the order of the linked list. Each of the n elements (except the last element in the linked list) has the array index of its successor in the linked list.
The problem: For each element, compute the number of elements following it in the linked list.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 18,92
EUR 0,83 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Approximate Parallel Scheduling, Vol. 1: The Basic...
Beispielbild für diese ISBN
Approximate Parallel Scheduling, Vol 1 The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time Classic Reprint
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333043476
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
Approximate Parallel Scheduling, Vol 1 The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time Classic Reprint
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781333043476
Anzahl: 15 verfügbar
Foto des Verkäufers
Approximate Parallel Scheduling, Vol. 1 (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. Print on Demand. In this book, the author delves into the new and innovative field of parallel scheduling. The book is a detailed and technical discussion of how to schedule tasks for multiple processors simultaneously. It provides a theoretical framework for solving a novel scheduling problem, which leads to an optimal logarithmic time parallel algorithm for list ranking. This book is a valuable resource for computer science researchers interested in pursuing parallel scheduling and related topics. 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 9781333043476_0
Anzahl: Mehr als 20 verfügbar