Introduction To Parallel Computing 2nd Edition Ananth Grama Instant Download
Introduction To Parallel Computing 2nd Edition Ananth Grama Instant Download
https://ebookultra.com/download/introduction-to-parallel-computing-2nd-
edition-ananth-grama/
https://ebookultra.com/download/introduction-to-parallel-
computing-2nd-edition-ananth-grama-2/
https://ebookultra.com/download/an-introduction-to-parallel-and-
vector-scientific-computing-1st-edition-ronald-w-shonkwiler/
https://ebookultra.com/download/elements-of-parallel-computing-1st-
edition-eric-aubanel/
https://ebookultra.com/download/introduction-to-grid-computing-with-
globus-2nd-ed-edition-luis-ferreira/
Parallel Computing in Quantum Chemistry 1st Edition Curtis
L. Janssen
https://ebookultra.com/download/parallel-computing-in-quantum-
chemistry-1st-edition-curtis-l-janssen/
https://ebookultra.com/download/an-introduction-to-quantum-
computing-1st-edition-phillip-kaye/
https://ebookultra.com/download/the-druby-book-distributed-and-
parallel-computing-with-ruby-1st-edition-masatoshi-seki/
https://ebookultra.com/download/mobile-intelligence-wiley-series-on-
parallel-and-distributed-computing-1st-edition-laurence-t-yang/
Introduction to Parallel Computing 2nd Edition Ananth
Grama Digital Instant Download
Author(s): Ananth Grama
ISBN(s): 9780849344961, 0849344964
Edition: 2
File Details: PDF, 12.32 MB
Year: 2003
Language: english
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
• Table of Contents
Introduction to Parallel Computing, Second Edition
ISBN: 0-201-64865-2
Pages: 856
Increasingly, parallel processing is being seen as the only cost-effective method for the fast solution of computationally large and
data-intensive problems. The emergence of inexpensive parallel computers such as commodity desktop multiprocessors and clusters of
workstations or PCs has made such parallel methods generally applicable, as have software standards for portable parallel
programming. This sets the stage for substantial growth in parallel software.
Data-intensive applications such as transaction processing and information retrieval, data mining and analysis and multimedia services
have provided a new challenge for the modern generation of parallel platforms. Emerging areas such as computational biology and
nanotechnology have implications for algorithms and systems development, while changes in architectures, programming models and
applications have implications for how parallel platforms are made available to users in the form of grid-based services.
This book takes into account these new developments as well as covering the more traditional problems addressed by parallel
computers.Where possible it employs an architecture-independent view of the underlying platforms and designs algorithms for an
abstract model. Message Passing Interface (MPI), POSIX threads and OpenMP have been selected as programming models and the
evolving application mix of parallel computing is reflected in various examples throughout the book.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks.
[ Team LiB ]
• Table of Contents
Introduction to Parallel Computing, Second Edition
Copyright
Pearson Education
Preface
Acknowledgments
Chapter 1. Introduction to Parallel Computing
Section 1.1. Motivating Parallelism
Section 1.2. Scope of Parallel Computing
Section 1.3. Organization and Contents of the Text
Section 1.4. Bibliographic Remarks
Problems
Chapter 2. Parallel Programming Platforms
Section 2.1. Implicit Parallelism: Trends in Microprocessor Architectures*
Section 2.2. Limitations of Memory System Performance*
Section 2.3. Dichotomy of Parallel Computing Platforms
Section 2.4. Physical Organization of Parallel Platforms
Section 2.5. Communication Costs in Parallel Machines
Section 2.6. Routing Mechanisms for Interconnection Networks
Section 2.7. Impact of Process-Processor Mapping and Mapping Techniques
Section 2.8. Bibliographic Remarks
Problems
Chapter 3. Principles of Parallel Algorithm Design
Section 3.1. Preliminaries
Section 3.2. Decomposition Techniques
Section 3.3. Characteristics of Tasks and Interactions
Section 3.4. Mapping Techniques for Load Balancing
Section 3.5. Methods for Containing Interaction Overheads
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks
Copyright
Pearson Education Limited
Edinburgh Gate
Harlow
England
The rights of Ananth Grama, Anshul Gupta, George Karypis and Vipin Kumar to be identified as authors of this work have been asserted
by them in accordance with the Copyright, Designs and Patents Act 1988.
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any
means, electronic, mechanical, photocopying, recording or otherwise, without either the prior written permission of the publisher or a
licence permitting restricted copying in the United Kingdom issued by the Copyright Licensing Agency Ltd, 90 Tottenham Court Road,
London W1T 4LP.
The programs in this book have been included for their instructional value. They have been tested with care but are not guaranteed for
any particular purpose. The publisher does not offer any warranties or representations nor does it accept any liabilities with respect to
the programs.
All trademarks used herein are the property of their respective owners. The use of any trademark in this text does not vest in the author
or publisher any trademark ownership rights in such trademarks, nor does the use of such trademarks imply any affiliation with or
endorsement of this book by such owners.
A catalogue record for this book is available from the British Library
A catalog record for this book is available from the Library of Congress
10 9 8 7 6 5 4 3 2 1
07 06 05 04 03
Dedication
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
Pearson Education
We work with leading authors to develop the strongest educational materials in computing, bringing cutting-edge thinking and best
learning practice to a global market.
Under a range of well-known imprints, including Addison-Wesley, we craft high-quality print and electronic publications which help
readers to understand and apply their content, whether studying or at work.
To find out more about the complete range of our publishing, please visit us on the World Wide Web at:
www.pearsoneduc.com
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
Preface
Since the 1994 release of the text "Introduction to Parallel Computing: Design and Analysis of Algorithms" by the same authors, the field
of parallel computing has undergone significant changes. Whereas tightly coupled scalable message-passing platforms were the norm a
decade ago, a significant portion of the current generation of platforms consists of inexpensive clusters of workstations, and
multiprocessor workstations and servers. Programming models for these platforms have also evolved over this time. Whereas most
machines a decade back relied on custom APIs for messaging and loop-based parallelism, current models standardize these APIs
across platforms. Message passing libraries such as PVM and MPI, thread libraries such as POSIX threads, and directive based models
such as OpenMP are widely accepted as standards, and have been ported to a variety of platforms.
With respect to applications, fluid dynamics, structural mechanics, and signal processing formed dominant applications a decade back.
These applications continue to challenge the current generation of parallel platforms. However, a variety of new applications have also
become important. These include data-intensive applications such as transaction processing and information retrieval, data mining and
analysis, and multimedia services. Applications in emerging areas of computational biology and nanotechnology pose tremendous
challenges for algorithms and systems development. Changes in architectures, programming models, and applications are also being
accompanied by changes in how parallel platforms are made available to the users in the form of grid-based services.
This evolution has a profound impact on the process of design, analysis, and implementation of parallel algorithms. Whereas the
emphasis of parallel algorithm design a decade back was on precise mapping of tasks to specific topologies such as meshes and
hypercubes, current emphasis is on programmability and portability, both from points of view of algorithm design and implementation. To
this effect, where possible, this book employs an architecture independent view of the underlying platforms and designs algorithms for an
abstract model. With respect to programming models, Message Passing Interface (MPI), POSIX threads, and OpenMP have been
selected. The evolving application mix for parallel computing is also reflected in various examples in the book.
This book forms the basis for a single concentrated course on parallel computing or a two-part sequence. Some suggestions for such a
two-part sequence are:
1. Introduction to Parallel Computing: Chapters 1–6. This course would provide the basics of algorithm design and parallel
programming.
2. Design and Analysis of Parallel Algorithms: Chapters 2 and 3 followed by Chapters8–12. This course would provide an
in-depth coverage of design and analysis of various parallel algorithms.
The material in this book has been tested in Parallel Algorithms and Parallel Computing courses at the University of Minnesota and
Purdue University. These courses are taken primarily by graduate students and senior-level undergraduate students in Computer
Science. In addition, related courses in Scientific Computation, for which this material has also been tested, are taken by graduate
students in science and engineering, who are interested in solving computationally intensive problems.
Most chapters of the book include (i) examples and illustrations; (ii) problems that supplement the text and test students' understanding
of the material; and (iii) bibliographic remarks to aid researchers and students interested in learning more about related and advanced
topics. The comprehensive subject index helps the reader locate terms they might be interested in. The page number on which a term is
defined is highlighted in boldface in the index. Furthermore, the term itself appears in bold italics where it is defined. The sections that
deal with relatively complex material are preceded by a '*'. An instructors' manual containing slides of the figures and solutions to
selected problems is also available from the publisher (http://www.booksites.net/kumar).
As with our previous book, we view this book as a continually evolving resource. We thank all the readers who have kindly shared
critiques, opinions, problems, code, and other information relating to our first book. It is our sincere hope that we can continue this
interaction centered around this new book. We encourage readers to address communication relating to this book to
[email protected]. All relevant reader input will be added to the information archived at the sitehttp://www.cs.umn.edu/~parbook with
due credit to (and permission of) the sender(s). An on-line errata of the book will also be maintained at the site. We believe that in a
highly dynamic field such as ours, a lot is to be gained from a healthy exchange of ideas and material in this manner.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
Acknowledgments
We would like to begin by acknowledging our spouses, Joanna, Rinku, Krista, and Renu to whom this book is dedicated. Without their
sacrifices this project would not have been seen completion. We also thank our parents, and family members, Akash, Avi, Chethan,
Eleni, Larry, Mary-Jo, Naina, Petros, Samir, Subhasish, Varun, Vibhav, and Vipasha for their affectionate support and encouragement
throughout this project.
Our respective institutions, Computer Sciences and Computing Research Institute (CRI) at Purdue University, Department of Computer
Science & Engineering, the Army High Performance Computing Research Center (AHPCRC), and the Digital Technology Center (DTC)
at the University of Minnesota, and the IBM T. J. Watson Research Center at Yorktown Heights, provided computing resources and
active and nurturing environments for the completion of this project.
This project evolved from our first book. We would therefore like to acknowledge all of the people who helped us with both editions. Many
people contributed to this project in different ways. We would like to thank Ahmed Sameh for his constant encouragement and support,
and Dan Challou, Michael Heath, Dinesh Mehta, Tom Nurkkala, Paul Saylor, and Shang-Hua Teng for the valuable input they provided
to the various versions of the book. We thank the students of the introduction to parallel computing classes at the University of
Minnesota and Purdue university for identifying and working through the errors in the early drafts of the book. In particular, we
acknowledge the patience and help of Jim Diehl and Rasit Eskicioglu, who worked through several early drafts of the manuscript to
identify numerous errors. Ramesh Agarwal, David Bailey, Rupak Biswas, Jim Bottum, Thomas Downar, Rudolf Eigenmann, Sonia
Fahmy, Greg Frederickson, John Gunnels, Fred Gustavson, Susanne Hambrusch, Bruce Hendrickson, Christoph Hoffmann, Kai Hwang,
Ioannis Ioannidis, Chandrika Kamath, David Keyes, Mehmet Koyuturk, Piyush Mehrotra, Zhiyuan Li, Jens Palsberg, Voicu Popescu, Alex
Pothen, Viktor Prasanna, Sanjay Ranka, Naren Ramakrishnan, Elisha Sacks, Vineet Singh, Sartaj Sahni, Vivek Sarin, Wojciech
Szpankowski, Srikanth Thirumalai, Jan Vitek, and David Yau have been great technical resources. It was a pleasure working with the
cooperative and helpful staff at Pearson Education. In particular, we would like to thank Keith Mansfield and Mary Lince for their
professional handling of the project.
The Army Research Laboratory, ARO, DOE, NASA, and NSF provided parallel computing research support for Ananth Grama, George
Karypis, and Vipin Kumar. In particular, Kamal Abdali, Michael Coyle, Jagdish Chandra, Frederica Darema, Stephen Davis, Wm
Randolph Franklin, Richard Hirsch, Charles Koelbel, Raju Namburu, N. Radhakrishnan, John Van Rosendale, Subhash Saini, and
Xiaodong Zhang have been supportive of our research programs in the area of parallel computing. Andrew Conn, Brenda Dietrich, John
Forrest, David Jensen, and Bill Pulleyblank at IBM supported the work of Anshul Gupta over the years.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
The role of concurrency in accelerating computing elements has been recognized for several decades. However, their role in providing
multiplicity of datapaths, increased access to storage elements (both memory and disk), scalable performance, and lower costs is
reflected in the wide variety of applications of parallel computing. Desktop machines, engineering workstations, and compute servers
with two, four, or even eight processors connected together are becoming common platforms for design applications. Large scale
applications in science and engineering rely on larger configurations of parallel computers, often comprising hundreds of processors.
Data intensive platforms such as database or web servers and applications such as transaction processing and data mining often use
clusters of workstations that provide high aggregate disk bandwidth. Applications in graphics and visualization use multiple rendering
pipes and processing elements to compute and render realistic environments with millions of polygons in real time. Applications requiring
high availability rely on parallel and distributed platforms for redundancy. It is therefore extremely important, from the point of view of
cost, performance, and application requirements, to understand the principles, tools, and techniques for programming the wide variety of
parallel platforms currently available.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks
[ Team LiB ]
Development of parallel software has traditionally been thought of as time and effort intensive. This can be largely attributed to the
inherent complexity of specifying and coordinating concurrent tasks, a lack of portable algorithms, standardized environments, and
software development toolkits. When viewed in the context of the brisk rate of development of microprocessors, one is tempted to
question the need for devoting significant effort towards exploiting parallelism as a means of accelerating applications. After all, if it takes
two years to develop a parallel application, during which time the underlying hardware and/or software platform has become obsolete,
the development effort is clearly wasted. However, there are some unmistakable trends in hardware design, which indicate that
uniprocessor (or implicitly parallel) architectures may not be able to sustain the rate of realizable performance increments in the future.
This is a result of lack of implicit parallelism as well as other bottlenecks such as the datapath and the memory. At the same time,
standardized hardware interfaces have reduced the turnaround time from the development of a microprocessor to a parallel machine
based on the microprocessor. Furthermore, considerable progress has been made in standardization of programming environments to
ensure a longer life-cycle for parallel applications. All of these present compelling arguments in favor of parallel computing platforms.
"The complexity for minimum component costs has increased at a rate of roughly a factor of two per year.
Certainly over the short term this rate can be expected to continue, if not to increase. Over the longer term, the
rate of increase is a bit more uncertain, although there is no reason to believe it will not remain nearly constant for
at least 10 years. That means by 1975, the number of components per integrated circuit for minimum cost will be
65,000."
His reasoning was based on an empirical log-linear relationship between device complexity and time, observed over three data points.
He used this to justify that by 1975, devices with as many as 65,000 components would become feasible on a single silicon chip
occupying an area of only about one-fourth of a square inch. This projection turned out to be accurate with the fabrication of a 16K CCD
memory with about 65,000 components in 1975. In a subsequent paper in 1975, Moore attributed the log-linear relationship to
exponential behavior of die sizes, finer minimum dimensions, and "circuit and device cleverness". He went on to state that:
"There is no room left to squeeze anything out by being clever. Going forward from here we have to depend on
the two size factors - bigger dies and finer dimensions."
He revised his rate of circuit complexity doubling to 18 months and projected from 1975 onwards at this reduced rate. This curve came to
be known as "Moore's Law". Formally, Moore's Law states that circuit complexity doubles every eighteen months. This empirical
relationship has been amazingly resilient over the years both for microprocessors as well as for DRAMs. By relating component density
and increases in die-size to the computing power of a device, Moore's law has been extrapolated to state that the amount of computing
power available at a given cost doubles approximately every 18 months.
The limits of Moore's law have been the subject of extensive debate in the past few years. Staying clear of this debate, the issue of
translating transistors into useful OPS (operations per second) is the critical one. It is possible to fabricate devices with very large
transistor counts. How we use these transistors to achieve increasing rates of computation is the key architectural challenge. A logical
recourse to this is to rely on parallelism – both implicit and explicit. We will briefly discuss implicit parallelism in Section 2.1 and devote
the rest of this book to exploiting explicit parallelism.
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
The overall speed of computation is determined not just by the speed of the processor, but also by the ability of the memory system to
feed data to it. While clock rates of high-end processors have increased at roughly 40% per year over the past decade, DRAM access
times have only improved at the rate of roughly 10% per year over this interval. Coupled with increases in instructions executed per clock
cycle, this gap between processor speed and memory presents a tremendous performance bottleneck. This growing mismatch between
processor speed and DRAM latency is typically bridged by a hierarchy of successively faster memory devices called caches that rely on
locality of data reference to deliver higher memory system performance. In addition to the latency, the net effective bandwidth between
DRAM and the processor poses other problems for sustained computation rates.
The overall performance of the memory system is determined by the fraction of the total memory requests that can be satisfied from the
cache. Memory system performance is addressed in greater detail in Section 2.2. Parallel platforms typically yield better memory system
performance because they provide (i) larger aggregate caches, and (ii) higher aggregate bandwidth to the memory system (both typically
linear in the number of processors). Furthermore, the principles that are at the heart of parallel algorithms, namely locality of data
reference, also lend themselves to cache-friendly serial algorithms. This argument can be extended to disks where parallel platforms can
be used to achieve high aggregate bandwidth to secondary storage. Here, parallel algorithms yield insights into the development of
out-of-core computations. Indeed, some of the fastest growing application areas of parallel computing in data servers (database servers,
web servers) rely not so much on their high aggregate computation rates but rather on the ability to pump data out at a faster rate.
As the networking infrastructure evolves, the vision of using the Internet as one large heterogeneous parallel/distributed computing
environment has begun to take shape. Many applications lend themselves naturally to such computing paradigms. Some of the most
impressive applications of massively parallel computing have been in the context of wide-area distributed platforms. The SETI (Search
for Extra Terrestrial Intelligence) project utilizes the power of a large number of home computers to analyze electromagnetic signals from
outer space. Other such efforts have attempted to factor extremely large integers and to solve large discrete optimization problems.
In many applications there are constraints on the location of data and/or resources across the Internet. An example of such an
application is mining of large commercial datasets distributed over a relatively low bandwidth network. In such applications, even if the
computing power is available to accomplish the required task without resorting to parallel computing, it is infeasible to collect the data at
a central location. In these cases, the motivation for parallelism comes not just from the need for computing resources but also from the
infeasibility or undesirability of alternate (centralized) approaches.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks
Parallel computing has made a tremendous impact on a variety of areas ranging from computational simulations for scientific and
engineering applications to commercial applications in data mining and transaction processing. The cost benefits of parallelism coupled
with the performance requirements of applications present compelling arguments in favor of parallel computing. We present a small
sample of the diverse applications of parallel computing.
Parallel computing has traditionally been employed with great success in the design of airfoils (optimizing lift, drag, stability), internal
combustion engines (optimizing charge distribution, burn), high-speed circuits (layouts for delays and capacitive and inductive effects),
and structures (optimizing structural integrity, design parameters, cost, etc.), among others. More recently, design of
microelectromechanical and nanoelectromechanical systems (MEMS and NEMS) has attracted significant attention. While most
applications in engineering and design pose problems of multiple spatial and temporal scales and coupled physical phenomena, in the
case of MEMS/NEMS design these problems are particularly acute. Here, we often deal with a mix of quantum phenomena, molecular
dynamics, and stochastic and continuum models with physical processes such as conduction, convection, radiation, and structural
mechanics, all in a single system. This presents formidable challenges for geometric modeling, mathematical modeling, and algorithm
development, all in the context of parallel computers.
Other applications in engineering and design focus on optimization of a variety of processes. Parallel computers have been used to
solve a variety of discrete and continuous optimization problems. Algorithms such as Simplex, Interior Point Method for linear
optimization and Branch-and-bound, and Genetic programming for discrete optimization have been efficiently parallelized and are
frequently used.
The past few years have seen a revolution in high performance scientific computing applications. The sequencing of the human genome
by the International Human Genome Sequencing Consortium and Celera, Inc. has opened exciting new frontiers in bioinformatics.
Functional and structural characterization of genes and proteins hold the promise of understanding and fundamentally influencing
biological processes. Analyzing biological sequences with a view to developing new drugs and cures for diseases and medical
conditions requires innovative algorithms as well as large-scale computational power. Indeed, some of the newest parallel computing
technologies are targeted specifically towards applications in bioinformatics.
Advances in computational physics and chemistry have focused on understanding processes ranging in scale from quantum phenomena
to macromolecular structures. These have resulted in design of new materials, understanding of chemical pathways, and more efficient
processes. Applications in astrophysics have explored the evolution of galaxies, thermonuclear processes, and the analysis of extremely
large datasets from telescopes. Weather modeling, mineral prospecting, flood prediction, etc., rely heavily on parallel computers and
have very significant impact on day-to-day life.
Bioinformatics and astrophysics also present some of the most challenging problems with respect to analyzing extremely large datasets.
Protein and gene databases (such as PDB, SwissProt, and ENTREZ and NDB) along with Sky Survey datasets (such as the Sloan
Digital Sky Surveys) represent some of the largest scientific datasets. Effectively analyzing these datasets requires tremendous
computational power and holds the key to significant scientific discoveries.
With the widespread use of the web and associated static and dynamic content, there is increasing emphasis on cost-effective servers
capable of providing scalable performance. Parallel platforms ranging from multiprocessors to linux clusters are frequently used as web
and database servers. For instance, on heavy volume days, large brokerage houses on Wall Street handle hundreds of thousands of
simultaneous user sessions and millions of orders. Platforms such as IBMs SP supercomputers and Sun Ultra HPC servers power these
business-critical sites. While not highly visible, some of the largest supercomputing networks are housed on Wall Street.
The availability of large-scale transaction data has also sparked considerable interest in data mining and analysis for optimizing business
and marketing decisions. The sheer volume and geographically distributed nature of this data require the use of effective parallel
algorithms for such problems as association rule mining, clustering, classification, and time-series analysis.
As computer systems become more pervasive and computation spreads over the network, parallel processing issues become engrained
into a variety of applications. In computer security, intrusion detection is an outstanding challenge. In the case of network intrusion
detection, data is collected at distributed sites and must be analyzed rapidly for signaling intrusion. The infeasibility of collecting this data
at a central location for analysis requires effective parallel and distributed algorithms. In the area of cryptography, some of the most
spectacular applications of Internet-based parallel computing have focused on factoring extremely large integers.
Embedded systems increasingly rely on distributed control algorithms for accomplishing a variety of tasks. A modern automobile consists
of tens of processors communicating to perform complex tasks for optimizing handling and performance. In such systems, traditional
parallel and distributed algorithms for leader selection, maximal independent set, etc., are frequently used.
While parallel computing has traditionally confined itself to platforms with well behaved compute and network elements in which faults
and errors do not play a significant role, there are valuable lessons that extend to computations on ad-hoc, mobile, or faulty
environments.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks
[ Team LiB ]
This book provides a comprehensive and self-contained exposition of problem solving using parallel computers. Algorithms and metrics
focus on practical and portable models of parallel machines. Principles of algorithm design focus on desirable attributes of parallel
algorithms and techniques for achieving these in the contest of a large class of applications and architectures. Programming techniques
cover standard paradigms such as MPI and POSIX threads that are available across a range of parallel platforms.
Chapters in this book can be grouped into four main parts as illustrated in Figure 1.1. These parts are as follows:
Fundamentals This section spans Chapters2 through 4 of the book. Chapter 2, Parallel Programming Platforms, discusses the physical
organization of parallel platforms. It establishes cost metrics that can be used for algorithm design. The objective of this chapter is not to
provide an exhaustive treatment of parallel architectures; rather, it aims to provide sufficient detail required to use these machines
efficiently. Chapter 3, Principles of Parallel Algorithm Design, addresses key factors that contribute to efficient parallel algorithms and
presents a suite of techniques that can be applied across a wide range of applications. Chapter 4, Basic Communication Operations,
presents a core set of operations that are used throughout the book for facilitating efficient data transfer in parallel algorithms. Finally,
Chapter 5, Analytical Modeling of Parallel Programs, deals with metrics for quantifying the performance of a parallel algorithm.
Parallel Programming This section includes Chapters6 and 7 of the book. Chapter 6, Programming Using the Message-Passing
Paradigm, focuses on the Message Passing Interface (MPI) for programming message passing platforms, including clusters. Chapter 7,
Programming Shared Address Space Platforms, deals with programming paradigms such as threads and directive based approaches.
Using paradigms such as POSIX threads and OpenMP, it describes various features necessary for programming shared-address-space
parallel machines. Both of these chapters illustrate various programming concepts using a variety of examples of parallel programs.
Non-numerical Algorithms Chapters 9–12 present parallel non-numerical algorithms. Chapter 9 addresses sorting algorithms such as
bitonic sort, bubble sort and its variants, quicksort, sample sort, and shellsort. Chapter 10 describes algorithms for various graph theory
problems such as minimum spanning tree, shortest paths, and connected components. Algorithms for sparse graphs are also discussed.
Chapter 11 addresses search-based methods such as branch-and-bound and heuristic search for combinatorial problems.Chapter 12
classifies and presents parallel formulations for a variety of dynamic programming algorithms.
Numerical Algorithms Chapters 8 and 13 present parallel numerical algorithms. Chapter 8 covers basic operations on dense matrices
such as matrix multiplication, matrix-vector multiplication, and Gaussian elimination. This chapter is included before non-numerical
algorithms, as the techniques for partitioning and assigning matrices to processors are common to many non-numerical algorithms.
Furthermore, matrix-vector and matrix-matrix multiplication algorithms form the kernels of many graph algorithms. Chapter 13 describes
algorithms for computing Fast Fourier Transforms.
[ Team LiB ]
This document was created by an unregistered ChmMagic, please go to http://www.bisenter.com to register it. Thanks .
[ Team LiB ]
Many books discuss aspects of parallel processing at varying levels of detail. Hardware aspects of parallel computers have been
discussed extensively in several textbooks and monographs [CSG98, LW95, HX98, AG94, Fly95, AG94, Sto93, DeC89, HB84, RF89,
Sie85, Tab90, Tab91, WF84, Woo86]. A number of texts discuss paradigms and languages for programming parallel computersLB98, [
+
Pac98, GLS99, GSNL98, CDK 00, WA98, And91, BA82, Bab88, Ble90, Con89, CT92, Les93, Per87, Wal91]. Akl [Akl97], Cole [Col89],
Gibbons and Rytter [GR90], Foster [Fos95], Leighton [Lei92], Miller and Stout [MS96], and Quinn [Qui94] discuss various aspects of
parallel algorithm design and analysis. Buyya (Editor) [Buy99] and Pfister [Pfi98] discuss various aspects of parallel computing using
clusters. Jaja [Jaj92] covers parallel algorithms for the PRAM model of computation. Hillis H
[ il85, HS86] and Hatcher and Quinn H[ Q91]
discuss data-parallel programming. Agha [Agh86] discusses a model of concurrent computation based onactors. Sharp [Sha85]
addresses data-flow computing. Some books provide a general overview of topics in parallel computing [CL93, Fou94, Zom96, JGD87,
LER92, Mol93, Qui94]. Many books address parallel processing applications in numerical analysis and scientific computingDDSV99,
[
+
FJDS96, GO93, Car89]. Fox et al. [FJL 88] and Angus et al. [AFKW90] provide an application-oriented view of algorithm design for
problems in scientific computing. Bertsekas and Tsitsiklis [BT97] discuss parallel algorithms, with emphasis on numerical applications.
Akl and Lyons [AL93] discuss parallel algorithms in computational geometry. Ranka and Sahni RS90b] [ and Dew, Earnshaw, and
Heywood [DEH89] address parallel algorithms for use in computer vision. Green Gre91] [ covers parallel algorithms for graphics
applications. Many books address the use of parallel processing in artificial intelligence applications [Gup87, HD89b, KGK90, KKKS94,
Kow88, RZ89].
A useful collection of reviews, bibliographies and indexes has been put together by the Association for Computing Machinery [ACM91].
Messina and Murli [MM91] present a collection of papers on various aspects of the application and potential of parallel computing. The
scope of parallel processing and various aspects of US government support have also been discussed in National Science Foundation
reports [NSF91, GOV99].
A number of conferences address various aspects of parallel computing. A few important ones are the Supercomputing Conference,
ACM Symposium on Parallel Algorithms and Architectures, the International Conference on Parallel Processing, the International
Parallel and Distributed Processing Symposium, Parallel Computing, and the SIAM Conference on Parallel Processing. Important
journals in parallel processing include IEEE Transactions on Parallel and Distributed Systems, International Journal of Parallel
Programming, Journal of Parallel and Distributed Computing, Parallel Computing, IEEE Concurrency, and Parallel Processing Letters.
These proceedings and journals provide a rich source of information on the state of the art in parallel processing.
[ Team LiB ]
Random documents with unrelated
content Scribd suggests to you:
eastern borders of Ko-gu-ryŭ. Nominally Ko-gu-ryŭ held sway even
to the Japan Sea but practically the wild tribes roamed as yet at will
all through the eastern part of the peninsula. In the eighth year of
On-jo’s reign, 10 B.C., the Mal-gal forces besieged his capital and it
was only after a most desperate fight that they were driven back.
On-jo found it necessary to build the fortresses of Ma-su-sŭng and
Ch’il-chung-sŭng to guard against such inroads. At the same time
the Sŭn-bi were threatening Ko-gu-ryŭ on the north, but Gen. Pu
Bun-no lured them into an ambush and routed them completely. The
king rewarded him with land, horses and thirty pounds of gold, but
the last he refused.
The next year the wild men pulled down the fortresses lately
erected by King On-jo and the latter decided that he must find a
better site for his capital. So he moved it to the present site of Nam-
han, about twenty miles from the present Seoul. At the same time
he sent and informed the king of Ma-han that he had found it
necessary to move. The following year he enclosed the town in a
wall and set to work teaching agriculture to the people throughout
the valley of the Han River which flowed near by.
In the year which saw the birth of Christ the situation of affairs in
Korea was as follows. In the north, Ko-gu-ryŭ, a vigorous, warlike
kingdom, was making herself thoroughly feared by her neighbors; in
the central western portion was the little kingdom of Păk-je, as yet
without any claims to independence but waiting patiently for the
power of Ma-han so to decline as to make it possible to play the
serpent in the bosom as Wi-man had done to Ki-ja’s kingdom. In the
south was Sil-la, known as a peaceful power, not needing the sword
because her rule was so mild and just that people from far and near
flocked to her borders and craved to become her citizens. It is one
of the compensations of history that Sil-la, the least martial of them
all, in an age when force seemed the only arbiter, should have finally
overcome them all and imposed upon them her laws and her
language.
Chapter VII.
Change of Ko-gu-ryu capital.... Sil-la raided.... Legend of Suk-ta’l-ba.... fall of Ma-
han.... beginning of Chinese enmity against Ko-gu-ryu....the three kingdoms
differentiated.... King Yu-ri degraded.... extension of Ko-gu-ryu.... Japanese
corsairs... remnant of Ma-han revolts.... fall of Pu-yu.... origin of in-gum....
siege of Ko-gu-ryu capital raised.... Sil-la’s peaceful policy.... patronymics....
official grades.... unoccupied territory.... kingdom of Ka-rak.... legends....
position.... dependencies.
We have now come to the events which marked the rise of the
great Yŭn power in Liao-tung. They are so intimately connected with
the history of Ko-gu-ryŭ that we must give them in detail. For many
years there had been a Yŭn tribe in the north but up to the year 320
it had not come into prominence. It was a dependency of the Tsin
dynasty of China. Its chiefs were known by the general name Mo
Yong. In 320 Mo Yong-we was the acting chief of the tribe. He
conceived the ambitious design of overcoming China and founding a
new dynasty. The Emperor immediately despatched an army under
Gen. Ch’oe-bi to put down the incipient rebellion. Ko-gu-ryŭ and the
U-mun and Tan tribes were called upon to render assistance against
the rebels. All complied and soon the recalcitrant chieftain found
himself besieged in Keuk Fortress and was on the point of
surrendering at discretion when an event occurred which, fortunately
for him, broke up the combination and raised the siege. It was
customary before surrendering to send a present of food to the one
who receives the overtures of surrender. Mo Yong-we, in pursuance
of this custom, sent out the present, but for some reason it found its
way only into the camp of the U-mun forces while the others
received none. When this became known the forces of Ko-gu-ryŭ,
believing that Mo Yong-we had won over the U-mun people to his
side, retired in disgust and the Chinese forces, fearing perhaps a
hostile combination, likewise withdrew. The U-mun chiefs resented
this suspicion of treachery and vowed they would take Mo Yong-we
single-handed. But this they could not do, for the latter poured out
upon them with all his force and scattered them right and left. From
this point dates the rise of Yŭn. Gen. Ch’oe-bi fearing the wrath of
the Emperor fled to Ko-gu-ryŭ where he found asylum. Here the
affair rested for a time. The kingdom of Yŭn forebore to attack Ko-
gu-ryŭ and she in turn was busy strengthening her own position in
view of future contingencies. Ten years passed during which no
events of importance transpired. In 331 Eul-bul the king of Ko-gu-
ryŭ died and his son Soé began his reign by adopting an active
policy of defense. He heightened the walls of P’yŭng-yang and built
a strong fortress in the north, called Sin-sŭng. He followed this up by
strengthening his friendly relations with the court of China. These
facts did not escape the notice of the rising Yŭn power. Mo Yong-
whang, who had succeeded Mo Yong-we, hurled an expedition
against the new Sin-sŭng Fortress and wrested it from Ko-gu-ryŭ.
The king was compelled, much against his will, to go to Liao-tung
and swear fealty to the Yŭn power. Two years later the capital was
moved northward to Wan-do, in the vicinity of the Eui-ju of today.
This was done probably at the command of Yŭn who desired to have
the capital of Ko-gu-ryŭ within easy reach in case any complications
might arise.
Mo Yong-whang desired to invade China without delay but one of
his relatives, Mo Yong-han, advised him to disarm Ko-gu-ryŭ and the
U-mun tribe so that no possible enemy should be left in his rear
when he marched into China. It was decided to attack Ko-gu-ryŭ
from the north and west, but the latter route was to be the main
one, for Ko-gu-ryŭ would be expecting the attack from the north.
The strategem worked like a charm. Mo Yong-han and Mo Yong-p’ă
led a powerful army by way of the sea road while General Wang-u
led a decoy force by the northern route. The flower of the Ko-gu-ryŭ
army, 50,000 strong, marched northward under the king’s brother
Mu to meet an imaginary foe while the king with a few undisciplined
troops held the other approach. As may be supposed, the capital fell
speedily into the enemy’s hands but the king escaped. The Ko-gu-
ryŭ forces had been successful in the north and might return any
day, so the Yun forces were forbidden to go in pursuit of the king. To
insure the good behavior of the king, however, they burned the
palace, looted the treasure, exhumed the body of the king’s father
and took it, together with the queen and her mother, back to the
capital of Yŭn. With such hostages as these Yŭn was safe from that
quarter. The next year the king offered his humble apologies and
made a complete surrender, in view of which his father’s body and
his queen were returned to him but his mother-in-law was still held.
The same year Ko-gu-ryŭ moved her capital back to P’yŭng-yang. A
few years later by sending his son as substitute he got his mother-
in-law out of pawn.
In 344 new complications grew up between Sil-la and Japan. The
Japanese having already obtained one Sil-la maiden for a queen
made bold to ask for a royal princess to be sent to wed their king.
This was peremptorily refused and of course war was the result. A
Japanese force attacked the Sil-la coastguard but being driven back
they harried the island of P‘ung-do and finally worked around until
they were able to approach the capital. Finding the gates fast shut
they laid siege to the city. But their provisions were soon exhausted
and they were compelled to retire. Then the Sil-la forces swarmed
out and attacked them in the rear and put them to an ignominious
flight. Some years later the Japanese made a similar attempt but
were outwitted by the Sil-la soldiers who made manikins of grass to
represent soldiers, and the Japanese, seeing these, supposed that
Sil-la had been reinforced and so retired from the contest.
Ko-gu-ryŭ had been so severely handled by her northern neighbor
that she gave up for the time being her plans of conquest in that
direction. Instead of this she turned her attention toward her
southern neighbor Păk-je whose territory was a morsel not to be
despised. About the year 360 she erected a fort at Ch’i-yang not far
from the Păk-je capital which was then at Nam-han. Into this she
threw a large force consisting of 20,000 infantry and cavalry. They
began a systematic plundering of Păk-je. The army of the latter,
under the leadership of the Crown Prince, fell suddenly upon this fort
and gained a victory, for, when the Ko-gu-ryŭ forces retired, they left
5,000 dead upon the field. Păk-je followed up this victory by
throwing up a line of breastworks along the southern bank of the
Han river to insure against a future surprise on the part of her
unscrupulous northern neighbor. But Păk-je’s victories had shown her
the weakness of Ko-gu-ryŭ and reprisals were therefore in order. She
equipped an army of 30,000 men and penetrated the country of the
enemy. She met no resistance until her army stood beneath the
walls of P‘yŭng-yang. An attempt was made to storm the town,
during which the king of Ko-gu-ryŭ was mortally wounded by an
arrow, but the assault failed and the Păk-je army withdrew in good
order. The king of Păk-je, elated over so many evidences of his
growing power, promptly moved his capital across the Han River into
Ko-gu-ryŭ territory. Some say he settled at Puk-han the great
mountain fortress back of Seoul while others say he settled at Nam
P’yŭng-yang or “South P’yŭng-yang,” by which is meant the present
city of Seoul. Others still say it was at a point a short distance
outside the east gate of Seoul. But in spite of the apparent
successes of Păk-je it appears that the people were not satisfied. It
may be that military exactions had alienated their good will, or it
may be that they saw in these ambitious advances the sure presage
of speedy punishment at the hands of Ko-gu-ryŭ; but whatever the
cause may have been over a thousand people fled from Păk-je and
found asylum in Sil-la. The king set aside six villages as their place of
residence, and when Păk-je demanded to have them sent back
answer was returned that Sil-la could not drive from her borders
those who had sought asylum from the ill-treatment of Păk-je.
Three years before this, in 372, the Chinese had gained a signal
victory over the Yŭn kingdom and its king, Mo Yong-p’ung, had fled
for safety to Ko-gu-ryŭ. It must have been his last resource, for he
was likely to find little sympathy there. And so it proved for the king
immediately seized him and sent him a captive to China.
The year 372 beheld an event of prime importance in the history
of Ko-gu-ryŭ and of the whole peninsula. It was the introduction of
Buddhism. It is probable that before this time some knowledge of
Buddhism was current in Korea, but as it is eminently a sacerdotal
institution but little more than indefinite reports could have been
circulated previous to the coming of the monks. We are not told
whether this was done at the request of Ko-gu-ryŭ or whether it was
at the advice of Pu-gyŭn, one of the petty kings who then divided
between them the north of China. Be that as it may, in 372 A.D.
images of Buddha were brought by a monk, Sun-do, and also a
Buddhist book called Pul-gyŭng. For this the king of Ko-gu-ryŭ
returned hearty thanks and forthwith set his son and heir to learning
the new doctrine. At the same time he gave an impetus to the study
of the Confucian code. It is quite probable that to this new departure
is due the fact that the next year the laws of the country were
overhauled and put in proper shape for use. In 375 two great
monasteries were built in the capital of Ko-gu-ryŭ. They were called
Cho-mun and I-bul-lan. It should be noticed that the introduction of
Buddhism into Korea was a government affair. There had been no
propagation of the tenets of this cult through emmisaries sent for
the purpose, there was no call for it from the people. In all
probability the king and his court were pleased at the idea of
introducing the stately ceremonial of the new faith. In fact it was a
social event rather than a religious one and from that date to this
there has not been a time when the people of Korea have entered
heartily into the spirit of Buddhism, nor have her most distinguished
representatives understood more than the mere forms and trappings
of that religion which among all pagan cults is the most mystical.
Păk-je was not long in following the example of her powerful
neighbor. In the year 384 a new king ascended the throne of Păk-je.
His name was Ch’im-yu. One of his first acts was to send an envoy
to China asking that a noted monk named Mararanta be sent to Păk-
je to introduce the Buddhist ritual. We notice that this request was
sent to the Emperor Hyo-mu (Hsia-wu), the proper head of the
Eastern Tsin dynasty, while Ko-gu-ryŭ had received hers at the
hands of one of those petty kings who hung upon the skirts of the
weakening dynasty and waited patiently for its dissolution. Each of
these petty states, as well as the central government of the Tsin,
was on the lookout for promising allies and such a request as this of
Păk-je could scarcely be refused. Mararanta, whose name smacks of
the south and who certainly cannot have been a Chinaman, was sent
to the Păk-je capital. He was received with open arms. His
apartments were in the palace where he soon erected a Buddhist
shrine. Ten more monks followed him and Buddhism was firmly
established in this second of the three Korean states. The greatest
deference was paid to these monks and they were addressed by the
honorific title To-seung. Sil-la received Buddhism some fifty years
later.
All this time fighting was almost continuous along the Ko-gu-ryŭ-
Păk-je border. The latter stood on the defensive and found it
necessary in 386 to build a line of breastworks along the border,
extending from Ch’ŭng-mok-yŭng northward to P’al-gon-sung and
thence westward to the sea. An amnesty was brought about through
a happy accident. A groom who had accidentally broken the leg of a
Păk-je prince’s horse had fled to Ko-gu-ryŭ to escape punishment.
Returning now to Păk-je, he purchased pardon by informing the king
that if, in battle, the Păk-je forces should direct their whole force
against that part of the enemy’s line where they should see a red
flag flying they would surely be successful. This turned out to be
true and Păk-je was once more successful, but followed up her
success only to the extent of securing a definite cessation of
hostilities and the erection of a boundary stone at Su-gok-sŭng to
witness forever against him who should dispute the point. But when
King Ch’im-yu of Ko-gu-ryŭ died in 392 and his son Tam-dok came
into power all previous obligations were swept away and he
proceeded to reopen the wound. He attacked Păk-je fiercely and
took ten of her towns. Then he turned northward and chastised the
Kŭ-ran tribe. When this was done he came back to the charge again
and seized Kwang-nu Fortress. This was an almost inaccessible
position on a high rock surrounded by the sea, but the hardy soldiers
of Ko-gu-ryŭ after twenty days of siege found seven paths by which
the wall could be reached, and they finally took the place by a
simultaneous assault at these various points. When the court of Păk-
je heard of this well-nigh impossible feat, all hope of victory in the
field was taken away, and they could only bar the gates of the
capital and await the turn of events. This king, Tam-dok, was as
enthusiastically Buddhistic as his father. He made a decree that all
the people of Ko-gu-ryŭ should adopt the Buddhistic faith and a few
years later built nine more monasteries in P’yŭng-yang.
A year later King A-sin of Păk-je sent his son, Chön-ji, to Japan as
an envoy. It is likely, but not certain, that it was a last resource of
Păk-je to secure help against Ko-gu-ryŭ. This is the more likely from
the fact that he went not only as an envoy but also as a hostage, or
a guarantee of good faith. If this was the hope of Păk-je it failed, for
no Japanese army was forthcoming. As another means of self-
preservation King A-sin formed a great school of archery, but the
people did not like it; for exercise in it was compulsory, and many of
the people ran away.
In 399 Ko-gu-ryŭ sent an envoy to the Yŭn capital to pay her
respects, but the king of that country charged Ko-gu-ryŭ with
ambitious designs and sent an army of 30,000 men to seize the
fortresses of Sin-sŭng and Nam-so, thus delimiting the frontier of
Ko-gu-ryŭ to the extent of 700 li. They carried back with them 5,000
“houses,” which means approximately 25,000 people, as captives. It
is difficult to believe this enumeration unless we conclude that it
means that the people living within the limit of the 700 li were taken
to be citizens of Yŭn.
The fifth century of our era dawned upon a troubled Korea. The
tension between the three rival powers was severe, and every nerve
was strained in the struggle for preeminence. In 402 Nă-mul, the
king of Sil-la, died and Sil-sŭng came to the throne. He sent out
feelers in two directions, one toward Ko-gu-ryŭ in the shape of a
hostage, called by euphemism an envoy, and another of the same
sort to Japan; which would indicate that Sil-la was still suffering from
the depredations of the Japanese corsairs. The envoy to Ko-gu-ryŭ
was the king’s brother, Pok-ho, and the one to Japan was also his
brother, Mi-sa-heun. We remember that Păk-je already had an envoy
in Japan in the person of the king’s eldest son Chön-ji. Now in 405
the king of Păk-je died. Chön-ji was the rightful heir but as he was in
Japan the second son should have assumed the reins of
government. As a fact the third son Chŭng-nye killed his brother and
seized the scepter. Hearing of his father’s death, Chön-ji returned
from Japan with an escort of a hundred Japanese, but learning of his
brother’s murder he feared treachery against himself and so landed
on an island off the coast where he remained until the people, with
a fine sense of justice, drove Ch’ăm-nye from the throne and
welcomed back the rightful heir.
Meanwhile interesting events were transpiring in Sil-la. In 403 Sil-
sung, King of that land, fearing lest harm overtake his two brothers
whom he had sent the year before to Ko-gu-ryŭ and Japan, was
seeking for some means of getting them back. This might not be an
easy thing to do, for to ask their return so soon would perhaps
arouse the suspicion of these neighbors, and precipitate a war. Ko-
gu-ryŭ had often taken up arms for a less affront than this. An
official, Pak Che-san, volunteered to undertake this delicate mission
even though it cost him his life. He went first to Ko-gu-ryŭ and there
proved so skillful a diplomat that he soon brought Prince Pok-ho
back to Sil-la. The mission to Japan was a different matter, but he
was equal to the occasion. Before starting out he said to the king: “I
will bring the Prince back though it cost my life; only, before I go, I
must ask you to imprison my family; otherwise I cannot succeed.”
The king acceded to this strange request and Pak Che-san, starting
immediately as if in flight, without even changing his garments, fled
until he came to the Yul Harbor. Even his wife he repulsed,
exclaiming “I have determined to die.” He apparently feared that the
sight of her might shake his loyal purpose. He arrived in Japan as a
political fugitive, but the king suspected him until news came that
his family had been imprisoned. This seemed to prove his statement
and he was received graciously. He pretended that he wished to lead
a Japanese force against Sil-la. Mi-sa-heun, the Prince whom he had
come to rescue, was in the secret and heartily seconded the plan.
The king made them joint leaders of an expedition. The fleet arrived
at a certain island and there Pak succeeded in spiriting Mi-sa-heun
away by night in a little boat while he himself remained behind, to
delay the inevitable pursuit. Mi-sa-heun begged him with tears to
accompany him but he refused to jeopardise Mi-sa-heun’s chances of
escape by so doing. In the morning he pretended to sleep very late
and no one suspected the flight of the Prince until late in the day
when concealment was no longer possible. When the Japanese
found that they had been duped they were in a terrible rage. They
bound Pak and went in pursuit of the run-away. But a heavy fog
settled upon the sea and frustrated their plan. Then they tortured
their remaining victim and to their inquiries he replied that he was a
loyal subject of Kye-rim (the name of Sil-la at that time) and that he
would rather be a Kye-rim pig than a subject of Japan; that he
would rather be whipped like a school-boy in Kye-rim than receive
office in Japan. By these taunts he escaped a lingering death by
torture. They burned him alive there on the island of Mok-do. When
the king of Sil-la heard of his brave end he mourned for him and
heaped upon him posthumous honors, and Mi-sa-heun married his
preserver’s daughter. The wife of the devoted Pak ascended the pass
of Ap-sul-yŭng whence she could obtain a distant view of the islands
of Japan. There she gave herself up to grief until death put an end
to her misery.
In 413 a new king came to the throne of Ko-gu-ryŭ. called Kö-
ryŭn. As China and Ko-gu-ryŭ had been kept apart by the
intervening Yun, and had acquired some power of sympathy through
mutual fear of that power, we are not surprised that the new king of
Ko-gu-ryŭ condescended to receive investiture from the Emperor, nor
that the latter condescended in turn to grant it. It was formally
done, and the act of Ko-gu-ryŭ proclaimed her vassalage to China.
From that time on excepting when war existed between them, the
kings of Ko-gu-ryŭ were invested by the Emperor with the insignia of
royalty. Two years later the Emperor conferred the same honor upon
the king of Păk-je. It was always China’s policy to keep the kingdoms
at peace with each other so long as they all wore the yoke of
vassalage; but so soon as one or the other cast it off it was her
policy to keep them at war.
In 417 Nul-ji came to the throne of Sil-la and began a reign that
was to last well on toward half a century. He was a regicide. He had
been treated very harshly by the king and had more than once
narrowly escaped with his life. It is therefore the less surprising,
though none the less reprehensible, that when the opportunity
presented of paying off old scores he succumbed to the temptation.
He ascended the throne not with the title of I-sa-geum, which had
been the royal title for centuries, but with the new title of Ma-rip-
kan. However doubtful may have been his title to the crown his
reign was a strong one. Among the far-reaching effects of his reign
the introduction of carts to be drawn by oxen was the most
important.
The friendly relations of Ko-gu-ryŭ with the Tsin dynasty were cut
short by the extinction of that dynasty in 419 but in 435 Ko-gu-ryŭ
made friendly advances toward the Northern Wei dynasty and,
finding sufficient encouragement, she transferred her allegience to
that power. Meantime Păk-je had transferred hers to the Sung
dynasty which arose in 420.
It was in 436 that P’ung-hong, the “Emperor” of Yun, found
himself so weak that he could not withstand the pressure from the
Chinese side and asked the king of Ko-gu-ryŭ to grant him asylum.
Consent was given and an escort was sent to conduct him to the Ko-
gu-ryŭ capital. He found that this sort of life had its drawbacks; for,
to begin with, the king did not address him as emperor but simply as
king. This was a great affront to his dignity and, though he was
treated very handsomely, he assumed such a supercillious bearing
that the king had to curtail his retinue and his income. He had been
given quarters in Puk-p’ung and from there the mendicant emperor
applied to the Sung Emperor for asylum. It was granted, and seven
thousand soldiers came to escort him; but ere they arrived the king
of Ko-gu-ryŭ sent two generals, Son-su and Ko-gu, who killed the
imperial refugee and nine of his attendants. The Sung troops,
arriving on the instant, discovered the crime and caught and
executed the two generals who had perpetrated it.
In 449 a Ko-gu-ryŭ general was out on a hunting expedition and
the chase brought him into Sil-la territory near the present town of
Kang-neung. The prefect of the district, in an excess of patriotic
enthusiasm, seized him and put him to death. An envoy came in
haste to the Sil-la capital demanding why this outrage had been
committed. War would have been declared on the spot had not Sil-la
been profuse in apologies. She might have spared herself this
humiliation for war was sure to break out soon in any case. When ng
came to the throne of Păk-je in 455, Ko-gu-ryŭ took advantage of
the confusion, consequent upon the change, to attack her. Sil-la,
who, though ordinarily a peaceful power, had been perforce drawn
into war-like operations and had acquired some military skill, now
sided with Păk-je. Sending a considerable number of troops she
reinforced Păk-je to the extent of warding off the threatened
invasion. But Păk-je, though glad to find herself extricated from her
position of danger, would allow no feelings of gratitude to stand in
the way of her ancient feud against Sil-la; so this act of friendship
not only did not help toward peace but on the contrary, by showing
Sil-la the fickleness of Păk-je, made peace all the more impossible.
The middle of the fifth century marks the point when all friendly
relations between the three Korean states were broken off and an
actual state of war existed between them from this time on, though
active military operations were not constant. This we may call the
Triangular War.
The key to this great struggle, which resulted in the advancement
of Sil-la to the control of the whole peninsula, lay not so much in the
relative military strength of the three rival kingdoms as in the skill
which each developed in diplomacy. Each was trying to gain the
active support of China, knowing very well that if China should once
become thoroughly interested in favor of any one of the three
powers the other two would be doomed.
We will remember that Ko-gu-ryŭ had cultivated friendly relations
with the Sung dynasty while Păk-je had made herself agreeable to
the Wei dynasty. In this Păk-je chose the wiser part for the Wei
power was nearer and more powerful. In 466 Ko-gu-ryŭ lost a
splendid opportunity to establish herself in the good graces of the
Wei Emperor, and so insure her preeminence in the peninsula. The
Emperor Hsien-wen made friendly advances and requested the
daughter of the king of Ko-gu-ryŭ for his wife. With a short-
sightedness that is quite inexplicable this request was put off by the
lame excuse that his daughter was dead. This being easily proved a
falsehood, Ko-gu-ryŭ fell from the good graces of the very power
whose friendship she should have cultivated.
The year 467 witnessed an important innovation in Korea. Sil-la
took the lead in the construction of war vessels. The one made at
that time was doubtless intended for use against the Japanese
corsairs. That Sil-la had been gaining along military lines is shown by
her successful repulse of a Ko-gu-ryŭ invasion in this year, in which
the wild people of some of the Mal-gal tribes assisted Ko-gu-ryŭ.
After the latter had been driven back, Sil-la built a fortress at Po-eun
on her northern border to guard against a repetition of this invasion.
Ko-gu-ryŭ and Păk-je were now exerting themselves to the utmost
to make capital out of their Chinese alliances. Ko-gu-ryŭ sent rich
presents and richer words to the Sung capital and so won the
confidence of that power. Păk-je, on the other hand, sent word to
the Wei Emperor that Ko-gu-ryŭ was coquetting with the Sung court
and with the wild Mal-gal tribes, insinuating that this was all
detrimental to the interests of Păk-je’s patron.
As this was without result, she sent and asked openly that the Wei
Emperor send an army and chastise Ko-gu-ryŭ. The Emperor replied
that until Ko-gu-ryŭ committed some overt act of more hostile
import than the mere cementing of peaceful alliances no notice
could be taken of her. In other words the Wei power refused to be
the aggressor, much to Păk-je’s chagrin. The Wei Emperor sent this
answer by way of Ko-gu-ryŭ and the king of that country was
ordered to grant the messenger a safe conduct through his territory.
But Ko-gu-ryŭ, as though bent on self-destruction, refused to let him
pass, and so the great northern kingdom approached one step
nearer the precipice which was to prove her destruction. Upon
learning the news of this affront the Emperor was highly incensed
and tried to send the messenger by way of a southern port; but
stress of weather rendered this impossible and Păk-je, receiving no
answer to her missive, took offense and would have nothing more to
do with China, for a time. By the time she had recovered her temper,
Ko-gu-ryŭ had in some way patched up her difficulty with the Wei
court and so scored a point against Păk-je. And for a time she was
on friendly terms with both the Wei and Sung dynasties.
At this point Ko-gu-ryŭ decided upon a bold attempt to swallow
Păk-je bodily. It was to be done partly by strategem and partly by
force. A monk of Ko-gu-ryŭ named To-rim, a fellow of excellent craft,
arrived at the Păk-je capital as if seeking refuge. The king received
him with open arms and, finding him an excellent chess player, made
him his trusty councilor. This monk told the king that the palaces,
walls, tombs and public buildings ought to be thoroughly repaired,
and so induced him to drain the public treasury in this work, and
also in bringing a huge monolith from Uk-nyi to the capital. This
done the monk fled back to Ko-gu-ryŭ and announced that the
treasury of Păk-je was empty and it was a good time to attack her. A
large army was put in the field, guided by one Kŭl-lu, a Păk-je
fugitive from justice. Almost before Păk-je was aware, her capital
was surrounded. She had applied to Sil-la for help, but too late. First
the suburbs were laid in ashes, and then access being gained, the
palace was fired. The king fled with ten attendants out the west
gate, but Kŭl-lu the renegade followed and overtook him. The king
begged for mercy upon his knees but Kŭl-lu spit thrice in his face,
bound him and sent him to the fortress of A-han where lie was
killed. Then the Ko-gu-ryŭ army went back north carrying with them
8,000 captives, men and women.
Meanwhile Prince Mun-ju had obtained help from Sil-la and with
10,000 troops was hastening homewards. He found the city in
ashes, his father dead, the people mourning their lost, who had
been dragged away captive. He promptly assumed control of affairs,
moved the capital southward to Ung-jin the present Kong-ju, took all
the Păk-je people away from Han-yang (Seoul) and moved them
back across the Han River and abandoned all the territory beyond
that natural barrier to Ko-gu-ryŭ to whom it had originally belonged.
The following year he tried to send a message to the Sung Emperor
by way of Ko-gu-ryŭ but the messenger was intercepted and the
message stopped.
Chapter X.
Quelpart.... origin of T’am-na.... new alliances.... advances in Sil-la.... but not in
Păk-je nor Ko-gu-ryŭ.... temporary peace.... Buddhism in Sil-la.... remnants of
barbarism.... influence of Chinese literature.... important reforms.... Ko-gu-
ryŭ’s foreign relations.... conquest of Dagelet Island.... posthumous titles....
colors in official grades.... Wei displeased.... the “miracle” of Yi Cha-don....
end of Ka-rak.... Sil-la rejects Chinese calendar.... confusion in China.... Păk-je
attempts reform.... history of Sil-la.... two alliances.... Păk-je and Ko-gu-ryŭ
envoys to China.... advance of Buddhism in Sil-la.... music in Sil-la.... war
between Păk-je and Sil-la.... retrogression in Sil-la because of Buddhism....
Ko-gu-ryŭ and the Sui Emperor.... the Ondali.
Tradition says that in the dawn of history when the island of Che-
ju (Quelpart) was covered only with a tangled forest three sages
arose from a crevice in the ground. This spot is shown to this day by
the people of Che-ju. These three men were Ko-ŭlla, Yang-ŭlla and
Pu-ŭlla. As they stood upon the shore they saw three stout chests
floating in from the south-east. Drawing them to land and opening
them the three wise men discovered that each chest contained a
calf, a colt, a dog, a pig and a woman, together with sundry seeds,
such as beans, wheat, barley, millet and rice. By the three families
thus organised the island was populated. During the early days of
Sil-la a certain court astrologer announced that the “Friend Star” was
visible in the south and that a distinguished visitor would soon
arrive. Soon after this three men came by boat from Quelpart,
landing at the harbor of T’am-jin, now Kang-jin. They came straight
to the court of Sil-la where they were hospitably entertained. One of
the visitors was Ko-hu, one was Ko-ch’ŭng, but the name of the third
is lost. The king called the first Sŭng-ju or “Lord of the Star,” the
second Wang-ja or “King’s Son” and the third To-nă or “The One
who has Come.” He named their country T’am from the name of the
port where they landed, and na, which seems to have meant
“Kingdom”, for we find that the last syllable of Sil-la is this same na
changed by euphonic laws to la. It is the root of the present Korean
word na-ra or “kingdom.” So the kingdom was called T’am-na. The
authorities are at a loss to tell the date or even the reign during
which these events transpired. In the year 477 the little kingdom of
T’am-na sent an envoy to the court of Păk-je with gifts. This is the
first really authentic mention of the place. If tradition is of any value
it must be confessed that the story of the peopling of Quelpart
points toward a southern origin.
In 479 the aged king of Ko-gu-ryŭ, Kö-ryŭn, now in the sixty-
eighth year of his reign, sought and obtained recognition from
Emperor Ko-je (Kao-ti) the founder of the Ch’i dynasty in China. That
this occurred in the very first year after the founding of that dynasty
shows how sedulously Ko-gu-ryŭ was cultivating the good-will of the
Chinese. Păk-je was not far behind, for she swore allegiance to the
same Emperor only two years later.
During all these years it is to Sil-la that we must look for any signs
of internal improvement, any of those innovations which are the
mile-stones of progress. We saw above how she introduced the use
of the cart and so raised a great burden from the shoulders of the
people. The wheel is the great burden bearer of history. And now we
find her introducing further reforms. The first was the horse relay
system called the yong-ma. It did not bear so directly upon the
condition of the people but it afforded an opportunity for the rapid
transmission of official information and thus indirectly had an
important bearing upon the welfare of the masses. In the next place,
she organised a general market where at stated intervals merchants
from the various districts could meet and exchange commodities.
These are things that we look upon as matters of course and we do
not realise their importance till we imagine ourselves deprived of the
comforts that spring from the possibility of rapid communication and
exchange of commodities. That Ko-gu-ryŭ had not made similar
advances in the line of industrial reform is shown by the fact that
when the Emperor of the Wei dynasty sent to grant investiture to
Na-un the twenty-first king of Ko-gu-ryŭ in 499 he presented him
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookultra.com