Entry Bakkers:1995:AGS from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | 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{Bakkers:1995:AGS,
  author =       "Andr{\'e} Bakkers and Johan Sunter and Evert Ploeg",
  title =        "Automatic generation of scheduling and communication
                 code in real-time parallel programs",
  journal =      j-SIGPLAN,
  volume =       "30",
  number =       "11",
  pages =        "134--145",
  month =        nov,
  year =         "1995",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:17:12 MST 2003",
  bibsource =    "http://portal.acm.org/; http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p134-bakkers/",
  abstract =     "Inter-process communication and scheduling are
                 notorious problem areas in the design of real-time
                 systems. Using CASE tools, the system design phase in
                 general results in a system description in the form of
                 parallel processes. Manual allocation of these
                 processes to processors may result in error prone
                 and/or slow communication code. Scheduling of the
                 processes, necessary to meet timing constraints, is
                 also a tedious task that takes many iterations. The
                 described design tools result in code that is
                 comparable in quality and performance with expert
                 manual realization. Many network layers have been
                 implemented to relieve the user from the low-level
                 programming of communication software. However, the
                 increase in user-friendliness usually results in
                 performance degradation. The proposed approach combines
                 user-friendliness with high performance by generating
                 communication software that is tailor-made for the
                 application. A similar approach is followed with the
                 scheduling software. Schedulers in the form of a
                 built-in kernel are available all the time and cause
                 overhead all the time. The proposed preprocessor tool
                 generates scheduling software after analyzing the
                 timing requirements of the particular application. This
                 results in simple code for simple timing requirements
                 and more complicated code for complex timing
                 requirements. The tools have been implemented in Occam
                 for use on a transputer. However, the results are valid
                 for any distributed memory machine.",
  acknowledgement = ack-nhfb,
  affiliation =  "Control Lab., Twente Univ., Enschede, Netherlands",
  classification = "C6110B (Software engineering techniques); C6110P
                 (Parallel programming); C6115 (Programming support);
                 C6150N (Distributed systems software)",
  confname =     "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995
                 workshop on Languages, compilers, \& tools for
                 real-time systems, June 21--22, 1995, La Jolla,
                 California",
  keywords =     "algorithms; Automatic communication code generation;
                 Automatic scheduling code generation; Built-in kernel;
                 CASE tools; Communication software; design; Design
                 tools; Distributed memory machine; Interprocess
                 communication; Interprocess scheduling; measurement;
                 Network layers; Occam; Overhead; performance;
                 Performance; Preprocessor tool; Real-time parallel
                 programs; Real-time system design; Scheduling software;
                 System description; theory; Timing constraints;
                 Transputer; User-friendliness",
  subject =      "{\bf F.2.2} Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Sequencing and scheduling.
                 {\bf C.3} Computer Systems Organization,
                 SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS,
                 Real-time and embedded systems. {\bf D.4.7} Software,
                 OPERATING SYSTEMS, Organization and Design, Real-time
                 systems and embedded systems. {\bf F.1.2} Theory of
                 Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of
                 Computation, Parallelism and concurrency. {\bf D.1.3}
                 Software, PROGRAMMING TECHNIQUES, Concurrent
                 Programming. {\bf D.3.4} Software, PROGRAMMING
                 LANGUAGES, Processors, Code generation. {\bf D.4.4}
                 Software, OPERATING SYSTEMS, Communications Management.
                 {\bf G.4} Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm design and analysis.",
  thesaurus =    "Automatic programming; Computer aided software
                 engineering; Distributed memory systems; Parallel
                 programming; Processor scheduling; Real-time systems;
                 Software tools; Timing",
}

Related entries