approximate parallel scheduling vol von cole richard (7 Ergebnisse)

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

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

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

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

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

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.

Paperback. Zustand: New. Print on Demand. This book presents an innovative parallel scheduling technique and uses it to create a logarithmic time optimal parallel algorithm for the list ranking problem. The author acknowledges that most problems can be solved by parallel algorithms that obey a reducing procedure framework, which typically requires rescheduling processors. However, rescheduling can be an obstacle to logarithmic time algorithms that use an optimal number of processors. This book provides a novel approach to the rescheduling problem that allows for a logarithmic time connectivity algorithm that is optimal unless the graph is extremely sparse. The new algorithm also leads to efficient parallel algorithms for related problems like biconnected components, Euler tours, and st-numbering. The author explores duration-unknown task scheduling problems and provides a parallel union/find algorithm. This book provides significant contributions to the field of parallel computation and offers valuable insights for researchers and practitioners interested in optimal parallel algorithms for graph 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.