rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Scheduling for Parallel Processing
  name:
    name part: Drozdowski, Maciej.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxk
    date issued: 2009
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIV, 386 p. 100 illus. online resource.
  abstract: To take full advantage of high performance computing, parallel applications must be carefully managed to guarantee quality of service and fairness in using shared resources. Scheduling for parallel computing is an interdisciplinary subject joining many fields, and the broadness of research yields an immense number and diversity of models for understanding scheduling problems. This focused and useful book presents scheduling models for parallel processing, problems defined on the grounds of certain scheduling models, and algorithms solving the scheduling problems. As most of the scheduling problems are combinatorial in nature, the methodology of computational complexity theory is examined. Four examples of scheduling models are presented, along with problems and algorithms, before drawing conclusions on their mutual relationships. The book also provides helpful generalizations about scheduling models, their problems and algorithms. Topics and features: Introduces the fundamental scheduling concepts and clarifies the relation between scheduling models, problems, algorithms, and schedules Discusses the technological aspects of scheduling for parallel processing, demonstrating how highly abstract scheduling policies are determined by the underlying hardware and software Presents the notions, concepts, and algorithms that are most immediately applicable in parallel processing, including relevant aspects of classic scheduling theory Examines the parallel task model, analyzing rigid, moldable, malleable tasks, and tasks with shape Outlines the methodology of computational complexity theory and introduces the basic metrics of parallel application performance Explores scheduling with communication delays, taking into account the costs of delays Examines scheduling divisible loads in systems with limited memory, various interconnection types, and cost of usage Includes detailed illustrations, a comprehensive bibliography, and a helpful notation section This unique text will b…
  table of contents: Basics -- Vision of Scheduling in Parallel Systems -- Classic Scheduling Theory -- Parallel Tasks -- Scheduling with Communication Delays -- Divisible Loads -- Back to Scheduling Models.
  note: by Maciej Drozdowski.
  subject:
    topic: Computer science
  subject:
    topic: Operations research
  subject:
    topic: Decision making
  subject:
    topic: Computer system failures
  subject:
    topic: Operating systems (Computers)
  subject:
    topic: Algorithms
  subject:
    topic: Management information systems
  subject:
    topic: Management science
  subject:
    topic: Computer Science
  subject:
    topic: Operating Systems
  subject:
    topic: System Performance and Evaluation
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Management of Computing and Information Systems
  subject:
    topic: Operations Research, Management Science
  subject:
    topic: Operation Research/Decision Theory
  classification: QA76.76.O63
  classification: 005.43
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Computer Communications and Networks
  identifier: 9781848823105
  identifier: http://dx.doi.org/10.1007/978-1-84882-310-5
  record info:
    record creation date: 110414
    record change date: 20151204163321.0
    record identifier: 978-1-84882-310-5