Algorithms Sequential & Parallel: A Unified Approach

450 Pages·2012·15.49 MB·English

by  Russ Miller

CC88220088__ffmm..iinndddd iiii 1111//1155//1122 77::0011 AAMM
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd iiii 1111//1155//1122 77::0011 AAMM
Algorithms
Sequential and Parallel:
A Unified Approach
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd ii 1111//1155//1122 77::0011 AAMM
This is an electronic version of the print textbook. Due to electronic rights restrictions,
some third party content may be suppressed. Editorial review has deemed that any suppressed
content does not materially affect the overall learning experience. The publisher reserves the right
to remove content from this title at any time if subsequent rights restrictions require it. For
valuable information on pricing, previous editions, changes to current editions, and alternate
formats, please visit www.cengage.com/highered to search by ISBN#, author, title, or keyword for
materials in your areas of interest.
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd iiii 1111//1155//1122 77::0011 AAMM
Algorithms
Sequential and Parallel:
A Unified Approach
Third Edition
Russ Miller
Laurence Boxer
Australia • Brazil • Japan • Korea • Mexico • Singapore • Spain • United Kingdom • United States
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd iiiiii 1111//1155//1122 77::0011 AAMM
Algorithms Sequential and Parallel: © 2013, 2005 Cengage Learning
A Unifi ed Approach, Third Edition
ALL RIGHTS RESERVED. No part of this work covered by the copyright
Russ Miller and Laurence Boxer
herein may be reproduced, transmitted, stored, or used in any form or by
any means graphic, electronic, or mechanical, including but not limited to
Editor-in-Chief: Marie Lee
photocopying, recording, scanning, digitizing, taping, Web distribution,
Senior Product Manager: Alyssa Pratt
information networks, or information storage and retrieval systems, except
Associate Product Manager Stephanie Lorenz as permitted under Section 107 or 108 of the 1976 United States Copyright
Art and Design Direction, Production Act, without the prior written permission of the publisher.
Management, and Composition:
Integra Software Services Pvt. Ltd. For product information and technology assistance, contact us at
Cengage Learning Customer & Sales Support, 1-800-354-9706
Senior Print Buyer: Julio Esperas
For permission to use material from this text or product,
Cover Image: ©Spectral-Design/Shutterstock
submit all requests online at www.cengage.com/permissions
Further permissions questions can be e-mailed to
[email protected]
Library of Congress Control Number: 2012947455
ISBN-13: 978-1-133-36680-5
ISBN-10: 1-133-36680-5
Cengage Learning
20 Channel Center Street
Boston, MA 02210
USA
Cengage Learning is a leading provider of customized learning solutions with
offi ce locations around the globe, including Singapore, the United Kingdom,
Australia, Mexico, Brazil and Japan. Locate your local offi ce at
international.cengage.com/region
Cengage Learning products are represented in Canada by
Nelson Education, Ltd.
For your course and learning solutions, visit www.cengage.com
Purchase any of our products at your local college store or at our preferred
online store www.cengagebrain.com
Instructors: Please visit login.cengage.com and log in to access instructor-
specifi c resources.
Printed in the United States of America
1 2 3 4 5 6 17 16 15 14 13 12
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd iivv 1111//1155//1122 77::0011 AAMM
To my wife, Celeste, and my children, Amanda, Brian,
and Melissa.
—Russ Miller
To my wife, Linda; our daughter and son-in-law,
Robin and Mark Waldman, and their magnificent
multiprocessing multiplications, Ella, Lilah, and
Gabriel; and our son, Matthew.
—Laurence Boxer
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd vv 1111//1155//1122 77::0011 AAMM
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd vvii 1111//1155//1122 77::0011 AAMM
Contents
Preface xvii
Reference Guide xxiii
1 Asymptotic Analysis 2
Notation and Terminology 5
Asymptotic Notation 7
Additional Notation 10
Asymptotic Relationships 12
Asymptotic Analysis and Limits 12
Summations and Integrals 15
Rules for Analysis of Algorithms 21
Limitations of Asymptotic Analysis 28
Asymptotic Relationships and Common Terminology 29
Summary 30
Chapter Notes 30
Exercises 31
2 Induction and Recursion 36
Mathematical Induction 38
Induction Examples 38
Recursion 41
Sequential Search 44
Binary Search 46
vii
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd vviiii 1111//1155//1122 77::0011 AAMM
viii Contents
Additional Notes on Sequential and Binary Searches 48
Merging and Merge Sort 49
Common Recurrence Equations 55
Summary 56
Chapter Notes 56
Exercises 56
3 The Master Method 60
Master Theorem 63
Examples 63
Summary 65
Chapter Notes 65
Exercises 65
4 Models of Computation 66
RAM (Random Access Machine) 68
PRAM (Parallel Random Access Machine) 70
Distributed-Memory vs. Shared-Memory Machines 84
Interconnection Networks 85
Processor Organizations 88
Linear Array 88
Ring 97
Mesh 98
Tree 103
Pyramid 104
Mesh-of-Trees 106
Hypercube 111
Coarse-Grained Multiprocessors 116
Network of Workstations (NOW) 118
Cluster 120
Copyright 2013 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
CC88220088__ffmm..iinndddd vviiiiii 1111//1155//1122 77::0011 AAMM