Entry Harlan:1995:PTP from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

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{Harlan:1995:PTP,
  author =       "Robert M. Harlan and Joseph G. Akulis",
  title =        "Parallel threads: parallel computation labs for {CS} 3
                 and {CS} 4",
  journal =      j-SIGCSE,
  volume =       "27",
  number =       "1",
  pages =        "141--145",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/199691.199758",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:28 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "One objective in establishing our NSF ILI funded
                 parallel computation laboratory was to use closed,
                 formal laboratory assignments to introduce parallelism
                 throughout the core computer science curriculum. We
                 discuss laboratory assignments developed for the
                 Computer Organization (CS 3) and Algorithms (CS 4)
                 courses. The CS 3 lab introduces parallelism based upon
                 processor replication and two-performance indices for
                 evaluating performance of parallel algorithms, speedup
                 and efficiency. One factor that effects performance on
                 MIMD message passage architectures, the ratio of
                 computation to communication, is also introduced. The
                 CS 4 lab guides students in developing a parallel
                 version of Dijkstra's single source shortest path
                 algorithm. A case study using parallel addition assists
                 students in identifying potential parallelism by
                 examining the data dependency of computations. Students
                 working in teams of two develop a pseudo-code version
                 of the single source shortest path algorithm for an
                 abstract parallel machine. They also analyze the
                 speedup and efficiency of an implementation of the
                 algorithm for one, four and eight processors.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries