Entry Joung:1994:CFO 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{Joung:1994:CFO,
  author =       "Yuh-Jzer Joung and Scott A. Smolka",
  title =        "Coordinating First-Order Multiparty Interactions",
  journal =      j-TOPLAS,
  volume =       "16",
  number =       "3",
  pages =        "954--985",
  month =        may,
  year =         "1994",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibsource =    "Compiler/TOPLAS.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/177739.html",
  abstract =     "A {\em first-order multiparty interaction\/} is an
                 abstraction mechanism that defines communication among
                 a set of {\em formal process roles}. Actual processes
                 participate in a first-order interaction by {\em
                 enroling\/} into roles, and execution of the
                 interaction can proceed when all roles are filled by
                 distinct processes. As in CSP, enrolement statements
                 can serve as guards in alternative commands. The {\em
                 enrolement guard-scheduling problem\/} then is to
                 enable the execution of first-order interactions
                 through the judicious scheduling of roles to processes
                 that are currently ready to execute enrolement
                 guards.\par

                 We present a fully distributed and message-efficient
                 algorithm for the enrolement guard-scheduling problem,
                 the first such solution of which we are aware. We also
                 describe several extensions of the algorithm,
                 including: {\em generic roles; dynamically changing
                 environments}, where processes can be created and
                 destroyed at run time; and {\em nested-enrolement},
                 which allows interactions to be nested.",
  acknowledgement = ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; design; languages",
  subject =      "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process
                 Management, Synchronization. {\bf D.4.1}: Software,
                 OPERATING SYSTEMS, Process Management, Scheduling. {\bf
                 D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent
                 Programming. {\bf D.3.3}: Software, PROGRAMMING
                 LANGUAGES, Language Constructs and Features, Concurrent
                 programming structures. {\bf D.4.4}: Software,
                 OPERATING SYSTEMS, Communications Management,
                 Input/Output. {\bf D.4.7}: Software, OPERATING SYSTEMS,
                 Organization and Design, Distributed systems.",
}

Related entries