Entry Solworth:1992:E from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                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{Solworth:1992:E,
  author =       "Jon A. Solworth",
  title =        "Epochs",
  journal =      j-TOPLAS,
  volume =       "14",
  number =       "1",
  pages =        "28--53",
  month =        jan,
  year =         "1992",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/116785.html",
  abstract =     "To date, the implementation of message passing
                 languages has required the communications variables
                 (sometimes called ports) either to be limited to the
                 number of physical communications registers in the
                 machine or to be mapped to memory. Neither solution is
                 satisfactory. Limiting the number of variables
                 decreases modularity and efficiency of parallel
                 programs. Mapping variables to memory increases the
                 cost of communications and the granularity of
                 parallelism. We present here a new programming language
                 construct called {\em epochs}.\par

                 Epochs are a scoping mechanism within which the
                 programmer can declare communications variables, which
                 are live only during the scope of that epoch. To limit
                 the range of time a register has to be allocated for a
                 communications variable, the compiler ensures that all
                 processors enter an epoch simultaneously. The
                 programming style engendered fits somewhere between the
                 SIMD data parallel and the MIMD process spawning
                 models.\par

                 We describe an implementation for epochs including an
                 efficient synchronization mechanism, a means of
                 statically binding registers to communications
                 variables, and a method of fusing epochs to reduce
                 synchronization overhead.",
  acknowledgement = ack-nhfb # " and " # ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; design; languages; theory",
  subject =      "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features. {\bf D.4.4}: Software,
                 OPERATING SYSTEMS, Communications Management, Message
                 sending. {\bf C.1.2}: Computer Systems Organization,
                 PROCESSOR ARCHITECTURES, Multiple Data Stream
                 Architectures (Multiprocessors). {\bf D.3.4}: Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
                 D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Synchronization.",
}

Related entries