Artículos relacionados a 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) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 18,98
EUR 0,63 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Approximate Parallel Scheduling, Vol. 1: The Basic...
Imagen de archivo
Approximate Parallel Scheduling, Vol 1 The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333043476
Cantidad disponible: 15 disponibles
Imagen de archivo
Approximate Parallel Scheduling, Vol 1 The Basic Technique With Applications to Optimal Parallel List Ranking in Logarithmic Time Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333043476
Cantidad disponible: 15 disponibles
Imagen del vendedor
Approximate Parallel Scheduling, Vol. 1 (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: 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. Nº de ref. del artículo: 9781333043476_0
Cantidad disponible: Más de 20 disponibles