Entry Motwani:1994:NS from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Motwani:1994:NS,
  author =       "Rajeev Motwani and Steven Phillips and Eric Torng",
  title =        "Nonclairvoyant scheduling",
  journal =      j-THEOR-COMP-SCI,
  volume =       "130",
  number =       "1",
  pages =        "17--47",
  day =          "01",
  month =        aug,
  year =         "1994",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:18:17 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=130&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=130&issue=1&aid=1613",
  acknowledgement = ack-nhfb,
  classification = "C1210 (General system theory); C1290Z (Other
                 applications of systems theory); C4290 (Other computer
                 theory); C6150J (Operating systems); C6150N
                 (Distributed systems)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computation theory; deterministic bounds; execution
                 time; fast turnaround; job interdependence; lower
                 bounds; multiprocessing systems; multiprocessor
                 systems; nonclairvoyant scheduling; operating systems
                 (computers); optimal clairvoyant scheduler; preemption
                 cost; preemptive scheduling schemes; randomized bounds;
                 release time; scheduling; scheduling strategy
                 evaluation model; single processor systems; standard
                 scheduling algorithm; time-sharing operating systems;
                 time-sharing programs; time-sharing systems; unknown
                 job characteristics; upper bounds",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries