Entry Gazdag:1989:CCS from ibmsysj.bib

Last update: Thu Nov 27 02:08:39 MST 2008                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Gazdag:1989:CCS,
  author =       "J. Gazdag and H.-H. Wang",
  title =        "Concurrent computing by sequential staging of tasks",
  journal =      j-IBM-SYS-J,
  volume =       "28",
  number =       "4",
  pages =        "646--660",
  year =         "1989",
  CODEN =        "IBMSA7",
  ISSN =         "0018-8670",
  bibdate =      "Tue Mar 19 17:38:46 1996",
  abstract =     "Described is a new approach to parallel formulation of
                 scientific problems on shared-memory multiprocessors
                 such as the IBM ES/3090 system. The class of problems
                 considered is characterized by repetitive operations
                 applied over the computational domain D. In each such
                 operation, some fields of interest are extrapolated or
                 advanced by an amount of Delta tau. The integration
                 variable tau may be time, distance, or iteration
                 sequence number, depending on the problem under
                 consideration. An extensively studied approach to
                 parallel formulation of such computational problems is
                 based on domain decomposition, which attempts to
                 partition the domain of integration into many pieces,
                 then construct the global solution from these local
                 solutions. Thus, domain decomposition methods are
                 confined to D alone at a single tau level. An inquiry
                 into the possibilities of formulating parallel tasks in
                 tau, or more significantly in the D* tau domain, opens
                 up new horizons and untapped opportunities. The aim of
                 this paper is to detail an approach to exploit this tau
                 domain parallelism that will be referred to as
                 sequential staging of tasks (SST). Concurrency is
                 realized by means of ordering the tasks sequentially
                 and executing them in a partially overlapped or
                 pipelined manner. The SST approach can yield remarkable
                 speedup for jobs requiring intensive paging I/O, even
                 when a single processor is available for executing
                 multiple tasks. Noteworthy features of the SST method
                 are demonstrated and highlighted by using results
                 obtained from computer experiments performed with a
                 numerical solution method of the Poisson equation and
                 migration of seismic reflection data.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Palo Alto Sci. Centre, CA, USA",
  classification = "C5440 (Multiprocessor systems and techniques)",
  keywords =     "Computational domain; Concurrent computing; Domain
                 decomposition; IBM ES/3090 system; Integration
                 variable; Numerical solution method; Parallel tasks;
                 Partially overlapped tasks; Pipeline execution; Poisson
                 equation; Repetitive operations; Scientific problems;
                 Seismic reflection data; Sequential task staging;
                 Shared-memory multiprocessors; Speedup",
  language =     "English",
  pubcountry =   "USA",
  thesaurus =    "Parallel processing; Pipeline processing",
}

Related entries