@Preamble{
"\hyphenation{ Par-tha-sa-ra-thy }"
# "\ifx \undefined \circled \def \circled #1{(#1)}\fi"
# "\ifx \undefined \reg \def \reg {\circled{R}}\fi"
# "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi"
# "\ifx \undefined \url \def \url#1 {{\tt #1}} \fi"
}
@String{j-OPER-SYS-REV = "Operating Systems Review"}
@String{pub-DP = "Digital Press"}
@String{pub-DP:adr = "12 Crosby Drive, Bedford, MA 01730, USA"}
@String{pub-MACMILLAN = "Macmillan Publishing Company"}
@String{pub-MACMILLAN:adr = "New York, NY, USA"}
@String{pub-NORTH-HOLLAND = "North-Hol{\-}land"}
@String{pub-NORTH-HOLLAND:adr = "Amsterdam, The Netherlands"}
@String{pub-PH = "Pren{\-}tice-Hall"}
@String{pub-PH:adr = "Upper Saddle River, NJ 07458, USA"}
@String{pub-WILEY = "Wiley"}
@String{pub-WILEY:adr = "New York, NY, USA"}
@Article{Bobrow:1972:TPT,
author = "Daniel G. Bobrow and Jerry D. Burchfiel and Daniel L.
Murphy and Raymond S. Tomlinson",
title = "{TENEX}: a paged time sharing system for the
{PDP-10}",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "1--10",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liskov:1972:DVO,
author = "Barbara H. Liskov",
title = "The design of the {Venus Operating System}",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "11--16",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gaines:1972:OSB,
author = "R. Stockton Gaines",
title = "An operating system based on the concept of a
supervisory computer",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "17--23",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Howry:1972:MSP,
author = "Sam Howry",
title = "A multiprogramming system for process control",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "24--30",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Alsberg:1972:EDF,
author = "Peter A. Alsberg",
title = "Extensible data features in the operating system
language {OSL/2}",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "31--34",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Feiertag:1972:MIO,
author = "R. J. Feiertag and E. I. Organick",
title = "The {Multics} input\slash output system",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "35--38",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:1972:HAI,
author = "Michael D. Schroeder and Jerome H. Saltzer",
title = "A hardware architecture for implementing protection
rings",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "42--54",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Needham:1972:HDF,
author = "R. M. Needham",
title = "Handling difficult faults in operating systems",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "55--57",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gertz:1972:SRH,
author = "Jeffrey L. Gertz",
title = "Storage reallocation in hierarchical associative
memories",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "58--63",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Holt:1972:SDP,
author = "Richard C. Holt",
title = "Some deadlock properties of computer systems",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "64--71",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fontao:1972:CAA,
author = "Rafael O. Fontao",
title = "A concurrent algorithm for avoiding deadlocks in
multiprocess multiple resource systems",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "72--79",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Habermann:1972:SCP,
author = "A. Nico Habermann",
title = "Synchronization of communicating processes",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "80--85",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kahn:1972:ASC,
author = "Gilles Kahn",
title = "An approach to systems correctness",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "86--94",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Easton:1972:PSL,
author = "William B. Easton",
title = "Process synchronization without long-term interlock",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "95--100",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hansen:1972:STS,
author = "Per Brinch Hansen",
title = "Short-term scheduling in multiprogramming systems",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "101--105",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Varney:1972:PSH,
author = "R. C. Varney",
title = "Process selection in a hierarchical operating system",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "106--108",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baskett:1972:DCS,
author = "Forest Baskett",
title = "The dependence of computer system queues upon
processing time distribution and central processor
scheduling",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "109--113",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Teorey:1972:CAD,
author = "Toby J. Teorey and Tad B. Pinkerton",
title = "A comparative analysis of disk scheduling policies",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "114--121",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Coffman:1972:SSP,
author = "E. G. Coffman and Thomas A. Ryan",
title = "A study of storage partitioning using a mathematical
model of locality",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "122--129",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1972:PWS,
author = "Peter J. Denning and Stuart C. Schwartz",
title = "Properties of the working-set model",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "130--140",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Greenberg:1972:ADS,
author = "Mark L. Greenberg",
title = "An algorithm for drum storage management in
time-sharing systems",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "141--148",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Winograd:1972:SSV,
author = "J. Winograd and S. J. Morganstein and R. Herman",
title = "Simulation studies of a virtual memory, time-shared,
demand paging operating system",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "149--155",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rodriguez-Rosell:1972:EDH,
author = "Juan Rodriguez-Rosell",
title = "Experimental data on how program behavior affects the
choice of scheduler parameters",
journal = j-OPER-SYS-REV,
volume = "6",
number = "1/2",
pages = "156--163",
month = jun,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fogel:1972:EID,
author = "Marc Fogel and Joseph Winograd",
title = "{EINSTEIN}: an internal driver in a time-sharing
environment",
journal = j-OPER-SYS-REV,
volume = "6",
number = "3",
pages = "6--14",
month = oct,
year = "1972",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Poole:1973:WTT,
author = "Peter C. Poole",
title = "When is a test not a test?",
journal = j-OPER-SYS-REV,
volume = "7",
number = "2",
pages = "4--5",
month = apr,
year = "1973",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Collier:1973:AIS,
author = "William W. Collier",
title = "Asynchronous interactions on shared data",
journal = j-OPER-SYS-REV,
volume = "7",
number = "2",
pages = "6--15",
month = apr,
year = "1973",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chambers:1973:UCS,
author = "John M. Chambers",
title = "A user-controlled synchronization method",
journal = j-OPER-SYS-REV,
volume = "7",
number = "2",
pages = "16--25",
month = apr,
year = "1973",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abernathy:1973:SDGa,
author = "David H. Abernathy and John S. Mancino and Charls R.
Pearson and Dona C. Swiger",
title = "Survey of design goals for operating systems",
journal = j-OPER-SYS-REV,
volume = "7",
number = "2",
pages = "29--48",
month = apr,
year = "1973",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:1973:BRS,
author = "M. D. Schroeder",
title = "A brief report on the {SIGPLAN\slash SIGOPS} interface
meeting",
journal = j-OPER-SYS-REV,
volume = "7",
number = "3",
pages = "4--9",
month = jul,
year = "1973",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wood:1973:ESC,
author = "David C. M. Wood",
title = "An example in synchronization of cooperating
processes: theory and practice",
journal = j-OPER-SYS-REV,
volume = "7",
number = "3",
pages = "10--18",
month = jul,
year = "1973",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abernathy:1973:SDGb,
author = "David H. Abernathy and John S. Mancino and Charls R.
Pearson and Dona C. Swiger",
title = "Survey of design goals for operating systems",
journal = j-OPER-SYS-REV,
volume = "7",
number = "3",
pages = "19--34",
month = jul,
year = "1973",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sorenson:1973:ICR,
author = "P. G. Sorenson",
title = "Interprocess communication in real-time systems",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "1--7",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808042",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A variety of solutions have been proposed for ensuring
data integrity in nonreal-time systems (i.e. batch or
on-line systems). A brief review is made of some of the
techniques employed in these solutions. It is indicated
why the data integrity problem is different in a
real-time system than in a nonreal-time system. Two
models of interprocess communication are presented and
it is demonstrated that the models are sufficient to
preserve data integrity in a real-time system.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spier:1973:EIK,
author = "Michale J. Spier and Thomas N. Hastings and David N.
Cutler",
title = "An experimental implementation of the kernel\slash
domain architecture",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "8--21",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808043",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As part of its effort to periodically investigate
various new promising concepts and techniques, the
Digital Equipment Corporation has sponsored a research
project whose purpose it was to effect a limited
implementation of a protective operating system
framework, based on the kernel/domain architecture
which has increasingly been propounded in recent years.
The project was carried out in 1972, and its successful
completion has led to a substantial number of
observations and insights. This paper reports on the
more significant ones, specifically: (1) the techniques
used in mapping a conceptual model onto commercially
available hardware (the PDP-11/45 mini-computer), (2)
the domain's memory mapping properties, and their
impact on programming language storage-class semantics,
(3) this architecture's impact on the apparent
simplification of various traditionally-complex
operating systems monitor functions, and (4) the
promise this architecture holds in terms of increased
functional flexibility for future-generation geodesic
operating systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stephenson:1973:SCC,
author = "C. J. Stephenson",
title = "On the structure and control of commands",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "22--26",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808044",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "An interactive command language, with its underlying
data, defines a command environment. In general a
command environment supports a number of commands which
once issued perform non-interactively, and which when
finished leave the old command environment in control.
It also supports some special commands which move to
other command environments, after which commands are
interpreted according to a different set of rules. The
usefulness of a command environment can be extended by
programming it, i.e. by dynamically constructing and
conditionally executing sequences of its commands; but,
unlike a programming language, a command language does
not usually contain any general-purpose variables or
means for conditional execution. These facilities can
however be provided by a command control language,
which makes it possible to construct sequences or
commands to be issued to the currently active command
environment from a program. A command control language
is described, and the usefulness, limitations and
repercussions of command language programming are
discussed.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ritchie:1973:UTSb,
author = "Dennis M. Ritchie and Ken Thompson",
title = "The {UNIX} time-sharing system",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "27--27",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808045",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7314",
abstract = "UNIX is a general-purpose, multi-user, interactive
operating system for the Digital Equipment Corporation
PDP-1 1/40 and 11/45 computers. It offers a number of
features seldom found even in larger operating systems,
including (1). A hierarchical file system incorporating
demountable volumes, (2). Compatible file, device, and
inter-process I/O, (3). The ability to initiate
asynchronous processes, (4). System command language
selectable on a per-user basis, (5). Over 100
subsystems including a dozen languages. This paper
discusses the usage and implementation of the file
system and of the user command interface.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Day:1973:AOS,
author = "Paul Day and John Hines",
title = "{ARGOS}: {An} operating system for a computer utility
supporting interactive instrument control",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "28--37",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808046",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "``ARGOS'' (ARGonne Operating System), which runs on a
Xerox Sigma 5 hardware configuration, provides a
dynamic multiprogrammed environment which supports the
following: data acquisition and interactive control for
numerous (currently 19) independently running on-line
laboratory experiments; three interactive graphics
terminals; FORTRAN IV-H executing at each of 23 remote
time-shared terminals; a jobstream from open-shop batch
processing; long-term low priority computations (100
CPU hours). The system guarantees the protection of
each user's interests by the utilization of the
hardware memory-protection feature, internal clocks and
disallowing the execution of privileged instructions by
user programs. The system is interrupt-driven, with
each task running to completion, contingent on its
priority. System resources are provided on a first come
first served basis, except that rotating memory is
queued by request position. System CALLs provide users
full access to hardware capability, thus providing
user-directed file formats and insuring a minimum of
system overhead. However, at some sacrifice in
overhead, the user can make use of FORTRAN
record-blocking. Core memory, disk space and magnetic
tape usage, are assigned dynamically. Parametrization
of the system is such that terminal characteristics are
specified (one parameter card/terminal) at boot-in time
(once/week after preventive maintenance).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Walther:1973:MSD,
author = "W. Walther",
title = "Multiprocessor self diagnosis, surgery, and recovery
in air terminal traffic control",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "38--44",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808047",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The rapid growth of global aviation for business and
pleasure has created the need for automated terminal
systems of increasing complexity and capability.
Continued increases in the aircraft population will
require higher levels of automation. Sperry Univac is
responding to this challenge with a multiprocessing
system, including hardware and software, currently
under development which will enable controllers to
safely manage the crowded skies.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Svobodova:1973:OSP,
author = "Liba Svobodova",
title = "Online system performance measurements with software
and hybrid monitors",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "45--53",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808048",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Two monitors were implemented to collect information
about the behavior of the online system developed and
run at Stanford. The response of this online system was
slow and main memory was a critical resource. The goal
was to extract desired information by a method that
requires only a negligible amount of monitored system
resources. Results presented in this paper indicate
that this effort has been successful. A software
monitor that requires less than 700 bytes of main
memory collects statistics about utilization of special
online system resources and about the scheduler
mechanism, detects system deadlocks, and measures
online executive overhead. This software monitor helped
to discover various facts about the system behavior;
however, to understand the reasons behind certain
situations, it was necessary to learn more about
properties of individual terminal tasks. Since a
software monitor would cause an intolerable system
degradation and hardware monitoring is not directly
applicable for such measurements, a hardware/software
monitor interface was implemented which enables
recording of software events by a hardware monitor. The
monitoring artifact is thus kept close to zero. This
technique has been applied to measure time a task
spends in various states and it has many other uses.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fuller:1973:SMT,
author = "Samuel H. Fuller",
title = "Summary of minimal-total-processing-time drum and disk
scheduling disciplines",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "54--57",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808049",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This article investigates the application of
minimal-total-processing-time (MTPT) scheduling
disciplines to rotating storage units when random
arrival of requests is allowed. Fixed-head drum and
moving-head disk storage units are considered and
particular emphasis is placed on the relative merits of
the MTPT scheduling discipline with respect to the
shortest-latency-time-first (SLTF) scheduling
discipline. The results of the simulation studies
presented show that neither scheduling discipline is
unconditionally superior to the other. For most
fixed-head drum applications the SLTF discipline is
preferable to MTPT, but for intra-cylinder disk
scheduling the MTPT discipline offers a distinct
advantage over the SLTF discipline. An implementation
of the MTPT scheduling discipline is discussed and the
computational requirements of the algorithm are shown
to be comparable to SLTF algorithms. In both cases, the
sorting procedure is the most time consuming phase of
the algorithm.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Scheffier:1973:OFP,
author = "Lee J. Scheffier",
title = "Optimal folding of a paging drum in a three level
memory system",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "58--65",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808050",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes a drum space allocation and
accessing strategy called ``folding'', whereby
effective drum storage capacity can be traded off for
reduced drum page fetch time. A model for the ``folded
drum'' is developed and an expression is derived for
the mean page fetch time of the drum as a function of
the degree of folding. In a hypothetical three-level
memory system of primary (directly addressable), drum,
and tertiary (usually disk) memories, the tradeoffs
among drum storage capacity, drum page fetch time, and
page fetch traffic to tertiary memory are explored. An
expression is derived for the mean page fetch time of
the combined drum-tertiary memory system as a function
of the degree of folding. Measurements of the MULTICS
three-level memory system are presented as examples of
improving multi-level memory performance through drum
folding. A methodology is suggested for choosing the
degree of folding most appropriate to a particular
memory configuration.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chamberlin:1973:PAS,
author = "Donald D. Chamberlin and Samuel H. Fulier and Leonard
Y. Liu",
title = "A page allocation strategy for multiprogramming
systems",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "66--72",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808051",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In a multiprogramming, virtual-memory computing
system, many processes compete simultaneously for
system resources, which include CPU's, main memory page
frames, and the transmission capacity of the paging
drum. (We define a ``process'' here as a program with
its own virtual memory, requiring an allocation of real
memory and a CPU in order to execute). This paper
studies ways of allocating resources to processes in
order to maximize throughput in systems which are not
CPU-bound. As is customary, we define the
multiprogramming ``set'' (MPS) as the set of processes
eligible for allocation of resources at any given time.
Each process in the MPS is allocated a certain number
of page frames and allowed to execute, interrupted
periodically by page faults. A process remains in the
MPS until it finishes or exhausts its ``time slice'',
at which time it is demoted. We assume the existence of
two resource managers within the operating system: The
Paging Manager and the Scheduler. The function of the
Paging Manager is to control the size of the MPS, and
to allocate main storage page frames among those
processes in the MPS. The function of the Scheduler is
to assign time-slice lengths to the various processes,
and to define a promotion order among those processes
not currently in the MPS. The Scheduler must ensure
that system responsiveness is adequate, while the
Paging Manager is primarily concerned with throughput.
This paper studies possible strategies for the Paging
Manager. A strategy for the Scheduler is proposed in
(2).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1973:DSP,
author = "Peter J. Denning and Jeffrey R. Spirn",
title = "Dynamic storage partitioning",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "73--79",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808052",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A model of paged multiprogramming computer systems
using variable storage partitioning is considered. A
variable storage partitioning policy is one which
allocates storage among the active tasks according to a
sequence of fixed partitions of main storage. The basic
result obtained is, mean processing efficiency is
increased and mean fault-rate decreased under a
variable partition, provided that the curves of
efficiency and fault-rate as a function of allocated
space are concave up.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Arvind:1973:RSG,
author = "Arvind and R. Y. Kain and E. Sadeh",
title = "On reference string generation processes",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "80--87",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808053",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Efficient memory management is important for
optimizing computer usage. Intuition, simulation,
experience, and analysis have contributed to the design
of space management algorithms. Analytical models
require accurate and concise descriptions of the
system's environment. The referencing pattern,
describing the sequence of memory addresses, is the
environment for memory management problems. One
referencing model assigns probabilities to positions in
an LRU stack of memory pages. ``Local'' behavior is
easily described using this model. However, the
distinctly different behavior among instruction and
data references is lost. In this paper we generalize
the LRU stack model to an arbitrary number of memory
spaces which are selected by the transitions of a
Markov chain. The additional detail affects the
behavior of the models for a working set management
strategy.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ellis:1973:PDC,
author = "Clarence A. Ellis",
title = "On the probability of deadlock in computer systems",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "88--95",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808054",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As the number of processes and resources increases
within a computer system, does the probability of that
system's being in deadlock increase or decrease? This
paper introduces Probabilistic Automata as a model of
computer systems. This allows investigation of the
above question for various scheduling algorithms. A
theorem is proven which indicates that, within the
types of systems considered, the probability of
deadlock increases.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ullman:1973:PCS,
author = "J. D. Ullman",
title = "Polynomial complete scheduling problems",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "96--101",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808055",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We show that the problem of finding an optimal
schedule for a set of jobs is polynomial complete even
in the following two restricted cases. (1) All jobs
require one time unit. (2) All jobs require one or two
time units, and there are only two processors. As a
consequence, the general preemptive scheduling problem
is also polynomial complete. These results are
tantamount to showing that the scheduling problems
mentioned are intractable.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eruno:1973:SIT,
author = "J. Eruno and E. G. {Coffman, Jr.} and R. Sethi",
title = "Scheduling independent tasks to reduce mean
finishing-time (extended abstract)",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "102--103",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808056",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we study the problem of scheduling a set
of independent tasks on m {$>$}= 1 processors to
minimize the mean finishing-time (mean time in system).
The importance of the mean finishing-time criterion is
that its minimization tends to reduce the mean number
of unfinished tasks in the system. In the paper we give
a reduction of our scheduling problem to a
transportation problem and thereby extend the class of
known non enumerative scheduling algorithms [1]. Next
we show that the inclusion of weights (weighted mean
finishing-time) complicates the problem and speculate
that there may be no non enumerative algorithm for this
case. For the special case of identical processors we
study the maximum finishing-time properties of
schedules which are optimal with respect to mean
finishing-time. Finally we give a scheduling algorithm
having desirable properties with respect to both
maximum finishing-time and mean finishing-time.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Garey:1973:BSL,
author = "M. R. Garey and R. L. Grehem",
title = "Bounds on scheduling with limited resources",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "104--111",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808057",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A number of authors (of. [12],[6],
[7],[3],[11],[4],[5],[9]) have recently been concerned
with scheduling problems associated with a certain
model of an abstract multiprocessing system (to be
described in the next section) and, in particular, with
bounds on the worst-case behavior of this system as a
function of the way in which the inputs are allowed to
vary. In this paper, we introduce an additional element
of realism into the model by postulating the existence
of a set of ``resources'' with the property that at no
time may the system use more than some predetermined
amount of each resource. With this extra constraint
taken into consideration, we derive a number of bounds
on the behavior of this augmented system. It will be
seen that this investigation leads to several
interesting results in graph theory and analysis.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Krause:1973:TSA,
author = "K. L. Krause and V. Y. Shen and H. D. Schwetman",
title = "A task-scheduling algorithm for a multiprogramming
computer system",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "112--118",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808058",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents a description and analysis of a
task scheduling algorithm which is applicable to third
generation computer systems. The analysis is carried
out using a model of a computer system having several
identical task processors and a fixed amount of memory.
The algorithm schedules tasks having different
processor-time and memory requirements. The goal of the
algorithm is to produce a task schedule which is near
optimal in terms of the time required to process all of
the tasks. An upper bound on the length of this
schedule is the result of deterministic analysis of the
algorithm. Computer simulations demonstrate the
applicability of the algorithm in actual systems, even
when some of the basic assumptions are violated.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saltzer:1973:PCI,
author = "Jerome H. Saltzer",
title = "Protection and control of information sharing in
{Multics}",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "119--119",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808059",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes the design of mechanisms to
control sharing of information in the Multics system.
Seven design principles help provide insight into the
tradeoffs among different possible designs. The key
mechanisms described include access control lists,
hierarchical control of access specifications,
identification and authentication of users, and primary
memory protection. The paper ends with a discussion of
several known weaknesses in the current protection
mechanism design.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fabry:1973:CCB,
author = "R. S. Fabry",
title = "The case for capability based computers (Extended
Abstract)",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "120--120",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808060",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The idea of a capability which acts like a ticket
authorizing the use of some resource was developed by
Dennis and Van Horn as a generalization of addressing
and protection schemes such as the code- words of the
Rice computer, the descriptors of the Burroughs
machines, and the segment and page tables in computers
such as the GE-645 and IBM 360/67. Dennis and Van Horn
generalized the earlier schemes by extending them to
include not just memory, but all systems resources:
memory, processes, input/output devices, and so on; and
by stressing the explicit manipulation of access
control by nonsystem programs. The idea is that a
capability is a special kind of address for an object,
that these addresses can be created only by the
supervisor, and that in order to use any object, one
must address it via one of these addresses. The name
comes from the fact that having one of these special
kinds of addresses for a resource provides one with the
capability to use the resource. The use of capabilities
as a protection mechanism has been the subject of
considerable interest and is now fairly well
understood. Access control schemes using capabilities
and capability -like notions are, as a whole, the most
flexible and general schemes available. It will in fact
be assumed that the reader is familiar with the
advantages of capabilities for protection put-poses; a
somewhat different advantage of capabilities will be
developed here.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Popek:1973:FRV,
author = "Gerald J. Popek and Robert P. Goldberg",
title = "Formal requirements for virtualizable third generation
architectures",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "121--121",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808061",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Virtual machine systems have been implemented on a
limited number of third generation computer systems,
for example CP-67 on the IBM 360/67. The value of
virtual machine techniques to ease the development of
operating systems, to aid in program transferability,
and to allow the concurrent running of disparate
operating systems, test and diagnostic programs has
been well recognized. However, from previous empirical
studies, it is known that many third generation
computer systems, e.g. the DEC PDP-10, cannot support a
virtual machine system. In this paper, the hardware
architectural requirements for virtual machine systems
are discussed. First, a fairly specific definition of a
virtual machine is presented which includes the aspects
of efficiency, isolation, and identical behavior. A
model of third generation-like computer systems is then
developed. The model includes a processor with
supervisor and user modes, memory that has a simple
protection mechanism, and a trap facility. In this
context, instruction behavior is then carefully
characterized.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kosaraju:1973:LDS,
author = "S. Rao Kosaraju",
title = "Limitations of {Dijkstra}'s {Semaphore Primitives} and
{Petri} nets",
journal = j-OPER-SYS-REV,
volume = "7",
number = "4",
pages = "122--126",
month = oct,
year = "1973",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/957195.808062",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 23 08:03:02 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Recently various attempts have been made to study the
limitations of Dijkstra's Semaphore Primitives for the
synchronization problem of cooperating sequential
processes [3,4,6,8]. Patil [8] proves that the
semaphores with the P and V primitives are not
sufficiently powerful. He suggests a generalization of
the P primitive. We prove that certain synchronization
problems cannot be realized with the above
generalization and even with arrays of semaphores. We
also show that even the general Petri nets will not be
able to handle some synchronization problems,
contradicting a conjecture of Patil (P.28 [7]).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1974:ITD,
author = "Peter J. Denning",
title = "Is it not time to define ``structured programming''?",
journal = j-OPER-SYS-REV,
volume = "8",
number = "1",
pages = "6--7",
month = jan,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fogel:1974:VPA,
author = "Marc H. Fogel",
title = "The {VMOS} paging algorithm: a practical
implementation of the working set model",
journal = j-OPER-SYS-REV,
volume = "8",
number = "1",
pages = "8--17",
month = jan,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lampson:1974:P,
author = "Butler W. Lampson",
title = "Protection",
journal = j-OPER-SYS-REV,
volume = "8",
number = "1",
pages = "18--24",
month = jan,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abernathy:1974:SDG,
author = "David H. Abernathy and John S. Mancino and Charls R.
Pearson and Dona C. Swiger",
title = "Survey of design goals for operating systems",
journal = j-OPER-SYS-REV,
volume = "8",
number = "1",
pages = "25--35",
month = jan,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zelkowitz:1974:ITD,
author = "Marvin V. Zelkowitz",
title = "It is not time to define ``structured programming''",
journal = j-OPER-SYS-REV,
volume = "8",
number = "2",
pages = "7--8",
month = apr,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spier:1974:CLS,
author = "Michael J. Spier",
title = "A critical look at the state of our science",
journal = j-OPER-SYS-REV,
volume = "8",
number = "2",
pages = "9--15",
month = apr,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Foulk:1974:YAA,
author = "Clinton R. Foulk",
title = "Yet another attempt to define ``structured
programming''",
journal = j-OPER-SYS-REV,
volume = "8",
number = "3",
pages = "4--5",
month = jul,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nutt:1974:ICS,
author = "Gary J. Nutt",
title = "An implementation of a computer simulation system",
journal = j-OPER-SYS-REV,
volume = "8",
number = "3",
pages = "6--7",
month = jul,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saltzer:1974:ORD,
author = "Jerome H. Saltzer",
title = "Ongoing research and development on information
protection",
journal = j-OPER-SYS-REV,
volume = "8",
number = "3",
pages = "8--24",
month = jul,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1974:SPL,
author = "Peter J. Denning",
title = "Is ``structured programming'' any longer the right
term?",
journal = j-OPER-SYS-REV,
volume = "8",
number = "4",
pages = "4--6",
month = oct,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Knott:1974:PCP,
author = "Gary D. Knott",
title = "A proposal for certain process management and
intercommunication primitives",
journal = j-OPER-SYS-REV,
volume = "8",
number = "4",
pages = "7--44",
month = oct,
year = "1974",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spier:1975:TME,
author = "Michael J. Spier and Richard L. Hill and Timothy J.
Stein and Daniel Bricklin",
title = "The {TYPESET-10} {Message Exchange Facility}: a case
study in systemic design",
journal = j-OPER-SYS-REV,
volume = "9",
number = "1",
pages = "10--18",
month = jan,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Knott:1975:PCP,
author = "Gary D. Knott",
title = "A proposal for certain process management and
intercommunication primitives",
journal = j-OPER-SYS-REV,
volume = "9",
number = "1",
pages = "19--41",
month = jan,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Beckmann:1975:BR,
author = "Petr Beckmann",
title = "Book review",
journal = j-OPER-SYS-REV,
volume = "9",
number = "2",
pages = "8--9",
month = apr,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{NBS:1975:PPS,
author = "{National Bureau of Standards} and {National Science
Foundation}",
title = "A preliminary prospectus for a software engineering
handbook",
journal = j-OPER-SYS-REV,
volume = "9",
number = "2",
pages = "10--13",
month = apr,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anonymous:1975:ASI,
author = "Anonymous",
title = "Aims and scope for {IEEE Transactions on Software
Engineering}",
journal = j-OPER-SYS-REV,
volume = "9",
number = "2",
pages = "14--15",
month = apr,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Enslow:1975:OAE,
author = "Philip H. Enslow",
title = "{OSCL} (1) activity in {Europe}",
journal = j-OPER-SYS-REV,
volume = "9",
number = "2",
pages = "16--17",
month = apr,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lampson:1975:SIS,
author = "Butler Lampson",
title = "Synchronization: {Introduction} by the session
chairman",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "1--2",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Belpaire:1975:SSP,
author = "Gerald Belpaire",
title = "Synchronization: {Is} a synthesis of the problems
possible?",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "3--10",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tomlinson:1975:SSN,
author = "Raymond S. Tomlinson",
title = "Selecting sequence numbers",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "11--23",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dalal:1975:MSS,
author = "Yogen K. Dalal",
title = "More on selecting sequence numbers",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "25--36",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1975:RPS,
author = "Robert C. Chen",
title = "Representation of process synchronization",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "37--42",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cerf:1975:FIC,
author = "Vinton Cerf",
title = "Formalisms for interprocess communication",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "43--44",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bochmann:1975:CPE,
author = "Gregor V. Bochmann",
title = "Communication protocols and error recovery
procedures",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "45--50",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Merlin:1975:RMS,
author = "Philip M. Merlin and David J. Farber",
title = "Recoverability of modular systems",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "51--56",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gaines:1975:P,
author = "R. Stockton Gaines",
title = "Protection",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "57--58",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Popek:1975:DSC,
author = "Gerald J. Popek",
title = "On data secure computer networks",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "59--62",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1975:ICS,
author = "T. C. Chen",
title = "Interprocess communication systems",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "63--63",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Manning:1975:STP,
author = "Eric Manning and R. W. Peebles",
title = "Segment transfer protocols for a homogeneous computer
network",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "65--73",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chu:1975:P,
author = "Wesley Chu",
title = "Performance",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "75--75",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McQuillan:1975:SCH,
author = "John M. McQuillan and David C. Walden",
title = "Some considerations for a high performance
message-based interprocess communication system",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "77--86",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Danthine:1975:CPN,
author = "Andr{\'e} A. S. Danthine and Joseph Bremer",
title = "Communication protocols in a network context",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "87--92",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Opderbeck:1975:ECP,
author = "Holger Opderbeck",
title = "On the efficiency of control procedures for computer
communication networks",
journal = j-OPER-SYS-REV,
volume = "9",
number = "3",
pages = "93--96",
month = jul,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brown:1975:GMC,
author = "R. R. Brown and J. L. Elshoff and M. R. Ward",
title = "The {GM} multiple console time sharing system",
journal = j-OPER-SYS-REV,
volume = "9",
number = "4",
pages = "7--17",
month = oct,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brown:1975:MCT,
author = "R. R. Brown",
title = "{MCTS} customer task environment",
journal = j-OPER-SYS-REV,
volume = "9",
number = "4",
pages = "18--42",
month = oct,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kain:1975:HEP,
author = "Richard Y. Kain",
title = "How to evaluate page replacement algorithms",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "1--5",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sadeh:1975:APP,
author = "E. Sadeh",
title = "An analysis of the performance of the page fault
frequency {(PFF)} replacement algorithm",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "6--13",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Harrison:1975:POS,
author = "Michael A. Harrison and Walter L. Ruzzo and Jeffrey D.
Ullman",
title = "On protection in operating systems",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "14--24",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:1975:ESK,
author = "Michael D. Schroeder",
title = "Engineering a security kernel for {Multics}",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "25--32",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bayer:1975:MME,
author = "D. L. Bayer and H. Lycklama",
title = "{MERT} --- a multi-environment real-time operating
system",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "33--42",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Janson:1975:DLE,
author = "Philippe A. Janson",
title = "Dynamic linking and environment initialization in a
multi-domain process",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "43--50",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pruitt:1975:ART,
author = "J. L. Pruitt and W. W. Case",
title = "Architecture of a real time operating system",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "51--59",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chesson:1975:NUS,
author = "Gregory L. Chesson",
title = "The network {Unix} system",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "60--66",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Akkoyunlu:1975:SCT,
author = "E. A. Akkoyunlu and K. Ekanadham and R. V. Huber",
title = "Some constraints and tradeoffs in the design of
network communications",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "67--74",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cosell:1975:OSC,
author = "B. P. Cosell and P. R. Johnson and J. H. Malman and R.
E. Schantz and J. Sussman and R. H. Thomas and
D. C. Walden",
title = "An operational system for computer resource sharing",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "75--81",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bagley:1975:SDS,
author = "J. D. Bagley and E. R. Floto and S. C. Hsieh and V.
Watson",
title = "Sharing data and services in a virtual machine
system",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "82--88",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Belpaire:1975:FPR,
author = "Gerald Belpaire and Nai-Ting Hsu",
title = "Formal properties of recursive {Virtual Machine}
architectures",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "89--96",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Popek:1975:PVM,
author = "Gerald J. Popek and Charles S. Kline",
title = "The {PDP-11} virtual machine architecture: {A} case
study",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "97--105",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Russell:1975:ERP,
author = "David L. Russell and Thomas H. Bredt",
title = "Error resynchronization in producer-consumer systems",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "106--113",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Arden:1975:MMC,
author = "Bruce W. Arden and Alan D. Berenbaum",
title = "A multi-microprocessor computer system architecture",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "114--121",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wulf:1975:OHO,
author = "W. Wulf and R. Levin and C. Pierson",
title = "Overview of the {Hydra Operating System} development",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "122--131",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levin:1975:PMS,
author = "R. Levin and E. Cohen and W. Corwin and F. Pollack and
W. Wulf",
title = "Policy\slash mechanism separation in {Hydra}",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "132--140",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cohen:1975:PHO,
author = "Ellis Cohen and David Jefferson",
title = "Protection in the {Hydra Operating System}",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "141--160",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brundage:1975:CPD,
author = "Robert E. Brundage and Alan P. Batson",
title = "Computational processor demands of {Algol-60}
programs",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "161--168",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chandy:1975:SPO,
author = "K. M. Chandy and P. F. Reynolds",
title = "Scheduling partially ordered tasks with probabilistic
execution times",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "169--177",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lam:1975:ALA,
author = "Shui Lam and Ravi Sethi",
title = "Analysis of a level algorithm for preemptive
scheduling",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "178--186",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Coffman:1975:SSR,
author = "E. G. {Coffman, Jr.} and I. Mitrani",
title = "Selecting a scheduling rule that meets pre-specified
response time demands",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "187--191",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lipner:1975:CCP,
author = "Steven B. Lipner",
title = "A comment on the confinement problem",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "192--196",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:1975:ESP,
author = "Anita K. Jones and Richard J. Lipton",
title = "The enforcement of security policies for computation",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "197--206",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1975:SPL,
author = "Peter J. Denning and Kevin C. Kahn",
title = "A study of program locality and lifetime functions",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "207--216",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Agrawala:1975:MMS,
author = "A. K. Agrawala and R. M. Bryant",
title = "Models of memory scheduling",
journal = j-OPER-SYS-REV,
volume = "9",
number = "5",
pages = "217--222",
month = nov,
year = "1975",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peterson:1976:RCF,
author = "James L. Peterson",
title = "Referee coordination for the fifth {Symposium} on
{Operating Systems Principles}",
journal = j-OPER-SYS-REV,
volume = "10",
number = "1",
pages = "7--16",
month = jan,
year = "1976",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brown:1976:GMC,
author = "R. R. Brown and J. L. Elshoff and M. R. Ward",
title = "The {GM} multiple console time sharing system",
journal = j-OPER-SYS-REV,
volume = "10",
number = "1",
pages = "17--17",
month = jan,
year = "1976",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Elshoff:1976:MOS,
author = "James L. Elshoff and Mitchel R. Ward",
title = "The {MCTS} operating system",
journal = j-OPER-SYS-REV,
volume = "10",
number = "1",
pages = "18--38",
month = jan,
year = "1976",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brown:1976:MNP,
author = "Ralph R. Brown",
title = "{MCTS} nucleus: philosophy and praxis",
journal = j-OPER-SYS-REV,
volume = "10",
number = "1",
pages = "39--60",
month = jan,
year = "1976",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ward:1976:SAO,
author = "Mitchel R. Ward",
title = "A simple approach to operating system generation and
initialization",
journal = j-OPER-SYS-REV,
volume = "10",
number = "1",
pages = "61--71",
month = jan,
year = "1976",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yuval:1976:ONS,
author = "G. Yuval",
title = "An operating non-system",
journal = j-OPER-SYS-REV,
volume = "10",
number = "3",
pages = "9--10",
month = jul,
year = "1976",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sibley:1976:EJO,
author = "E. H. Sibley",
title = "Economic justification of an {OSCL\slash OSRL}",
journal = j-OPER-SYS-REV,
volume = "10",
number = "4",
pages = "7--15",
month = oct,
year = "1976",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mills:1977:CFM,
author = "Philip M. Mills",
title = "Control functions for a multiprocessor architecture",
journal = j-OPER-SYS-REV,
volume = "11",
number = "1",
pages = "26--40",
month = jan,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ambler:1977:GLS,
author = "Allen L. Ambler and Donald I. Good and James C. Browne
and Wilhelm F. Burger and Richard M. Cohen and Charles
G. Hoch and Robert E. Wells",
title = "{Gypsy}: {A} language for specification and
implementation of verifiable programs",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "1--10",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Popek:1977:NDE,
author = "G. J. Popek and J. J. Horning and B. W. Lampson and J.
G. Mitchell and R. L. London",
title = "Notes on the design of {Euclid}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "11--18",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fischer:1977:EIO,
author = "Charles N. Fischer and Richard J. LeBlanc",
title = "Efficient implementation and optimization of run-time
checking in {PASCAL}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "19--24",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ambler:1977:SPP,
author = "Allen L. Ambler and Charles G. Hoch",
title = "A study of protection in programming languages",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "25--40",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Friedman:1977:AAP,
author = "Daniel P. Friedman and David S. Wise",
title = "Aspects of applicative programming for file systems
(preliminary version)",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "41--55",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herriot:1977:TIP,
author = "Robert G. Herriot",
title = "Towards the ideal programming language",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "56--62",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guttag:1977:SEA,
author = "Jhon V. Guttag and Ellis Horowitz and David R.
Musser",
title = "Some extensions to algebraic specifications",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "63--67",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Buckle:1977:RDT,
author = "Normand Buckle",
title = "Restricted data types, specification and enforcement
of invariant properties of variables",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "68--76",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Causot:1977:SDD,
author = "Patrick Causot and Radhia Cousot",
title = "Static determination of dynamic properties of
generalized type unions",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "77--94",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Melliar-Smith:1977:SRR,
author = "P. M. Melliar-Smith and B. Randell",
title = "Software reliability: {The} role of programmed
exception handling",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "95--100",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{MacLaren:1977:EHP,
author = "M. Donald MacLaren",
title = "Exception handling in {PL/I}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "101--104",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Love:1977:EIE,
author = "Tom Love",
title = "An experimental investigation of the effect of program
structure on program understanding",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "105--113",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Andrews:1977:LFP,
author = "Gregory R. Andrews and James R. McGraw",
title = "Language features for process interaction",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "114--127",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lomet:1977:PSS,
author = "D. B. Lomet",
title = "Process structuring, synchronization, and recovery
using atomic actions",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "128--137",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Geschke:1977:EEM,
author = "Charles M. Geschke and James H. {Morris, Jr.} and
Edwin H. Satterthwaite",
title = "Early experience with {Mesa}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "138--138",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shaw:1977:AVA,
author = "Mary Shaw and Wm A. Wulf and Ralph L. London",
title = "Abstraction and verification in {Alphard}: {Defining}
and specifying iteration and generators",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "139--139",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liskov:1977:AMC,
author = "Barbara Liskov and Alan Snyder and Russell Atkinson
and Craig Schaffert",
title = "Abstraction mechanisms in {CLU}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "140--140",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gannon:1977:EED,
author = "J. D. Gannon",
title = "An experimental evaluation of data types on
programming reliability",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "141--141",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wirth:1977:TDR,
author = "N. Wirth",
title = "Towards a discipline of real-time programming",
journal = j-OPER-SYS-REV,
volume = "11",
number = "2",
pages = "142--142",
month = apr,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lister:1977:PNM,
author = "Andrew Lister",
title = "The problem of nested monitor calls",
journal = j-OPER-SYS-REV,
volume = "11",
number = "3",
pages = "5--7",
month = jul,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Payne:1977:FTE,
author = "A. J. Payne",
title = "A formalised technique for expressing system
exercisers",
journal = j-OPER-SYS-REV,
volume = "11",
number = "3",
pages = "8--12",
month = jul,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gerber:1977:PSC,
author = "A. J. Gerber",
title = "Process synchronization by counter variables",
journal = j-OPER-SYS-REV,
volume = "11",
number = "4",
pages = "6--17",
month = oct,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haddon:1977:NMC,
author = "Bruce K. Haddon",
title = "Nested monitor calls",
journal = j-OPER-SYS-REV,
volume = "11",
number = "4",
pages = "18--23",
month = oct,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Needham:1977:CCC,
author = "R. M. Needham and R. D. H. Walker",
title = "The {Cambridge CAP} computer and its protection
system",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "1--10",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Needham:1977:CFS,
author = "R. M. Needham and A. D. Birrell",
title = "The {CAP} filing system",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "11--16",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Needham:1977:CPI,
author = "R. M. Needham",
title = "The {CAP} project --- an interim evaluation",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "17--22",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baskett:1977:TCD,
author = "Forest Baskett and John H. Howard and John T.
Montague",
title = "Task communication in {DEMOS}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "23--31",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Powell:1977:DFS,
author = "Michael L. Powell",
title = "The {DEMOS} file system",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "33--42",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:1977:MKD,
author = "Michael D. Schroeder and David D. Clark and Jerome H.
Saltzer",
title = "The {Multics} kernel design project",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "43--56",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Feiertag:1977:PMS,
author = "R. J. Feiertag and K. N. Levitt and L. Robinson",
title = "Proving multilevel security of a system design",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "57--65",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ellis:1977:CCD,
author = "Clarence A. Ellis",
title = "Consistency and correctness of duplicate database
systems",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "67--84",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Montgomery:1977:MSM,
author = "Warren A. Montgomery",
title = "Measurements of sharing in {Multics}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "85--90",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reed:1977:SES,
author = "David P. Reed and Rajendra K. Kanodia",
title = "Synchronization with eventcounts and sequencers
(extended abstract)",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "91--91",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mcdaniel:1977:MEA,
author = "Gene Mcdaniel",
title = "{Metric} (extended abstract): {A} kernel
instrumentation system for distributed environments",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "93--99",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Casey:1977:DSD,
author = "L. Casey and N. Shelness",
title = "A domain structure for distributed computer systems",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "101--108",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babonneau:1977:AGS,
author = "J. Y. Babonneau and M. S. Achard and G. Morisset and
M. B. Mounajjed",
title = "Automatic and general solution to the adaptation of
programs in a paging environment",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "109--116",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Masuda:1977:EPL,
author = "Takashi Masuda",
title = "Effect of program localities on memory management
strategies",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "117--124",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Potier:1977:ADP,
author = "Dominique Potier",
title = "Analysis of demand paging policies with swapped
working sets",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "125--131",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Choen:1977:ITC,
author = "Ellis Choen",
title = "Information transmission in computational systems",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "133--139",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Snyder:1977:SAP,
author = "Lawrence Snyder",
title = "On the synthesis and analysis of protection systems",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "141--150",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Russell:1977:PBP,
author = "David L. Russell",
title = "Process backup in producer-consumer systems",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "151--157",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Arvind:1977:IMD,
author = "Arvind and Kim P. Gostelow and Wil Plouffe",
title = "Indeterminacy, monitors, and dataflow",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "159--169",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:1977:TPR,
author = "David R. Cheriton and Michael A. Malcolm and Lawrence
S. Melen and Gary R. Sager",
title = "{Thoth}, a portable real-time operating system
(extended abstract)",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "171--171",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lohr:1977:BCP,
author = "Klaus-Peter L{\"o}hr",
title = "Beyond concurrent {Pascal}",
journal = j-OPER-SYS-REV,
volume = "11",
number = "5",
pages = "173--180",
month = nov,
year = "1977",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Parnas:1978:NPN,
author = "David L. Parnas",
title = "The non-problem of nested monitor calls",
journal = j-OPER-SYS-REV,
volume = "12",
number = "1",
pages = "12--18",
month = jan,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wettstein:1978:PNM,
author = "Horst Wettstein",
title = "The problem of nested monitor calls revisited",
journal = j-OPER-SYS-REV,
volume = "12",
number = "1",
pages = "19--23",
month = jan,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herbert:1978:NPA,
author = "A. J. Herbert",
title = "A new protection architecture for the {Cambridge}
capability computer",
journal = j-OPER-SYS-REV,
volume = "12",
number = "1",
pages = "24--28",
month = jan,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gilbert:1978:MSL,
author = "D. C. Gilbert",
title = "Modeling spin locks with queuing networks",
journal = j-OPER-SYS-REV,
volume = "12",
number = "1",
pages = "29--42",
month = jan,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saltzer:1978:RPD,
author = "Jerome H. Saltzer",
title = "Research problems of decentralized systems with
largely autonomous nodes",
journal = j-OPER-SYS-REV,
volume = "12",
number = "1",
pages = "43--52",
month = jan,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mohan:1978:SRO,
author = "C. Mohan",
title = "Survey of recent operating systems research, designs
and implementations",
journal = j-OPER-SYS-REV,
volume = "12",
number = "1",
pages = "53--89",
month = jan,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stroustrup:1978:UMI,
author = "Bjarne Stroustrup",
title = "On unifying module interfaces",
journal = j-OPER-SYS-REV,
volume = "12",
number = "1",
pages = "90--98",
month = jan,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:33 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anonymous:1978:E,
author = "Anonymous",
title = "Errata",
journal = j-OPER-SYS-REV,
volume = "12",
number = "2",
pages = "11--11",
month = apr,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saltzer:1978:DS,
author = "Jerome H. Saltzer",
title = "On digital signatures",
journal = j-OPER-SYS-REV,
volume = "12",
number = "2",
pages = "12--14",
month = apr,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schneider:1978:SCP,
author = "F. B. Schneider and A. J. Bernstein",
title = "Scheduling in {Concurrent Pascal}",
journal = j-OPER-SYS-REV,
volume = "12",
number = "2",
pages = "15--20",
month = apr,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Joseph:1978:MNM,
author = "M. Joseph and V. R. Prasad",
title = "More on nested monitor calls",
journal = j-OPER-SYS-REV,
volume = "12",
number = "2",
pages = "21--25",
month = apr,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cook:1978:CUC,
author = "Douglas Cook",
title = "The cost of using the {CAP} computer's protection
facilities",
journal = j-OPER-SYS-REV,
volume = "12",
number = "2",
pages = "26--30",
month = apr,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1978:AGC,
author = "A. D. Birrell and R. M. Needham",
title = "An asynchronous garbage collector for the {CAP} filing
system",
journal = j-OPER-SYS-REV,
volume = "12",
number = "2",
pages = "31--33",
month = apr,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1978:NYS,
author = "Dorothy E. Denning",
title = "A note from your secretary-treasurer",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "2--4",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gaines:1978:SSP,
author = "R. Stockton Gaines and Norman Z. Shapiro",
title = "Some security principles and their application to
computer security",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "19--28",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1978:CS,
author = "A. D. Birrell and R. M. Needham",
title = "Character streams",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "29--31",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:1978:UPO,
author = "Richard Miller",
title = "{UNIX}: a portable operating system?",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "32--37",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rose:1978:PEU,
author = "Greg Rose",
title = "Performance evaluation under {Unix} and a study of
{PDP-11} instruction usage",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "38--45",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lions:1978:OSC,
author = "J. Lions",
title = "An operating system case study",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "46--53",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gait:1978:EEP,
author = "Jason Gait",
title = "Easy entry: the password encryption problem",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "54--60",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gorski:1978:MRA,
author = "Janusz G{\'o}rski",
title = "A modular representation of the access control
system",
journal = j-OPER-SYS-REV,
volume = "12",
number = "3",
pages = "61--77",
month = jul,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heimbigner:1978:WDD,
author = "Dennis Heimbigner",
title = "Writing device drivers in {Concurrent Pascal}",
journal = j-OPER-SYS-REV,
volume = "12",
number = "4",
pages = "16--33",
month = oct,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ekanadham:1978:SNT,
author = "K. Ekanadham and A. J. Bernstein",
title = "Some new transitions in hierarchical level
structures",
journal = j-OPER-SYS-REV,
volume = "12",
number = "4",
pages = "34--38",
month = oct,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Smith:1978:BPR,
author = "Alan Jay Smith",
title = "Bibliography on paging and related topics",
journal = j-OPER-SYS-REV,
volume = "12",
number = "4",
pages = "39--56",
month = oct,
year = "1978",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Needham:1979:ACA,
author = "Roger M. Needham",
title = "Adding capability access to conventional file
servers",
journal = j-OPER-SYS-REV,
volume = "13",
number = "1",
pages = "3--4",
month = jan,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Keedy:1979:SOS,
author = "J. L. Keedy",
title = "On structuring operating systems with monitors",
journal = j-OPER-SYS-REV,
volume = "13",
number = "1",
pages = "5--9",
month = jan,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hopper:1979:AMM,
author = "K. Hopper and H. J. Kugler and C. Unger",
title = "Abstract machines modelling network control systems",
journal = j-OPER-SYS-REV,
volume = "13",
number = "1",
pages = "10--24",
month = jan,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lauer:1979:DOS,
author = "Hugh C. Lauer and Roger M. Needham",
title = "On the duality of operating system structures",
journal = j-OPER-SYS-REV,
volume = "13",
number = "2",
pages = "3--19",
month = apr,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Blasgen:1979:CP,
author = "Mike Blasgen and Jim Gray and Mike Mitoma and Tom
Price",
title = "The convoy phenomenon",
journal = j-OPER-SYS-REV,
volume = "13",
number = "2",
pages = "20--25",
month = apr,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tanenbaum:1979:MIP,
author = "Andrew S. Tanenbaum",
title = "A method for implementing paged, segmented virtual
memories on microprogrammable computers",
journal = j-OPER-SYS-REV,
volume = "13",
number = "2",
pages = "26--32",
month = apr,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Newton:1979:DPD,
author = "Glen Newton",
title = "Deadlock prevention, detection, and resolution: an
annotated bibliography",
journal = j-OPER-SYS-REV,
volume = "13",
number = "2",
pages = "33--44",
month = apr,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1979:NYS,
author = "Dorothy E. Denning",
title = "A note from your secretary-treasurer",
journal = j-OPER-SYS-REV,
volume = "13",
number = "3",
pages = "1--2",
month = jul,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Maegaard:1979:ROS,
author = "Henrik Maegaard and Aksel Andreasen",
title = "{REPOS}: {An} operating system for the {PDP-11}",
journal = j-OPER-SYS-REV,
volume = "13",
number = "3",
pages = "6--11",
month = jul,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barnett:1979:GCV,
author = "Jeffrey A. Barnett",
title = "Garbage collection versus swapping",
journal = j-OPER-SYS-REV,
volume = "13",
number = "3",
pages = "12--17",
month = jul,
year = "1979",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hebbard:1980:PAM,
author = "B. Hebbard and P. Grosso and T. Baldridge and C. Chan
and D. Fishman and P. Goshgarian and T. Hilton and
J. Hoshen and K. Hoult and G. Huntley and M. Stolarchuk
and L. Warner",
title = "A penetration analysis of the {Michigan Terminal
System}",
journal = j-OPER-SYS-REV,
volume = "14",
number = "1",
pages = "7--20",
month = jan,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:1980:CMD,
author = "Maurice V. Wilkes and Roger M. Needham",
title = "The {Cambridge Model Distributed System}",
journal = j-OPER-SYS-REV,
volume = "14",
number = "1",
pages = "21--29",
month = jan,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1980:MCS,
author = "Peter J. Denning and T. Don Dennis",
title = "On minimizing contention at semaphores",
journal = j-OPER-SYS-REV,
volume = "14",
number = "2",
pages = "9--16",
month = apr,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:1980:NHC,
author = "M. V. Wilkes",
title = "A new hardware capability architecture",
journal = j-OPER-SYS-REV,
volume = "14",
number = "2",
pages = "17--20",
month = apr,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
RSBM-number = "120",
}
@Article{Turton:1980:MOS,
author = "Trevor Turton",
title = "The management of operating system state data",
journal = j-OPER-SYS-REV,
volume = "14",
number = "2",
pages = "21--24",
month = apr,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Natarajan:1980:AAT,
author = "N. Natarajan",
title = "Atomic actions and timestamps",
journal = j-OPER-SYS-REV,
volume = "14",
number = "2",
pages = "25--27",
month = apr,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Klossner:1980:PBO,
author = "Andrew Klossner",
title = "A parallel between operating system and human
government",
journal = j-OPER-SYS-REV,
volume = "14",
number = "2",
pages = "28--31",
month = apr,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1980:NYS,
author = "Dorothy E. Denning",
title = "A note from your secretary-treasurer",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "2--4",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Amit:1980:SSQ,
author = "Neta Amit and Micha Hofri",
title = "A simple semaphore-queue management for
multiprocessing systems",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "13--15",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Francis:1980:SOS,
author = "N. D. Francis",
title = "Simulation of operating systems: a functional
flowchart",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "16--21",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hoch:1980:ICP,
author = "Charles Hoch and J. C. Browne",
title = "An implementation of capabilities on the {PDP-11/45}",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "22--32",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:1980:CAR,
author = "Anita K. Jones",
title = "Capability architecture revisited",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "33--35",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oestreicher:1980:SES,
author = "Dan Oestreicher and J. I. Strauss",
title = "A set of efficient semaphoring instructions",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "36--45",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sincoskie:1980:SDO,
author = "W. David Sincoskie and David J. Farber",
title = "{SODS\slash OS}: a distributed operating system for
the {IBM Series/1}",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "46--54",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sturgis:1980:IDU,
author = "H. Sturgis and J. Mitchell and J. Israel",
title = "Issues in the design and use of a distributed file
system",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "55--69",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhongxiu:1980:IDX,
author = "Sun Zhongxiu and Xie Li and Fei Xianglin and Yi Wenguo
and Tan Yaoming",
title = "An introduction to {DJS200\slash XT1}",
journal = j-OPER-SYS-REV,
volume = "14",
number = "3",
pages = "70--74",
month = jul,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Myers:1980:HIC,
author = "G. J. Myers and B. R. S. Buckingham",
title = "A hardware implementation of capability-based
addressing",
journal = j-OPER-SYS-REV,
volume = "14",
number = "4",
pages = "13--25",
month = oct,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dion:1980:CFS,
author = "Jeremy Dion",
title = "The {Cambridge File Server}",
journal = j-OPER-SYS-REV,
volume = "14",
number = "4",
pages = "26--35",
month = oct,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Garnett:1980:AGC,
author = "N. H. Garnett and R. M. Needham",
title = "An asynchronous garbage collector for the {Cambridge
File Server}",
journal = j-OPER-SYS-REV,
volume = "14",
number = "4",
pages = "36--40",
month = oct,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dellar:1980:RBS,
author = "Carl Dellar",
title = "Removing backing store administration from the {CAP}
operating system",
journal = j-OPER-SYS-REV,
volume = "14",
number = "4",
pages = "41--49",
month = oct,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wettstein:1980:CA,
author = "H. Wettstein and G. Merbeth",
title = "The concept of asynchronization",
journal = j-OPER-SYS-REV,
volume = "14",
number = "4",
pages = "50--70",
month = oct,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denning:1980:EVO,
author = "Peter J. Denning and Harold S. Stone",
title = "An exchange of views on operating systems courses",
journal = j-OPER-SYS-REV,
volume = "14",
number = "4",
pages = "71--82",
month = oct,
year = "1980",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkinson:1981:PAB,
author = "A. L. Wilkinson and D. H. Anderson and D. P. Chang and
Lee Hock Hin and A. J. Mayo and I. T. Viney and
R. Williams and W. Wright",
title = "A penetration analysis of a {Burroughs Large System}",
journal = j-OPER-SYS-REV,
volume = "15",
number = "1",
pages = "14--25",
month = jan,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fleisch:1981:APS,
author = "Brett D. Fleisch",
title = "An architecture for pup services on a distributed
operating system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "1",
pages = "26--44",
month = jan,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Madsen:1981:CSSa,
author = "Johannes Madsen",
title = "A computer system supporting data abstraction",
journal = j-OPER-SYS-REV,
volume = "15",
number = "1",
pages = "45--72",
month = jan,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hillsberg:1981:GTS,
author = "Bruce Light Hillsberg",
title = "Generic terminal support",
journal = j-OPER-SYS-REV,
volume = "15",
number = "2",
pages = "10--15",
month = apr,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lunn:1981:ARL,
author = "K. Lunn and K. H. Bennett",
title = "An algorithm for resource location in a loosely linked
distributed computer system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "2",
pages = "16--20",
month = apr,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:1981:XOS,
author = "Barton Miller and David Presotto",
title = "{XOS}: an operating system for the {X-tree}
architecture",
journal = j-OPER-SYS-REV,
volume = "15",
number = "2",
pages = "21--32",
month = apr,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lindsay:1981:BLS,
author = "D. C. Lindsay",
title = "On binding layers of software",
journal = j-OPER-SYS-REV,
volume = "15",
number = "2",
pages = "33--37",
month = apr,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Madsen:1981:CSSb,
author = "Johannes Madsen",
title = "A computer system supporting data abstraction",
journal = j-OPER-SYS-REV,
volume = "15",
number = "2",
pages = "38--78",
month = apr,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Svobodova:1981:PMC,
author = "Liba Svobodova",
title = "Performance monitoring in computer systems: a
structured approach",
journal = j-OPER-SYS-REV,
volume = "15",
number = "3",
pages = "39--50",
month = jul,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tanenbaum:1981:OAD,
author = "Andrew S. Tanenbaum and Sape J. Mullender",
title = "An overview of the {Amoeba} distributed operating
system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "3",
pages = "51--64",
month = jul,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Andrews:1981:NYS,
author = "Gregory R. Andrews",
title = "A note from your secretary-treasurer",
journal = j-OPER-SYS-REV,
volume = "15",
number = "4",
pages = "1--2",
month = oct,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Janson:1981:UTE,
author = "P. A. Janson",
title = "Using type-extension to organize virtual-memory
mechanisms",
journal = j-OPER-SYS-REV,
volume = "15",
number = "4",
pages = "6--38",
month = oct,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sanguinetti:1981:UMC,
author = "John Sanguinetti",
title = "The use of the monitor call instruction to implement
domain switching in the {IBM 370} architecture",
journal = j-OPER-SYS-REV,
volume = "15",
number = "4",
pages = "55--61",
month = oct,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bacon:1981:ADS,
author = "Jean Bacon",
title = "An approach to distributed software systems",
journal = j-OPER-SYS-REV,
volume = "15",
number = "4",
pages = "62--74",
month = oct,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bailey:1981:UDF,
author = "Kirk A. Bailey and Lee Boynton and Paul E. McKenney
and Gary J. Oliver and Dave Regan",
title = "User defined files",
journal = j-OPER-SYS-REV,
volume = "15",
number = "4",
pages = "75--84",
month = oct,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bernstein:1981:PRT,
author = "Arthur Bernstein and Paul K. {Harter, Jr.}",
title = "Proving real-time properties of programs with temporal
logic",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "1--11",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rushby:1981:DVS,
author = "J. M. Rushby",
title = "Design and verification of secure systems",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "12--21",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bartlett:1981:NK,
author = "Joel F. Bartlett",
title = "A {NonStop} kernel",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "22--29",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lauer:1981:ODO,
author = "Hugh C. Lauer",
title = "Observations on the development of an operating
system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "30--36",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fridrich:1981:FFS,
author = "M. Fridrich and W. Older",
title = "The {Felix File Server}",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "37--44",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mitchell:1981:CTN,
author = "James G. Mitchell and Jeremy Dion",
title = "A comparison of two network-based file servers",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "45--46",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Svobodova:1981:ROO,
author = "Liba Svobodova",
title = "A reliable object-oriented data repository for a
distributed computer system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "47--58",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herbert:1981:SCS,
author = "A. J. Herbert and R. M. Needham",
title = "Sequencing computation steps in a network",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "59--63",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rashid:1981:ACO,
author = "Richard F. Rashid and George G. Robertson",
title = "{Accent}: {A} communication oriented network operating
system kernel",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "64--75",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spector:1981:PRO,
author = "Alfred Z. Spector",
title = "Performing remote operations efficiently on a local
computer network",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "76--77",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babaoglu:1981:CSB,
author = "{\"O}zalp Babao{\u{g}}lu and William Joy",
title = "Converting a swap-based system to do paging in an
architecture lacking page-referenced bits",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "78--86",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carr:1981:WSE,
author = "Richard W. Carr and John L. Hennessy",
title = "{WSCLOCK}---a simple and effective algorithm for
virtual memory management",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "87--95",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1981:SFS,
author = "M. Satyanarayanan",
title = "A study of file sizes and functional lifetimes",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "96--108",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bishop:1981:HTG,
author = "Matt Bishop",
title = "Hierarchical {Take-Grant Protection} systems",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "109--122",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gifford:1981:CSI,
author = "David K. Gifford",
title = "Cryptographic sealing for information secrecy and
authentication",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "123--124",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cox:1981:UMI,
author = "George W. Cox and William M. Corwin and Konrad K. Lai
and Fred J. Pollack",
title = "A unified model and implementation for interprocess
communication in a multiprocessor environment",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "125--126",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kahn:1981:IMO,
author = "Kevin C. Kahn and William M. Corwin and T. Don Dennis
and Herman D'Hooge and David E. Hubka and Linda
A. Hutchins and John T. Montague and Fred J. Pollack",
title = "{iMAX}: {A} multiprocessor operating system for an
object-based computer",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "127--136",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pollack:1981:IOF,
author = "Fred J. Pollack and Kevin C. Kahn and Roy M.
Wilkinson",
title = "The {iMAX-432} object filing system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "137--147",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lazowska:1981:AES,
author = "Edward D. Lazowska and Henry M. Levy and Guy T. Almes
and Michael J. Fischer and Robert J. Fowler and Stephen
C. Vestal",
title = "The architecture of the {Eden} system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "148--159",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Luderer:1981:DUS,
author = "G. W. R. Luderer and H. Che and J. P. Haggerty and P.
A. Kirslis and W. T. Marshall",
title = "A distributed {UNIX} system based on a virtual circuit
switch",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "160--168",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Popek:1981:LNT,
author = "G. Popek and B. Walker and J. Chow and D. Edwards and
C. Kline and G. Rudisin and G. Thiel",
title = "{LOCUS} a network transparent, high reliability
distributed system",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "169--177",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1981:GED,
author = "Andrew D. Birrell and Roy Levin and Roger M. Needham
and Michael D. Schroeder",
title = "{Grapevine}: {An} exercise in distributed computing",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "178--179",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Meyrowitz:1981:BAD,
author = "Norman Meyrowitz and Margaret Moser",
title = "{BRUWIN}: {An} adaptable design strategy for window
manager\slash virtual terminal systems",
journal = j-OPER-SYS-REV,
volume = "15",
number = "5",
pages = "180--189",
month = dec,
year = "1981",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Holt:1982:TUL,
author = "R. C. Holt",
title = "{Tunis}: a {Unix} look-alike written in concurrent
{Euclid} (abstract)",
journal = j-OPER-SYS-REV,
volume = "16",
number = "1",
pages = "4--5",
month = jan,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rana:1982:THD,
author = "S. P. Rana",
title = "Triple-handed dining philosophers",
journal = j-OPER-SYS-REV,
volume = "16",
number = "1",
pages = "6--9",
month = jan,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weatherly:1982:ESM,
author = "Richard M. Weatherly and James F. Leathrum",
title = "Efficient semaphore management using read\slash
modify\slash write memory cycles",
journal = j-OPER-SYS-REV,
volume = "16",
number = "1",
pages = "10--13",
month = jan,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Taft:1982:OBV,
author = "S. Tucker Taft",
title = "An object-based virtual operating system for the {Ada}
programming support environment",
journal = j-OPER-SYS-REV,
volume = "16",
number = "1",
pages = "14--25",
month = jan,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nessett:1982:IPD,
author = "D. M. Nessett",
title = "Identifier protection in a distributed operating
system",
journal = j-OPER-SYS-REV,
volume = "16",
number = "1",
pages = "26--31",
month = jan,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mooney:1982:UUI,
author = "James D. Mooney",
title = "{USIM}: a user interface manager",
journal = j-OPER-SYS-REV,
volume = "16",
number = "1",
pages = "32--40",
month = jan,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kruijer:1982:PMC,
author = "H. S. M. Kruijer",
title = "Processor management in a concurrent {Pascal} kernel",
journal = j-OPER-SYS-REV,
volume = "16",
number = "2",
pages = "7--17",
month = apr,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Adams:1982:PRM,
author = "J. M. Adams and A. P. Black",
title = "On proof rules for monitors",
journal = j-OPER-SYS-REV,
volume = "16",
number = "2",
pages = "18--27",
month = apr,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See reply \cite{Howard:1982:RPR}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kant:1982:GCR,
author = "Krishna Kant and Abraham Silberschatz",
title = "On the generalized critical region construct",
journal = j-OPER-SYS-REV,
volume = "16",
number = "3",
pages = "4--16",
month = jul,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Howard:1982:RPR,
author = "John H. Howard",
title = "Reply to {\em ``On Proof Rules for Monitors''}",
journal = j-OPER-SYS-REV,
volume = "16",
number = "4",
pages = "8--9",
month = oct,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Adams:1982:PRM}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Metzner:1982:SOS,
author = "J. R. Metzner",
title = "Structuring operating systems literature for the
graduate course",
journal = j-OPER-SYS-REV,
volume = "16",
number = "4",
pages = "10--25",
month = oct,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Traiger:1982:VMM,
author = "Irving L. Traiger",
title = "Virtual memory management for database systems",
journal = j-OPER-SYS-REV,
volume = "16",
number = "4",
pages = "26--48",
month = oct,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Girling:1982:ORH,
author = "C. Gray Girling",
title = "Object representation on a heterogeneous network",
journal = j-OPER-SYS-REV,
volume = "16",
number = "4",
pages = "49--59",
month = oct,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Harper:1982:MEW,
author = "M. E. Harper",
title = "Mutual exclusion within both software- and
hardware-driven kernel primitives",
journal = j-OPER-SYS-REV,
volume = "16",
number = "4",
pages = "60--68",
month = oct,
year = "1982",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Andrews:1983:RSM,
author = "Gregory R. Andrews",
title = "Report to the {SIGOPS} membership",
journal = j-OPER-SYS-REV,
volume = "17",
number = "1",
pages = "2--3",
month = jan,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Staff:1983:RPS,
author = "{Staff}",
title = "Review of {{\em ``Probability and statistics with
reliability, queueing and computer science
applications''} by Kishor S. Trivedi. Prentice-Hall,
Englewood-Cliffs, 1982}",
journal = j-OPER-SYS-REV,
volume = "17",
number = "1",
pages = "9--9",
month = jan,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See
\cite{Trivedi:1982:PSR,Waite:1983:RPS,Trivedi:2002:PSR}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brereton:1983:DRI,
author = "Pearl Brereton",
title = "Detection and resolution of inconsistencies among
distributed replicates of files",
journal = j-OPER-SYS-REV,
volume = "17",
number = "1",
pages = "10--15",
month = jan,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Needham:1983:HCS,
author = "R. M. Needham and A. J. Herbert and J. G. Mitchell",
title = "How to connect stable memory to a computer",
journal = j-OPER-SYS-REV,
volume = "17",
number = "1",
pages = "16--16",
month = jan,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mamrak:1983:PRD,
author = "Sandra A. Mamrak and Dennis Leinbaugh and Toby S.
Berk",
title = "A progress report on the {Desperanto} research
project: software support for distributed processing",
journal = j-OPER-SYS-REV,
volume = "17",
number = "1",
pages = "17--29",
month = jan,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peinl:1983:SMD,
author = "Peter Peinl and Andreas Reuter",
title = "Synchronizing multiple database processes in a tightly
coupled multiprocessor environment",
journal = j-OPER-SYS-REV,
volume = "17",
number = "1",
pages = "30--37",
month = jan,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1983:RMD,
author = "William M. Waite",
title = "Reviews of {``{\em Medusa, A Distributed Operating
System\/} by John K. Ousterhout'', Harold S. Stone,
Series Editor. UMI Research Pres, University Microfilms
International, Ann Arbor, Michigan, 1981}",
journal = j-OPER-SYS-REV,
volume = "17",
number = "2",
pages = "9--10",
month = apr,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Ousterhout:1981:MDO}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1983:RPS,
author = "William M. Waite",
title = "Reviews of {``{\em Probability and Statistics with
Reliability, Queueing and Computer Science
Applications\/} by Kishor S. Trivedi'', Prentice-Hall,
Englewood-Cliffs, 1982}",
journal = j-OPER-SYS-REV,
volume = "17",
number = "2",
pages = "10--10",
month = apr,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See
\cite{Trivedi:1982:PSR,Staff:1983:RPS,Trivedi:2002:PSR}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kant:1983:ELC,
author = "Krishna Kant",
title = "Efficient local checkpointing for software fault
tolerance",
journal = j-OPER-SYS-REV,
volume = "17",
number = "2",
pages = "11--13",
month = apr,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fleisch:1983:OSP,
author = "Brett D. Fleisch",
title = "Operating systems: a perspective on future trends",
journal = j-OPER-SYS-REV,
volume = "17",
number = "2",
pages = "14--17",
month = apr,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spector:1983:TCR,
author = "Alfred Z. Spector and Peter M. Schwarz",
title = "{Transactions}: a construct for reliable distributed
computing",
journal = j-OPER-SYS-REV,
volume = "17",
number = "2",
pages = "18--35",
month = apr,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:39 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haddon:1983:RTA,
author = "Bruce K. Haddon",
title = "Review of {{\em ``Technical aspects of data
communication''}: (second edition) by John E. McNamara.
Digital Press, Educational Services, Digital Equipment
Corporation, Bedford, Massachusetts, 1982}",
journal = j-OPER-SYS-REV,
volume = "17",
number = "3",
pages = "7--7",
month = jul,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See
\cite{McNamara:1977:TAD,McNamara:1982:TAD,McNamara:1988:TAD}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tuggle:1983:RPF,
author = "J. L. Tuggle",
title = "Review of ``Planning for future market events using
data processing support by {Jerome Svigals.'}'
{Macmillan Inc}. 1983",
journal = j-OPER-SYS-REV,
volume = "17",
number = "3",
pages = "8--8",
month = jul,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Svigals:1983:PFM}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barnett:1983:PLP,
author = "Jeffrey A. Barnett and Alvin S. Cooperband",
title = "Priority is a limited property",
journal = j-OPER-SYS-REV,
volume = "17",
number = "3",
pages = "9--9",
month = jul,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Witten:1983:JDS,
author = "Ian H. Witten and Graham M. Birtwistle and John Cleary
and David R. Hill and Danny Levinson and Greg Lomow and
Radford Neal and Murray Peterson and Brian W. Unger and
Brian Wyvill",
title = "{Jade}: a distributed software prototyping
environment",
journal = j-OPER-SYS-REV,
volume = "17",
number = "3",
pages = "10--23",
month = jul,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schmutz:1983:WSN,
author = "H. Schmutz and P. Silberbusch",
title = "Working sets and near-optimality",
journal = j-OPER-SYS-REV,
volume = "17",
number = "3",
pages = "24--29",
month = jul,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhongxiu:1983:ZDO,
author = "Sun Zhongxiu and Zhang Du and Yan Peigen",
title = "{ZCZOS}: a distributed operating system for a {LSI-11}
microcomputer network",
journal = j-OPER-SYS-REV,
volume = "17",
number = "3",
pages = "30--34",
month = jul,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hansen:1983:UPC,
author = "Per Brinch Hansen",
title = "Using personal computers in operating system courses",
journal = j-OPER-SYS-REV,
volume = "17",
number = "3",
pages = "41--44",
month = jul,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zobel:1983:DPC,
author = "Dieter Z{\"o}bel",
title = "The {Deadlock} problem: a classifying bibliography",
journal = j-OPER-SYS-REV,
volume = "17",
number = "4",
pages = "6--15",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lindsay:1983:CCR,
author = "Bruce G. Lindsay and Laura M. Haas and Paul F. Wilms
and Robert A. Yost",
title = "Computation {\&} communication in {R}: a distributed
database manager",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "1--2",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1983:IRP,
author = "Andrew D. Birrell and Bruce Jay Nelson",
title = "Implementing {Remote} procedure calls",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "3--3",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Black:1983:ASC,
author = "Andrew P. Black",
title = "An asymmetric stream communication system",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "4--10",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Craft:1983:RMD,
author = "Daniel H. Craft",
title = "Resource management in a decentralized system",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "11--19",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reid:1983:FSS,
author = "Loretta Guarino Reid and Philip L. Karlton",
title = "A file system supporting cooperation between
programs",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "20--29",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stephenson:1983:NMD,
author = "C. J. Stephenson",
title = "New methods for dynamic storage allocation ({Fast
Fits})",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "30--32",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lampson:1983:HCS,
author = "Butler W. Lampson",
title = "Hints for computer system design",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "33--48",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Walker:1983:LDO,
author = "Bruce Walker and Gerald Popek and Robert English and
Charles Kline and Greg Thiel",
title = "The {LOCUS} distributed operating system",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "49--70",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mueller:1983:NTM,
author = "Erik T. Mueller and Johanna D. Moore and Gerald J.
Popek",
title = "A nested transaction mechanism for {LOCUS}",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "71--89",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Borg:1983:MSS,
author = "Anita Borg and Jim Baumbach and Sam Glazer",
title = "A message system supporting fault tolerance",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "90--99",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Powell:1983:PRB,
author = "Michael L. Powell and David L. Presotto",
title = "{Publishing}: a reliable broadcast communication
mechanism",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "100--109",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Powell:1983:PMD,
author = "Michael L. Powell and Barton P. Miller",
title = "Process migration in {DEMOS\slash MP}",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "110--119",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Richardson:1983:TFM,
author = "M. F. Richardson and R. M. Needham",
title = "The {TRIPOS} filing machine, a front end to a file
server",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "120--128",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:1983:DVK,
author = "David R. Cheriton and Willy Zwaenepoel",
title = "The distributed {V} kernel and its performance for
diskless workstations",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "129--140",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:1983:EGS,
author = "Michael D. Schroeder and Andrew D. Birrell and Roger
M. Needham",
title = "Experience with {Grapevine} (Summary): the growth of a
distributed system",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "141--142",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Silverman:1983:RVS,
author = "Jonathan M. Silverman",
title = "Reflections on the verification of the security of an
operating system kernel",
journal = j-OPER-SYS-REV,
volume = "17",
number = "5",
pages = "143--154",
month = oct,
year = "1983",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kavi:1984:AQ,
author = "Krishna M. Kavi and K. Krishnamohan",
title = "Architecture quality",
journal = j-OPER-SYS-REV,
volume = "18",
number = "1",
pages = "11--19",
month = jan,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Owen:1984:DCI,
author = "Kenneth Owen",
title = "Data communications: {IFIP}'s international
``network'' of experts",
journal = j-OPER-SYS-REV,
volume = "18",
number = "1",
pages = "20--26",
month = jan,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Atwood:1984:UTO,
author = "J. W. Atwood",
title = "Use of {Tunis} in an operating systems design course",
journal = j-OPER-SYS-REV,
volume = "18",
number = "2",
pages = "6--7",
month = apr,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stonebraker:1984:VMT,
author = "Michael Stonebraker",
title = "Virtual memory transaction management",
journal = j-OPER-SYS-REV,
volume = "18",
number = "2",
pages = "8--16",
month = apr,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haddon:1984:BRS,
author = "Bruce K. Haddon",
title = "Book review of ``{Security, IFIP\slash Sec'83:
proceedings of the first security conference''
North-Holland Publishing Co. 1983}",
journal = j-OPER-SYS-REV,
volume = "18",
number = "3",
pages = "14--14",
month = jul,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Feak:1983:SIS}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sopka:1984:NPP,
author = "John R. Sopka",
title = "National parallel processing research council
executive committee charter",
journal = j-OPER-SYS-REV,
volume = "18",
number = "3",
pages = "25--27",
month = jul,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lau:1984:TPN,
author = "Francis C. M. Lau",
title = "Two-part names and process termination",
journal = j-OPER-SYS-REV,
volume = "18",
number = "3",
pages = "28--30",
month = jul,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Routh:1984:PAA,
author = "Richard LeRoy Routh",
title = "A proposal for an architectural approach which
apparently solves all known software-based internal
computer security problems",
journal = j-OPER-SYS-REV,
volume = "18",
number = "3",
pages = "31--39",
month = jul,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kutti:1984:WDK,
author = "Swamy Kutti",
title = "Why a distributed kernel?",
journal = j-OPER-SYS-REV,
volume = "18",
number = "4",
pages = "5--11",
month = oct,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:1984:EUR,
author = "David R. Cheriton",
title = "An experiment using registers for fast message-based
interprocess communication",
journal = j-OPER-SYS-REV,
volume = "18",
number = "4",
pages = "12--20",
month = oct,
year = "1984",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wood:1985:RVV,
author = "David C. M. Wood",
title = "Review of {``VAX\slash VMS Internals and Data
Structures by Lawrence J. Kenah and Simon F. Bate'',
Digital Press, Educational Services, Digital Equipment
Corporation, Bedford, Massachusetts (1984), ISBN
0-932376-52-5.}",
journal = j-OPER-SYS-REV,
volume = "19",
number = "1",
pages = "5--5",
month = jan,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See
\cite{Kenah:1984:VVI,Kenah:1988:VVI,Goldenberg:1991:VVI}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stonebraker:1985:PSD,
author = "Michael Stonebraker and Deborah DuBourdieux and
William Edwards",
title = "Problems in supporting data base transactions in an
operating system transaction manager",
journal = j-OPER-SYS-REV,
volume = "19",
number = "1",
pages = "6--14",
month = jan,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hac:1985:DFS,
author = "Anna Hac",
title = "Distributed file systems --- a survey",
journal = j-OPER-SYS-REV,
volume = "19",
number = "1",
pages = "15--18",
month = jan,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weihl:1985:DDC,
author = "William E. Weihl",
title = "Data-dependent concurrency control and recovery",
journal = j-OPER-SYS-REV,
volume = "19",
number = "1",
pages = "19--31",
month = jan,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Allchin:1985:SRA,
author = "J. E. Allchin and M. S. McKendry",
title = "Synchronization and recovery of actions",
journal = j-OPER-SYS-REV,
volume = "19",
number = "1",
pages = "32--45",
month = jan,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lakhotia:1985:IE,
author = "Arun Lakhotia",
title = "Implication and equivalence {I/O}",
journal = j-OPER-SYS-REV,
volume = "19",
number = "1",
pages = "46--52",
month = jan,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Singh:1985:IPS,
author = "Kamaljit Singh",
title = "On improvements to password security",
journal = j-OPER-SYS-REV,
volume = "19",
number = "1",
pages = "53--60",
month = jan,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kahn:1985:FRS,
author = "Kevin C. Kahn",
title = "Financial report to the {SIGOPS} membership",
journal = j-OPER-SYS-REV,
volume = "19",
number = "2",
pages = "2--2",
month = apr,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mohan:1985:ECP,
author = "C. Mohan and B. Lindsay",
title = "Efficient commit protocols for the tree of processes
model of distributed transactions",
journal = j-OPER-SYS-REV,
volume = "19",
number = "2",
pages = "40--52",
month = apr,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Francez:1985:SCA,
author = "Nissim Francez and Brent Hailpern",
title = "{Script}: a communication abstraction mechanism",
journal = j-OPER-SYS-REV,
volume = "19",
number = "2",
pages = "53--67",
month = apr,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yuen:1985:PTP,
author = "C. K. Yuen",
title = "On programs, tasks and processes",
journal = j-OPER-SYS-REV,
volume = "19",
number = "3",
pages = "7--8",
month = jul,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Loepere:1985:RCC,
author = "Keith Loepere",
title = "Resolving covert channels within a {B2} class secure
system",
journal = j-OPER-SYS-REV,
volume = "19",
number = "3",
pages = "9--28",
month = jul,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mohan:1985:MDT,
author = "C. Mohan and R. Strong and S. Finkelstein",
title = "Method for distributed transaction commit and recovery
using {Byzantine Agreement} within clusters of
processors",
journal = j-OPER-SYS-REV,
volume = "19",
number = "3",
pages = "29--43",
month = jul,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Marzullo:1985:MTD,
author = "Keith Marzullo and Susan Owicki",
title = "Maintaining the time in a distributed system",
journal = j-OPER-SYS-REV,
volume = "19",
number = "3",
pages = "44--54",
month = jul,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spratt:1985:TRJ,
author = "Lindsey L. Spratt",
title = "The transaction resolution journal: extending the
before journal",
journal = j-OPER-SYS-REV,
volume = "19",
number = "3",
pages = "55--62",
month = jul,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haddon:1985:RIS,
author = "Bruce K. Haddon",
title = "Review of {{\em ``Information systems design
methodologies: a feature analysis''}. Edited by T. W.
Olle, H. G. Sol, and C. J. Tully. North-Holland
Publishing Co. 1983}",
journal = j-OPER-SYS-REV,
volume = "19",
number = "4",
pages = "4--5",
month = oct,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See
\cite{Olle:1982:ISD,Olle:1983:ISD,Olle:1986:ISD}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hardy:1985:KA,
author = "Norman Hardy",
title = "{KeyKOS} architecture",
journal = j-OPER-SYS-REV,
volume = "19",
number = "4",
pages = "8--25",
month = oct,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:1985:PTP,
author = "David R. Cheriton",
title = "Preliminary thoughts on problem-oriented shared
memory: a decentralized approach to distributed
systems",
journal = j-OPER-SYS-REV,
volume = "19",
number = "4",
pages = "26--33",
month = oct,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lamport:1985:SPU,
author = "Leslie Lamport",
title = "Solved problems, unsolved problems and non-problems in
concurrency",
journal = j-OPER-SYS-REV,
volume = "19",
number = "4",
pages = "34--44",
month = oct,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kepecs:1985:SSO,
author = "Jonathan Kepecs and Marvin Solomon",
title = "{SODA}: a simplified operating system for distributed
applications",
journal = j-OPER-SYS-REV,
volume = "19",
number = "4",
pages = "45--56",
month = oct,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kronenberg:1985:VEA,
author = "Nancy P. Kronenberg and Henry M. Levy and William D.
Strecker",
title = "{VAXclusters} (extended abstract): a closely-coupled
distributed system",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "1--1",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Theimer:1985:PRE,
author = "Marvin M. Theimer and Keith A. Lantz and David R.
Cheriton",
title = "Preemptable remote execution facilities for the
{V}-system",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "2--12",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fitzgerald:1985:IVM,
author = "Robert Fitzgerald and Richard F. Rashid",
title = "The integration of virtual memory management and
interprocess communication in accent (abstract only)",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "13--14",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ousterhout:1985:TDA,
author = "John K. Ousterhout and Herv{\'e} {Da Costa} and David
Harrison and John A. Kunze and Mike Kupfer and James
G. Thompson",
title = "A trace-driven analysis of the {UNIX 4.2 BSD} file
system",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "15--24",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:1985:CFS,
author = "Michael D. Schroeder and David K. Gifford and Roger M.
Needham",
title = "A caching file system for a programmer's workstation",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "25--34",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1985:IDF,
author = "M. Satyanarayanan and John H. Howard and David A.
Nichols and Robert N. Sidebotham and Alfred Z. Spector
and Michael J. West",
title = "The {ITC} distributed file system: principles and
design",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "35--50",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mullender:1985:DFS,
author = "Sape J. Mullender and Andrew S. Tanenbaum",
title = "A distributed file service based on optimistic
concurrency control",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "51--62",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cooper:1985:RDP,
author = "Eric C. Cooper",
title = "Replicated distributed programs",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "63--78",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birman:1985:RFT,
author = "Kenneth P. Birman",
title = "Replication and fault-tolerance in the {ISIS} system",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "79--86",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Davcev:1985:CRC,
author = "Dan{\v{c}}o Dav{\v{c}}ev and Walter A. Burkhard",
title = "Consistency and recovery control for replicated
files",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "87--96",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Malkawi:1985:CDM,
author = "Mohammad Malkawi and Janek Patel",
title = "Compiler directed memory management policy for
numerical programs",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "97--106",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reinhardt:1985:DFA,
author = "Steve Reinhardt",
title = "A data-flow approach to multitasking on {CRAY X-MP}
computers",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "107--114",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weinstein:1985:TSD,
author = "Matthew J. Weinstein and Thomas W. {Page, Jr.} and
Brian K. Livezey and Gerald J. Popek",
title = "Transactions and synchronization in a distributed
operating system",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "115--126",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spector:1985:DTR,
author = "Alfred Z. Spector and Dean Daniels and Daniel Duchamp
and Jeffrey L. Eppinger and Randy Pausch",
title = "Distributed transactions for reliable systems",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "127--146",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oki:1985:ROS,
author = "Brian M. Oki and Barbara H. Liskov and Robert W.
Scheifler",
title = "Reliable object storage to support atomic actions",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "147--159",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carriero:1985:NLK,
author = "Nicholas Carriero and David Gelernter",
title = "The {S/Net}'s {Linda} kernel (extended abstract)",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "160--160",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gifford:1985:ALS,
author = "David K. Gifford and Robert W. Baldwin and Stephen T.
Berlin and John M. Lucassen",
title = "An architecture for large scale information systems",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "161--170",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Clark:1985:SSU,
author = "David D. Clark",
title = "The structuring of systems using upcalls",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "171--180",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Black:1985:SDA,
author = "Andrew P. Black",
title = "Supporting distributed applications: experience with
{Eden}",
journal = j-OPER-SYS-REV,
volume = "19",
number = "5",
pages = "181--193",
month = dec,
year = "1985",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:44:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anonymous:1986:FR,
author = "Anonymous",
title = "Financial {Report}",
journal = j-OPER-SYS-REV,
volume = "20",
number = "1",
pages = "4--4",
month = jan,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lorin:1986:EAO,
author = "Harold Lorin",
title = "An expanded approach to objects",
journal = j-OPER-SYS-REV,
volume = "20",
number = "1",
pages = "6--11",
month = jan,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Singleton:1986:SMF,
author = "P. Singleton and K. H. Bennett and O. P. Brereton",
title = "A single model for files and processes",
journal = j-OPER-SYS-REV,
volume = "20",
number = "1",
pages = "12--18",
month = jan,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ancona:1986:IUP,
author = "M. Ancona and A. Clematis and V. Gianuzzi",
title = "Interfacing user processes and kernel in high level
language",
journal = j-OPER-SYS-REV,
volume = "20",
number = "1",
pages = "19--23",
month = jan,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spector:1986:ARD,
author = "Alfred Z. Spector and Dean Daniels",
title = "An algorithm for replicated directories",
journal = j-OPER-SYS-REV,
volume = "20",
number = "1",
pages = "24--43",
month = jan,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cooper:1986:RPC,
author = "Eric C. Cooper",
title = "Replicated procedure call",
journal = j-OPER-SYS-REV,
volume = "20",
number = "1",
pages = "44--56",
month = jan,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wuu:1986:ESR,
author = "Gene T. J. Wuu and Arthur J. Bernstein",
title = "Efficient solutions to the replicated log and
dictionary problems",
journal = j-OPER-SYS-REV,
volume = "20",
number = "1",
pages = "57--66",
month = jan,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1986:BRH,
author = "Joanne L. Waite",
title = "Book Review: {{\em A Handbook of Software Development
and Operating Procedures for Micro computers\/} by Paul
Holliday (Macmillan Publishing Company 1985)}",
journal = j-OPER-SYS-REV,
volume = "20",
number = "2",
pages = "6--7",
month = apr,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pratt:1986:AMM,
author = "S. J. Pratt",
title = "The alchemy model: a model for homogeneous and
heterogeneous distributed computing system",
journal = j-OPER-SYS-REV,
volume = "20",
number = "2",
pages = "25--37",
month = apr,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brumfield:1986:GOS,
author = "Jeffrey A. Brumfield",
title = "A {Guide To Operating Systems Literature}",
journal = j-OPER-SYS-REV,
volume = "20",
number = "2",
pages = "38--42",
month = apr,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lantz:1986:TUD,
author = "Keith A. Lantz and Judy L. Edighoffer and Bruce L.
Hitson",
title = "Towards a universal directory service",
journal = j-OPER-SYS-REV,
volume = "20",
number = "2",
pages = "43--53",
month = apr,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mullender:1986:DMM,
author = "Sape J. Mullender and Paul M. B. Vitanyi",
title = "Distributed match-making for processes in computer
networks",
journal = j-OPER-SYS-REV,
volume = "20",
number = "2",
pages = "54--64",
month = apr,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sansom:1986:BRC,
author = "Robert Sansom",
title = "Book Review: {{\em Computer Security: A Global
Challenge --- Proceedings of the Second IFIP
International Conference on Computer Security,
IFIP\slash Sec'84, Toronto, Ontario, Canada, 10--12
September, 1984\/}: (Elsevier Science Publishing Co.
1984)}",
journal = j-OPER-SYS-REV,
volume = "20",
number = "3",
pages = "9--9",
month = jul,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lamport:1986:BCS,
author = "Leslie Lamport and P. M. Melliar Smith",
title = "{Byzantine} clock synchronization",
journal = j-OPER-SYS-REV,
volume = "20",
number = "3",
pages = "10--16",
month = jul,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheung:1986:SOT,
author = "David Cheung and Tiko Kameda",
title = "Site optimal termination protocols for a distributed
database under network partitioning",
journal = j-OPER-SYS-REV,
volume = "20",
number = "3",
pages = "17--27",
month = jul,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rattan:1986:TFV,
author = "I. Rattan and L. P. S. Singh",
title = "On table fragmentation in virtual memory management",
journal = j-OPER-SYS-REV,
volume = "20",
number = "3",
pages = "28--30",
month = jul,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herlihy:1986:CHA,
author = "Maurice Herlihy",
title = "Comparing how atomicity mechanisms support
replication",
journal = j-OPER-SYS-REV,
volume = "20",
number = "3",
pages = "31--39",
month = jul,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:1986:PNR,
author = "Du Zhang and Meiliu Lu",
title = "Process name resolution in fault-intolerant {CSP}
programs",
journal = j-OPER-SYS-REV,
volume = "20",
number = "4",
pages = "9--15",
month = oct,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Olagunju:1986:EPI,
author = "Amos O. Olagunju and Elvis Borders",
title = "Emulators; prospective instruments for instruction in
systems programming",
journal = j-OPER-SYS-REV,
volume = "20",
number = "4",
pages = "16--24",
month = oct,
year = "1986",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Litant:1987:BRC,
author = "Thomas F. Litant",
title = "Book Review: {{\em Computer Security: the Practical
Issues in a Troubled World}, (Elsevier Science
Publishers, Amsterdam 1985)}",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "3--5",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Needham:1987:AR,
author = "R. M. Needham and M. D. Schroeder",
title = "Authentication revisited",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "7--7",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Otway:1987:ETM,
author = "Dave Otway and Owen Rees",
title = "Efficient and timely mutual authentication",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "8--10",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nicol:1987:OSD,
author = "John R. Nicol and Gordon S. Blair and Jonathan
Walpole",
title = "Operating system design: towards a holistic
approach?",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "11--19",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tanenbaum:1987:UCS,
author = "Andrew S. Tanenbaum",
title = "A {UNIX} clone with source code for operating systems
courses",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "20--29",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guenther:1987:REU,
author = "G. R. Guenther",
title = "Running 7th edition {UNIX} programs on a {VAX} in
compatibility mode",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "30--33",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rattan:1987:MMU,
author = "I. Rattan",
title = "Memory management units for microcomputer operating
systems",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "34--38",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ruckert:1987:LSC,
author = "Rogert G. Ruckert and John D. Dean",
title = "Launching a successful {CPME} program in a
multi-vendor environment",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "39--48",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mullender:1987:RSE,
author = "Sape Mullender",
title = "Report on the {Second European SIGOPS Workshop
``Making Distributed Systems Work''}",
journal = j-OPER-SYS-REV,
volume = "21",
number = "1",
pages = "49--84",
month = jan,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Andler:1987:FR,
author = "Sten F. Andler",
title = "Financial report",
journal = j-OPER-SYS-REV,
volume = "21",
number = "2",
pages = "3--4",
month = apr,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Turnbull:1987:SHG,
author = "Martin Turnbull",
title = "Support for heterogeneity in the global distributed
operating system",
journal = j-OPER-SYS-REV,
volume = "21",
number = "2",
pages = "11--22",
month = apr,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pratt:1987:CTA,
author = "S. J. Pratt",
title = "Catastrophe theory: its application in operating
system design",
journal = j-OPER-SYS-REV,
volume = "21",
number = "2",
pages = "23--32",
month = apr,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herlihy:1987:OCC,
author = "Maurice Herlihy",
title = "Optimistic concurrency control for abstract data
types",
journal = j-OPER-SYS-REV,
volume = "21",
number = "2",
pages = "33--44",
month = apr,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gordon:1987:WMG,
author = "Robert L. Gordon",
title = "Window management, graphics, and operating systems",
journal = j-OPER-SYS-REV,
volume = "21",
number = "3",
pages = "5--8",
month = jul,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Campbell:1987:CCH,
author = "Roy Campbell and Garry Johnston and Vincent Russo",
title = "Choices (class hierarchical open interface for custom
embedded systems)",
journal = j-OPER-SYS-REV,
volume = "21",
number = "3",
pages = "9--17",
month = jul,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sauer:1987:RPD,
author = "Charles H. Sauer and Don W. Johnson and Larry K.
Loucks and Amal A. Shaheen-Gouda and Todd A. Smith",
title = "{RT PC} distributed services overview",
journal = j-OPER-SYS-REV,
volume = "21",
number = "3",
pages = "18--29",
month = jul,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fossum:1987:PXF,
author = "Timothy V. Fossum",
title = "{PC-XINU} features and installation",
journal = j-OPER-SYS-REV,
volume = "21",
number = "3",
pages = "30--33",
month = jul,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:45 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wirth:1987:HAP,
author = "Niklaus Wirth",
title = "Hardware architectures for programming languages and
programming languages for hardware architectures",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "2--8",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Beck:1987:VAM,
author = "Bob Beck and Bob Kasten and Shreekant Thakkar",
title = "{VLSI} assist for a multiprocessor",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "10--20",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bisiani:1987:ASM,
author = "Roberto Bisiani and Alessandro Forin",
title = "Architectural support for multilanguage parallel
programming on heterogeneous systems",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "21--30",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rashid:1987:MIV,
author = "Richard Rashid and Avadis Tevanian and Michael Young
and David Golub and Robert Baron",
title = "Machine-independent virtual memory management for
paged uniprocessor and multiprocessor architectures",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "31--39",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hayes:1987:ADE,
author = "John R. Hayes and Martin E. Fraeman and Robert L.
Williams and Thomas Zaremba",
title = "An architecture for the direct execution of the
{Forth} programming language",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "42--49",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Steenkiste:1987:TTC,
author = "Peter Steenkiste and John Hennessy",
title = "Tags and type checking in {LISP}: hardware and
software approaches",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "50--59",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Davidson:1987:EIS,
author = "Jack W. Davidson and Richard A. Vaughan",
title = "The effect of instruction set complexity on program
size and memory performance",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "60--64",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Atkinson:1987:DP,
author = "Russell R. Atkinson and Edward M. McCreight",
title = "The dragon processor",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "65--69",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Goodman:1987:CMV,
author = "James R. Goodman",
title = "Coherency for multiprocessor virtual address caches",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "72--81",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cargill:1987:CHS,
author = "T. A. Cargill and B. N. Locanthi",
title = "Cheap hardware support for software debugging and
profiling",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "82--83",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Georgiou:1987:ECI,
author = "C. J. Georgiou and S. L. Palmer and P. L. Rosenfeld",
title = "An experimental coprocessor for implementing
persistent objects on an {IBM 4381}",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "84--87",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Magenheimer:1987:IMD,
author = "Daniel J. Magenheimer and Liz Peters and Karl Pettis
and Dan Zuras",
title = "Integer multiplication and division on the {HP}
precision architecture",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "90--99",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wall:1987:MEU,
author = "David W. Wall and Michael L. Powell",
title = "The {Mahler} experience: using an intermediate
language as the machine description",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "100--104",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weiss:1987:SSC,
author = "Shlomo Weiss and James E. Smith",
title = "A study of scalar compilation techniques for pipelined
supercomputers",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "105--109",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bush:1987:CSR,
author = "William R. Bush and A. Dain Samples and David Ungar
and Paul N. Hilfinger",
title = "Compiling {Smalltalk-80} to a {RISC}",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "112--116",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chow:1987:HMA,
author = "F. Chow and S. Correll and M. Himelstein and E.
Killian and L. Weber",
title = "How many addressing modes are enough?",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "117--121",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Massalin:1987:SLS,
author = "Henry Massalin",
title = "{Superoptimizer}: a look at the smallest program",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "122--126",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Taki:1987:PAE,
author = "Kazuo Taki and Katzuto Nakajima and Hiroshi Nakashima
and Morihiro Ikeda",
title = "Performance and architectural evaluation of the {PSI}
machine",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "128--135",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Borriello:1987:RVC,
author = "Gaetano Borriello and Andrew R. Cherenson and Peter B.
Danzig and Michael N. Nelson",
title = "{RISCs} vs. {CISCs} for {Prolog}: a case study",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "136--145",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kieburtz:1987:RAS,
author = "Richard B. Kieburtz",
title = "A {RISC} architecture for symbolic computation",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "146--155",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ditzel:1987:DTS,
author = "David R. Ditzel and Hubert R. McLellan and Alan D.
Berenbaum",
title = "Design tradeoffs to support the {C} programming
language in the {CRISP} microprocessor",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "158--163",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Thacker:1987:FMW,
author = "Charles P. Thacker and Lawrence C. Stewart",
title = "{Firefly}: a multiprocessor workstation",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "164--172",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Clark:1987:PPV,
author = "Douglas W. Clark",
title = "Pipelining and performance in the {VAX 8800}
processor",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "173--177",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Colwell:1987:VAT,
author = "Robert P. Colwell and Robert P. Nix and John J.
O'Donnell and David B. Papworth and Paul K. Rodman",
title = "A {VLIW} architecture for a trace scheduling
compiler",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "180--192",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levinthal:1987:PCG,
author = "Adam Levinthal and Pat Hanrahan and Mike Paquette and
Jim Lawson",
title = "Parallel computers for graphics applications",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "193--198",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Smith:1987:ZCP,
author = "J. E. Smith and G. E. Dermer and B. D. Vanderwarn and
S. D. Klinger and C. M. Rozewski",
title = "The {ZS-1} central processor",
journal = j-OPER-SYS-REV,
volume = "21",
number = "4",
pages = "199--204",
month = oct,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Howard:1987:SPD,
author = "J. Howard and M. Kazar and S. Menees and D. Nichols
and M. Satyanarayanan and Robert N. Sidebotham and
M. West",
title = "Scale and performance in a distributed file system",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "1--2",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nelson:1987:CSN,
author = "M. Nelson and B. Welch and J. Ousterhout",
title = "Caching in the {Sprite} network file system",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "3--4",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nichols:1987:UIW,
author = "D. Nichols",
title = "Using idle workstations in a shared computing
environment",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "5--12",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zayas:1987:APM,
author = "E. Zayas",
title = "Attacking the process migration bottleneck",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "13--24",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Varghese:1987:HHT,
author = "G. Varghese and T. Lauck",
title = "Hashed and hierarchical timing wheels: data structures
for the efficient implementation of a timer facility",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "25--38",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mogul:1987:PFE,
author = "J. Mogul and R. Rashid and M. Accetta",
title = "The packer filter: an efficient mechanism for
user-level network code",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "39--51",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schwartz:1987:NSE,
author = "M. Schwartz and J. Zahorjan and D. Notkin",
title = "A name service for evolving heterogeneous systems",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "52--62",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Young:1987:DMC,
author = "M. Young and A. Tevanian and R. Rashid and D. Golub
and J. Eppinger",
title = "The duality of memory and communication in the
implementation of a multiprocessor operating system",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "63--76",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jefferson:1987:DST,
author = "D. Jefferson and B. Beckman and F. Wieland and L.
Blume and M. Diloreto",
title = "Distributed Simulation and the {Time Warp Operating
System}",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "77--93",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1987:SPM,
author = "A. Birrell and J. Guttag and J. Horning and R.
Levin",
title = "Synchronization primitives for a multiprocessor: a
formal specification",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "94--102",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Terry:1987:MSV,
author = "D. Terry and D. Swinehart",
title = "Managing stored voice in the {Etherphone} system",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "103--104",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jul:1987:FGM,
author = "E. Jul and H. Levy and N. Hutchinson and A. Black",
title = "Fine-grained mobility in the emerald system",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "105--106",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haskin:1987:RMQ,
author = "R. Haskin and Y. Malachi and W. Sawdon and G. Chan",
title = "Recovery management in {QuickSilver}",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "107--108",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:1987:SAP,
author = "A. Chang and M. Mergen",
title = "801 {Storage}: architecture and programming",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "109--110",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liskov:1987:IA,
author = "B. Liskov and D. Curtis and P. Johnson and R.
Scheifer",
title = "Implementation of {Argus}",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "111--122",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birman:1987:EVS,
author = "K. Birman and T. Joseph",
title = "Exploiting virtual synchrony in distributed systems",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "123--138",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Finlayson:1987:LFE,
author = "R. Finlayson and D. Cheriton",
title = "Log files: an extended file service exploiting
write-once storage",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "139--148",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1987:SEI,
author = "A. Birrell and M. Jones and E. Wobber",
title = "A simple and efficient implementation of a small
database",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "149--154",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hagmann:1987:RCF,
author = "R. Hagmann",
title = "Reimplementing the {Cedar} file system using logging
and group commit",
journal = j-OPER-SYS-REV,
volume = "21",
number = "5",
pages = "155--162",
month = nov,
year = "1987",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Demers:1988:EAR,
author = "Alan Demers and Dan Greene and Carl Houser and Wes
Irish and John Larson and Scott Shenker and Howard
Sturgis and Dan Swinehart and Doug Terry",
title = "Epidemic algorithms for replicated database
maintenance",
journal = j-OPER-SYS-REV,
volume = "22",
number = "1",
pages = "8--32",
month = jan,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Holt:1988:DMT,
author = "R. C. Holt",
title = "Device management in {TURNING PLUS}",
journal = j-OPER-SYS-REV,
volume = "22",
number = "1",
pages = "33--41",
month = jan,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Litman:1988:DDO,
author = "Ami Litman",
title = "The {DUNIX} distributed operating system",
journal = j-OPER-SYS-REV,
volume = "22",
number = "1",
pages = "42--51",
month = jan,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zobel:1988:RTC,
author = "Dieter Z{\"o}bel and Christoph Koch",
title = "Resolution techniques and complexity results with
deadlocks: a classifying and annotated bibliography",
journal = j-OPER-SYS-REV,
volume = "22",
number = "1",
pages = "52--72",
month = jan,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rickert:1988:NBC,
author = "Neil W. Rickert",
title = "Non-{Byzantine} clock synchronization---a programming
experiment",
journal = j-OPER-SYS-REV,
volume = "22",
number = "1",
pages = "73--78",
month = jan,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Canas:1988:PUO,
author = "Daniel A. Ca{\~n}as and Laura M. Esquivel",
title = "Portability and the {UNIX} operating system",
journal = j-OPER-SYS-REV,
volume = "22",
number = "2",
pages = "6--23",
month = apr,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sun:1988:DHD,
author = "Zhongxiu Sun and Xing Xue and Jianqiang Zhou and
Peigen Yang and Xihao Xu",
title = "Developing a heterogeneous distributed operating
system",
journal = j-OPER-SYS-REV,
volume = "22",
number = "2",
pages = "24--31",
month = apr,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Harris:1988:IOS,
author = "David L. Harris",
title = "An input\slash output subsystem for the {Hawk}
operating system kernel",
journal = j-OPER-SYS-REV,
volume = "22",
number = "2",
pages = "32--44",
month = apr,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Russell:1988:SUC,
author = "Stephen Russell",
title = "Single-user capabilities in interprocess
communication",
journal = j-OPER-SYS-REV,
volume = "22",
number = "2",
pages = "45--52",
month = apr,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kotulski:1988:CIP,
author = "Leszek Kotulski",
title = "Comments on implementation of {P} and {V} primitives
with help of binary semaphores",
journal = j-OPER-SYS-REV,
volume = "22",
number = "2",
pages = "53--59",
month = apr,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haldar:1988:ESM,
author = "S. Haldar and D. Subramanian",
title = "An efficient solution to the mutual exclusion problem
using unfair and weak semaphore",
journal = j-OPER-SYS-REV,
volume = "22",
number = "2",
pages = "60--66",
month = apr,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hogan:1988:PIS,
author = "Carole B. Hogan",
title = "Protection imperfect: the security of some computing
environments",
journal = j-OPER-SYS-REV,
volume = "22",
number = "3",
pages = "7--27",
month = jul,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See note \cite{Wells:1988:NPI}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Smith:1988:SPM,
author = "Jonathan M. Smith",
title = "A survey of process migration mechanisms",
journal = j-OPER-SYS-REV,
volume = "22",
number = "3",
pages = "28--40",
month = jul,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{DosReis:1988:NBA,
author = "Anthony J. {Dos Reis}",
title = "A note on {Ben-Ari}'s concurrent programming system",
journal = j-OPER-SYS-REV,
volume = "22",
number = "3",
pages = "41--42",
month = jul,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hemmendinger:1988:CIG,
author = "David Hemmendinger",
title = "A correct implementation of general semaphores",
journal = j-OPER-SYS-REV,
volume = "22",
number = "3",
pages = "42--44",
month = jul,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levy:1988:SFR,
author = "Hank Levy",
title = "{SIGOPS Financial Report August 1, 1988}",
journal = j-OPER-SYS-REV,
volume = "22",
number = "4",
pages = "1--2",
month = oct,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guenther:1988:ECS,
author = "Grant R. Guenther",
title = "Extended control services in operating system
interfaces",
journal = j-OPER-SYS-REV,
volume = "22",
number = "4",
pages = "20--24",
month = oct,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{vanRenesse:1988:PWF,
author = "Robbert van Renesse and Hans van Staveren and Andrew
S. Tanenbaum",
title = "Performance of the world's fastest distributed
operating system",
journal = j-OPER-SYS-REV,
volume = "22",
number = "4",
pages = "25--34",
month = oct,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wells:1988:NPI,
author = "Codie Wells",
title = "A Note on {``Protection Imperfect''}",
journal = j-OPER-SYS-REV,
volume = "22",
number = "4",
pages = "35--35",
month = oct,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Hogan:1988:PIS}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hardy:1988:CDW,
author = "Norm Hardy and Norman Hardy",
title = "The {Confused Deputy}: (or why capabilities might have
been invented)",
journal = j-OPER-SYS-REV,
volume = "22",
number = "4",
pages = "36--38",
month = oct,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wedekind:1988:UNK,
author = "H. Wedekind",
title = "Ubiquity and need-to-know: two principles of data
distribution",
journal = j-OPER-SYS-REV,
volume = "22",
number = "4",
pages = "39--45",
month = oct,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kearns:1988:CUI,
author = "Phil Kearns",
title = "A correct and unrestrictive implementation of general
semaphores",
journal = j-OPER-SYS-REV,
volume = "22",
number = "4",
pages = "46--48",
month = oct,
year = "1988",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See comments
\cite{Hemmendinger:1989:CCU,Hsieh:1989:FCI,Trono:2000:FCC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hemmendinger:1989:CCU,
author = "David Hemmendinger",
title = "Comments on {``A Correct and Unrestrictive
Implementation of General Semaphores''}",
journal = j-OPER-SYS-REV,
volume = "23",
number = "1",
pages = "7--8",
month = jan,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See
\cite{Kearns:1988:CUI,Hemmendinger:1988:CIG,Trono:2000:FCC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hsieh:1989:FCI,
author = "C. Samuel Hsieh",
title = "Further comments on implementation of general
semaphores",
journal = j-OPER-SYS-REV,
volume = "23",
number = "1",
pages = "9--10",
month = jan,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See comment
\cite{Kearns:1988:CUI,Hemmendinger:1989:CCU,Trono:2000:FCC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ousterhout:1989:BBC,
author = "John Ousterhout and Fred Douglis",
title = "Beating the {I/O} bottleneck: a case for
log-structured file systems",
journal = j-OPER-SYS-REV,
volume = "23",
number = "1",
pages = "11--28",
month = jan,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peacock:1989:DAL,
author = "J. Kent Peacock",
title = "Deadlock avoidance in loosely-coupled multiprocessors
with finite buffer pools",
journal = j-OPER-SYS-REV,
volume = "23",
number = "2",
pages = "20--24",
month = apr,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Braban:1989:WSP,
author = "Bruno Braban and Peter Schlenk",
title = "A well structured parallel file system for {PM}",
journal = j-OPER-SYS-REV,
volume = "23",
number = "2",
pages = "25--38",
month = apr,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Loepere:1989:CCL,
author = "Keith Loepere",
title = "The covert channel limiter revisited",
journal = j-OPER-SYS-REV,
volume = "23",
number = "2",
pages = "39--44",
month = apr,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Leibfried:1989:DDR,
author = "T. F. Leibfried",
title = "A deadlock detection and recovery algorithm using the
formalism of a directed graph matrix",
journal = j-OPER-SYS-REV,
volume = "23",
number = "2",
pages = "45--55",
month = apr,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gong:1989:SCB,
author = "Li Gong",
title = "On security in capability-based systems",
journal = j-OPER-SYS-REV,
volume = "23",
number = "2",
pages = "56--60",
month = apr,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shih:1989:STR,
author = "W. Shih and J. S. W. Liu and J. Chung and D. W.
Gillies",
title = "Scheduling tasks with ready times and deadlines to
minimize average error",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "14--28",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tokuda:1989:ADR,
author = "H. Tokuda and C. W. Mercer",
title = "{ARTS}: a distributed real-time kernel",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "29--53",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stankovic:1989:SKN,
author = "J. A. Stankovic and K. Ramamritham",
title = "The {Spring} kernel: a new paradigm for real-time
operating systems",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "54--71",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kandlur:1989:HDR,
author = "D. D. Kandlur and D. L. Kiskis and K. G. Shin",
title = "{HARTOS}: a distributed real-time operating system",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "72--89",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levi:1989:MHR,
author = "S. Levi and S. K. Tripathi and S. D. Carson and A. K.
Agrawala",
title = "The {MARUTI} hard real-time operating system",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "90--105",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gopinath:1989:CWO,
author = "P. Gopinath and K. Schwan",
title = "{CHAOS}: why one cannot have only an operating system
for real-time applications",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "106--125",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wedde:1989:OSS,
author = "H. F. Wedde and G. S. Alijani and W. G. Brown and S.
Chen and G. Kang",
title = "Operating system support for adaptive distributed
real-time systems in {DRAGON SLAYER}",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "126--140",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Damm:1989:RTO,
author = "A. Damm and J. Reisinger and W. Schwabl and H.
Kopetz",
title = "The real-time operating system of {MARS}",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "141--157",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Holmes:1989:DPH,
author = "V. P. Holmes and D. L. Harris",
title = "A designer's perspective of the {Hawk} multiprocessor
operating system kernel",
journal = j-OPER-SYS-REV,
volume = "23",
number = "3",
pages = "158--172",
month = jul,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Landau:1989:SSC,
author = "Charles R. Landau",
title = "Security in a secure capability-based system",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "2--4",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kaashoek:1989:ERB,
author = "M. Frans Kaashoek and A. S. Tanenbaum and S. F.
Hummel",
title = "An efficient reliable broadcast protocol",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "5--19",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chanson:1989:BMG,
author = "S. T. Chanson and G. W. Neufeld and L. Liang",
title = "A bibliography on multicast and group communications",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "20--25",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Piotrowski:1989:FNE,
author = "Walter G. Piotrowski",
title = "Are file names enough?",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "26--27",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Neuman:1989:NCL,
author = "B. C. Neuman",
title = "The need for closure in large distributed systems",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "28--30",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Power:1989:DSE,
author = "June Power",
title = "Distributed system evolution-some observations",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "31--32",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Emck:1989:EOS,
author = "J. H. Emck and J. H. Voskamp and A. J. van der Wal",
title = "{EPEP}: an operating system designed for
experiment-control",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "33--44",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Furht:1989:PRI,
author = "Borko Furht and J. Parker and D. Grostick",
title = "Performance of {REAL\slash IX$^{TM}$}-fully preemptive
real time {UNIX}",
journal = j-OPER-SYS-REV,
volume = "23",
number = "4",
pages = "45--52",
month = oct,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Burrows:1989:LA,
author = "M. Burrows and M. Abadi and R. Needham",
title = "A logic of authentication",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "1--13",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lomas:1989:RRP,
author = "T. Lomas and L. Gong and J. Saltzer and R. Needhamn",
title = "Reducing risks from poorly chosen keys",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "14--18",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bolosky:1989:SET,
author = "W. Bolosky and R. Fitzgerald and M. Scott",
title = "Simple but effective techniques for {NUMA} memory
management",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "19--31",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cox:1989:ICM,
author = "A. Cox and R. Fowler",
title = "The implementation of a coherent memory abstraction on
a {NUMA} multiprocessor: experiences with platinum",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "32--44",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Srinivasan:1989:SNE,
author = "V. Srinivasan and J. Mogul",
title = "{Spritely NFS}: experiments with cache-consistency
protocols",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "44--57",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Edwards:1989:ERM,
author = "D. Edwards and M. Mckendry",
title = "Exploiting read-mostly workloads in the {FileNet} file
system",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "58--70",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Braunstein:1989:IEU,
author = "A. Braunstein and M. Riley and J. Wilkes",
title = "Improving the efficiency of {UNIX} buffer caches",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "71--82",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:1989:PFR,
author = "M. Schroeder and M. Burrows",
title = "Performance of {Firefly RPC}",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "83--90",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peterson:1989:RXK,
author = "L. Peterson and N. Hutchinson and S. O'Malley and M.
Abbott",
title = "{RPC} in the {x-Kernel}: evaluating new design
techniques",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "91--101",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bershad:1989:LRP,
author = "B. Bershad and T. Anderson and E. Lazowska and H.
Levy",
title = "Lightweight remote procedure call",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "102--113",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weiser:1989:PCR,
author = "M. Weiser and A. Demers and C. Hauser",
title = "The portable common runtime approach to
interoperability",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "114--122",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abrossimov:1989:GVM,
author = "E. Abrossimov and M. Rozier and M. Shapiro",
title = "Generic virtual memory management for operating system
kernels",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "123--136",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rosenburg:1989:LST,
author = "B. Rosenburg",
title = "Low-synchronization translation lookaside buffer
consistency in large-scale shared-memory
multiprocessors",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "137--146",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chase:1989:ASP,
author = "J. Chase and F. Amador and E. Lazowska and H. Levy and
R. Littlefield",
title = "The {Amber} system: parallel programming on a network
of multiprocessors",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "147--158",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tucker:1989:PCS,
author = "A. Tucker and A. Gupta",
title = "Process control and scheduling issues for
multiprogrammed shared-memory multiprocessors",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "159--166",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barkley:1989:LBS,
author = "R. Barkley and T. Lee",
title = "A lazy buddy system bounded by two coalescing delays",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "167--176",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Duchamp:1989:ATM,
author = "D. Duchamp",
title = "Analysis of transaction management performance",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "177--190",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Massalin:1989:TIO,
author = "H. Massalin and C. Pu",
title = "Threads and input\slash output in the synthesis
kernel",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "191--201",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gray:1989:LEF,
author = "C. Gray and D. Cheriton",
title = "Leases: an efficient fault-tolerant mechanism for
distributed file cache consistency",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "202--210",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fleisch:1989:MCD,
author = "B. Fleisch and G. Popek",
title = "{Mirage}: a coherent distributed shared memory
design",
journal = j-OPER-SYS-REV,
volume = "23",
number = "5",
pages = "211--223",
month = dec,
year = "1989",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:47:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chandras:1990:DMP,
author = "Rajan G. Chandras",
title = "Distributed message passing operating systems",
journal = j-OPER-SYS-REV,
volume = "24",
number = "1",
pages = "7--17",
month = jan,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hofri:1990:PME,
author = "Micha Hofri",
title = "Proof of a mutual exclusion algorithm---a classic
example",
journal = j-OPER-SYS-REV,
volume = "24",
number = "1",
pages = "18--22",
month = jan,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Danzig:1990:HRT,
author = "Peter B. Danzig and Stephen Melvin",
title = "High resolution timing with low resolution clocks and
microsecond resolution timer for {Sun} workstations",
journal = j-OPER-SYS-REV,
volume = "24",
number = "1",
pages = "23--26",
month = jan,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babaoglu:1990:FTC,
author = "{\"O}zalp Babao{\u{g}}lu",
title = "Fault-tolerant computing based on {Mach}",
journal = j-OPER-SYS-REV,
volume = "24",
number = "1",
pages = "27--39",
month = jan,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jalote:1990:WIA,
author = "Pankaj Jalote and Satish K. Tripathi",
title = "Workshop on integrated approach for fault
tolerance-current state and future requirements",
journal = j-OPER-SYS-REV,
volume = "24",
number = "1",
pages = "40--57",
month = jan,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lorence:1990:ITM,
author = "Mark J. Lorence and M. Satyanarayanan",
title = "{IPwatch}: a tool for monitoring network locality",
journal = j-OPER-SYS-REV,
volume = "24",
number = "1",
pages = "58--80",
month = jan,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Koelbel:1990:WEB,
author = "Chuck Koelbel and Gene Spafford and George Leach",
title = "Workshop on experiences with building distributed and
multiprocessor systems",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "2--6",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Burdorf:1990:NPT,
author = "Christopher Burdorf and Jed Marti",
title = "Non-preemptive time warp scheduling algorithms",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "7--18",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hopper:1990:PES,
author = "Andy Hopper",
title = "{Pandora} --- an experimental system for multimedia
applications",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "19--34",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nessett:1990:CBA,
author = "Dan M. Nessett",
title = "A critique of the {Burrows}, {Abadi} and {Needham}
logic",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "35--38",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Burrows:1990:RN,
author = "Michael Burrows and Mart{\'\i}n Abadi and Roger
Needham",
title = "Rejoinder to {Nessett}",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "39--40",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Beck:1990:AMA,
author = "Bob Beck",
title = "{AAMP}: a multiprocessor approach for operating system
and application migration",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "41--55",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oliver:1990:PDD,
author = "Roger Oliver",
title = "Protection in a distributed document processing
system",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "56--65",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Seigh:1990:DSR,
author = "Joseph W. Seigh",
title = "A distributed solution to the reader--writer
problem",
journal = j-OPER-SYS-REV,
volume = "24",
number = "2",
pages = "66--68",
month = apr,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:40 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levy:1990:NSD,
author = "Hank Levy",
title = "New {SIGOPS} dues structure",
journal = j-OPER-SYS-REV,
volume = "24",
number = "3",
pages = "1--1",
month = jul,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cabrera:1990:TSS,
author = "Luis-Felipe Cabrera",
title = "Technical summary of the second {IEEE} workshop on
workstation operating systems",
journal = j-OPER-SYS-REV,
volume = "24",
number = "3",
pages = "7--21",
month = jul,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Antonov:1990:RAO,
author = "Vadim G. Antonov",
title = "A regular architecture for operating system",
journal = j-OPER-SYS-REV,
volume = "24",
number = "3",
pages = "22--39",
month = jul,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tam:1990:TBC,
author = "Ming-Chit Tam and Jonathan M. Smith and David J.
Farber",
title = "A taxonomy-based comparison of several distributed
shared memory systems",
journal = j-OPER-SYS-REV,
volume = "24",
number = "3",
pages = "40--67",
month = jul,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tay:1990:SRP,
author = "B. H. Tay and A. L. Ananda",
title = "A survey of remote procedure calls",
journal = j-OPER-SYS-REV,
volume = "24",
number = "3",
pages = "68--79",
month = jul,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Goscinski:1990:RML,
author = "Andrzej Goscinski and Mirion Bearman",
title = "Resource management in large distributed systems",
journal = j-OPER-SYS-REV,
volume = "24",
number = "4",
pages = "7--25",
month = oct,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jun:1990:MIT,
author = "Chen Jun and Xie Li and Sun Zhong-xiu",
title = "A model for intelligent task scheduling in a large
distributed system",
journal = j-OPER-SYS-REV,
volume = "24",
number = "4",
pages = "26--33",
month = oct,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hong:1990:AOM,
author = "Zhao Hong and Wayne McCoy",
title = "An associated object model for distributed systems",
journal = j-OPER-SYS-REV,
volume = "24",
number = "4",
pages = "34--51",
month = oct,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:1990:PDM,
author = "Frank W. Miller",
title = "Predictive deadline multi-processing",
journal = j-OPER-SYS-REV,
volume = "24",
number = "4",
pages = "52--63",
month = oct,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Davis:1990:NSP,
author = "Don Davis and Ralph Swick",
title = "Network security via private-key certificates",
journal = j-OPER-SYS-REV,
volume = "24",
number = "4",
pages = "64--67",
month = oct,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ghosh:1990:CST,
author = "H. Ghosh and S. Sreedhar",
title = "A comparative study of two simple network file access
models",
journal = j-OPER-SYS-REV,
volume = "24",
number = "4",
pages = "68--77",
month = oct,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Woo:1990:NLM,
author = "Tai-Kuo Woo",
title = "A note on {Lamport}'s mutual exclusion algorithm",
journal = j-OPER-SYS-REV,
volume = "24",
number = "4",
pages = "78--80",
month = oct,
year = "1990",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haldar:1991:FPS,
author = "S. Haldar and D. K. Subramanian",
title = "Fairness in processor scheduling in time sharing
systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "4--18",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babaoglu:1991:RFA,
author = "{\"O}zalp Babao{\u{g}}lu",
title = "Report on the fourth {ACM SIGOPS European} workshop
fault tolerance support in distributed systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "19--43",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Marzullo:1991:MRT,
author = "Keith Marzullo and Mark Wood",
title = "Making real-time reactive systems reliable",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "45--48",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ladin:1991:LRE,
author = "Rivka Ladin and Barbara Liskov and Liuba Shrira",
title = "Lazy replication: exploiting the semantics of
distributed services (extended abstract)",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "49--55",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:1991:SDA,
author = "John Wilkes and Raymie Stata",
title = "Specifying data availability in multi-device file
systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "56--59",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liskov:1991:RUF,
author = "Barbara Liskov and Robert Gruber and Paul Johnson and
Liuba Shrira",
title = "A replicated {Unix} file system (extended abstract)",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "60--64",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Daniels:1991:SLS,
author = "Dean Daniels and Roger Haskin and Jon Reinke and Wayne
Sawdon",
title = "Shared logging services for fault-tolerant distributed
computing",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "65--68",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Banatre:1991:STM,
author = "M. Ban{\^a}tre and Ph. Joubert and Ch. Morin and G.
Muller and B. Rochat and P. Sanchez",
title = "Stable transactional memories and fault tolerant
architectures",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "68--72",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Black:1991:UTO,
author = "Andrew P. Black",
title = "Understanding transactions in the operating system
context",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "73--76",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kistler:1991:TDO,
author = "James Jay Kistler and M. Satyanarayanan",
title = "Transparent disconnected operation for
fault-tolerance",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "77--80",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saltzer:1991:FTV,
author = "Jerome H. Saltzer",
title = "Fault-tolerance in very large archival systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "81--82",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1991:PPS,
author = "Andrew Birrell",
title = "Position paper for {SIGOPS} workshop on fault
tolerance support in distributed systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "1",
pages = "83--84",
month = jan,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:35 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Maggio:1991:FSC,
author = "Maria D. Maggio and David W. Krumme",
title = "A flexible system call interface for interprocessor
communication in a distributed memory multicomputer",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "4--21",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yokote:1991:MOA,
author = "Yasuhiko Yokote and Fumio Teraoka and Atsushi
Mitsuzawa and Nobuhisa Fujinami and Mario Tokoro",
title = "The muse object architecture: a new operating system
structuring concept",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "22--46",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Raynal:1991:STD,
author = "Michel Raynal",
title = "A simple taxonomy for distributed mutual exclusion
algorithms",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "47--50",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1991:TYE,
author = "Jochen Liedtke and Ulrich Bartling and Uwe Beyer and
Dietmar Heinrichs and Rudolf Ruland and Gyula Szalay",
title = "Two years of experience with a $\mu$-kernel based
{OS}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "51--62",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Moffett:1991:CDA,
author = "Jonathan D. Moffett and Morris S. Sloman",
title = "Content-dependent access control",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "63--70",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kaashoek:1991:FTU,
author = "M. Frans Kaashoek and Andrew S. Tanenbaum",
title = "Fault tolerance using group communication",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "71--74",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stephenson:1991:FCM,
author = "Pat Stephenson and Kenneth Birman",
title = "Fast causal multicast",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "75--79",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{LeLann:1991:RAB,
author = "G. {Le Lann} and G. Bres",
title = "Reliable atomic broadcast in distributed systems with
omission faults",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "80--86",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Minet:1991:ABO,
author = "Pascale Minet and Emmanuelle Anceaume",
title = "Atomic broadcast in one phase",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "87--90",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bacon:1991:TRD,
author = "David F. Bacon",
title = "Transparent recovery in distributed systems (position
paper)",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "91--94",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baker:1991:ASD,
author = "Mary Baker and John Ousterhout",
title = "Availability in the {Sprite} distributed file system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "95--98",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Johnson:1991:TOR,
author = "David B. Johnson and Willy Zwaenepoel",
title = "Transparent optimistic rollback recovery",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "99--102",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birman:1991:IPR,
author = "Kenneth Birman and Robert Cooper",
title = "The {ISIS} project: real experience with a fault
tolerant programming system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "103--107",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Casey:1991:LND,
author = "Liam Casey",
title = "Lessons from {Norstar}'s distributed call processing
system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "108--111",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gopal:1991:SFT,
author = "Gita Gopal and Nancy D. Griffeth",
title = "Software fault tolerance in telecommunications
systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "112--116",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cristian:1991:FTA,
author = "Flaviu Cristian",
title = "Fault-Tolerance in the {Advanced Automation System}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "117--121",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McCue:1991:SFT,
author = "Daniel L. McCue and Santosh K. Shrivastava",
title = "Structuring fault-tolerant object systems for
portability",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "118--121",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Powell:1991:FTD,
author = "David Powell and Marc Ch{\'e}r{\`e}que and David
Drackley",
title = "Fault-tolerance in {Delta-4}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "122--125",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nehmer:1991:FTA,
author = "J. Nehmer and T. Becker",
title = "A fault tolerance approach for distributed {ISDN}
control systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "126--129",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tangney:1991:SIS,
author = "Brendan Tangney and Vinny Cahill and Chris Horn and
Dominic Herity and Alan Judge and Gradimir Starovic and
Mark Sheppard",
title = "Some ideas on support for fault tolerance in
{COMANDOS}, an object oriented distributed system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "2",
pages = "130--135",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wolfe:1991:VIS,
author = "Andrew Wolfe and John P. Shen",
title = "A variable instruction stream extension to the {VLIW}
architecture",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "2--14",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Katevenis:1991:RBP,
author = "Manolis Katevenis and Nestoras Tzartzanis",
title = "Reducing the branch penalty by rearranging
instructions in a double-width memory",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "15--27",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:1991:FPP,
author = "Roland L. Lee and Alex Y. Kwok and Fay{\'e} A.
Briggs",
title = "The floating-point performance of a superscalar
{SPARC} processor",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "28--37",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Callahan:1991:SP,
author = "David Callahan and Ken Kennedy and Allan
Porterfield",
title = "Software prefetching",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "40--52",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sohi:1991:HBD,
author = "Gurindar S. Sohi and Manoj Franklin",
title = "High-bandwidth data memory systems for superscalar
processors",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "53--62",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lam:1991:CPO,
author = "Monica D. Lam and Edward E. Rothberg and Michael E.
Wolf",
title = "The cache performance and optimizations of blocked
algorithms",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "63--74",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mogul:1991:ECS,
author = "Jeffrey C. Mogul and Anita Borg",
title = "The effect of context switches on cache performance",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "75--84",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Keppel:1991:PIF,
author = "David Keppel",
title = "A portable interface for on-the-fly instruction space
modification",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "86--95",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Appel:1991:VMP,
author = "Andrew W. Appel and Kai Li",
title = "Virtual memory primitives for user programs",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "96--107",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:1991:IAO,
author = "Thomas E. Anderson and Henry M. Levy and Brian N.
Bershad and Edward D. Lazowska",
title = "The interaction of architecture and operating system
design",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "108--120",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bradlee:1991:IRA,
author = "David G. Bradlee and Susan J. Eggers and Robert R.
Henry",
title = "Integrating register allocation and instruction
scheduling for {RISCs}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "122--131",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Benitez:1991:CGS,
author = "Manuel E. Benitez and Jack W. Davidson",
title = "Code generation for streaming: an access\slash execute
mechanism",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "132--141",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bagrodia:1991:EIH,
author = "Rajive Bagrodia and Sharad Mathur",
title = "Efficient implementation of high-level parallel
programs",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "142--151",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mangione-Smith:1991:VRD,
author = "William Mangione-Smith and Santosh G. Abraham and
Edward S. Davidson",
title = "Vector register design for polycyclic vector
scheduling",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "154--163",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Culler:1991:FGP,
author = "David E. Culler and Anurag Sah and Klaus E. Schauser
and Thorsten von Eicken and John Wawrzynek",
title = "Fine-grain parallelism with minimal hardware support:
a compiler-controlled threaded abstract machine",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "164--175",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wall:1991:LIL,
author = "David W. Wall",
title = "Limits of instruction-level parallelism",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "176--188",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:1991:PCP,
author = "Edward K. Lee and Randy H. Katz",
title = "Performance consequences of parity placement in disk
arrays",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "190--199",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cate:1991:CCC,
author = "Vincent Cate and Thomas Gross",
title = "Combining the concepts of compression and caching for
a two-level filesystem",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "200--211",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bolosky:1991:NPT,
author = "William J. Bolosky and Michael L. Scott and Robert P.
Fitzgerald and Robert J. Fowler and Alan L. Cox",
title = "{NUMA} policies and their relation to memory
architecture",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "212--221",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chaiken:1991:LDS,
author = "David Chaiken and John Kubiatowicz and Anant
Agarwal",
title = "{LimitLESS} directories: {A} scalable cache coherence
scheme",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "224--234",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Min:1991:ECB,
author = "Sang L. Min and Jong-Deok Choi",
title = "An efficient cache-based access anomaly detection
scheme",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "235--244",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gharachorloo:1991:PEM,
author = "Kourosh Gharachorloo and Anoop Gupta and John
Hennessy",
title = "Performance evaluation of memory consistency models
for shared-memory multiprocessors",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "245--257",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Freudenthal:1991:PCF,
author = "Eric Freudenthal and Allan Gottlieb",
title = "Process coordination with fetch-and-increment",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "260--268",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mellor-Crummey:1991:SC,
author = "John M. Mellor-Crummey and Michael L. Scott",
title = "Synchronization without contention",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "269--278",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Johnson:1991:CRB,
author = "Douglas Johnson",
title = "The case for a read barrier",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "279--287",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cmelik:1991:AMS,
author = "Robert F. Cmelik and Shing I. Kong and David R. Ditzel
and Edmund J. Kelly",
title = "An analysis of {MIPS} and {SPARC} instruction set
utilization on the {SPEC} benchmarks",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "290--302",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hall:1991:PCA,
author = "C. Brian Hall and Kevin O'Brien",
title = "Performance characteristics of architectural features
of the {IBM RISC System\slash 6000}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "303--309",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bhandarkar:1991:PAC,
author = "Dileep Bhandarkar and Douglas W. Clark",
title = "Performance from architecture: comparing a {RISC} and
a {CISC} with similar hardware organization",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3S",
pages = "310--319",
month = apr,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 15:24:15 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wagner:1991:BRA,
author = "David B. Wagner and Carl Ponder",
title = "Book Review: {{\em The Art of Computer Systems
Performance Analysis\/} by Raj Jain: (John Wiley and
Sons, Inc., New York 1991)}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3",
pages = "7--9",
month = jul,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Broner:1991:IRB,
author = "Garbriel Broner and Patrick Powell",
title = "Intelligent {I/O} rule-based input\slash output
processing for operating systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3",
pages = "10--26",
month = jul,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dunstan:1991:SFS,
author = "Neil Dunstan",
title = "Semaphores for fair scheduling monitor conditions",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3",
pages = "27--31",
month = jul,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aguirre:1991:EMD,
author = "G. Aguirre and M. Errecalde and R. Guerrero and C.
Kavka and G. Leguizamon and M. Printista and R. Gallard",
title = "Experiencing {Minix} as a didactical aid for operating
systems courses",
journal = j-OPER-SYS-REV,
volume = "25",
number = "3",
pages = "32--39",
month = jul,
year = "1991",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/122572.122575",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mull:1991:EST,
author = "Allison J. Mull and P. Tobin Maginnis",
title = "Evolutionary steps toward a distributed operating
system: theory and implementation",
journal = j-OPER-SYS-REV,
volume = "25",
number = "4",
pages = "4--13",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Sep 30 17:13:18 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Generally speaking, distributed operating system (DOS)
designers seem more concerned with resource sharing,
global file system transparency, and implementation
methodology. The authors feel that a DOS may provide
the platform for linear speedup of applications if
performance considerations are given highest priority
in the design of the DOS. Work has been underway to
test the implementation of such a DOS design in the
MINIX environment.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. and Inf. Sci., Mississippi Univ.,
University, MS, USA",
classification = "C6150J (Operating systems); C6150N (Distributed
systems)",
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Distributed operating system; DOS; MINIX environment;
Performance",
thesaurus = "Network operating systems; Unix",
}
@Article{Hayter:1991:DAN,
author = "Mark Hayter and Derek McAuley",
title = "The desk area network",
journal = j-OPER-SYS-REV,
volume = "25",
number = "4",
pages = "14--21",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chavez:1991:XTS,
author = "Jorge Buenabadd Ch{\'a}vez",
title = "{XINIX} time-sharing operating system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "4",
pages = "22--34",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schwan:1991:RTT,
author = "Karsten Schwan and Hongyi Zhou and Ahmed Gheith",
title = "Real-time threads",
journal = j-OPER-SYS-REV,
volume = "25",
number = "4",
pages = "35--46",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bacon:1991:MSS,
author = "Jean Bacon and Ken Moody and Sue Thomson and Tim
Wilson",
title = "A multi-service storage architecture",
journal = j-OPER-SYS-REV,
volume = "25",
number = "4",
pages = "47--65",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oestreicher:1991:SRG,
author = "Dan Oestreicher",
title = "A simple reliable globally-ordered broadcast service",
journal = j-OPER-SYS-REV,
volume = "25",
number = "4",
pages = "66--76",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lam:1991:ISD,
author = "Kwok-yan Lam",
title = "An implementation for small databases with high
availability",
journal = j-OPER-SYS-REV,
volume = "25",
number = "4",
pages = "77--77",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rosenblum:1991:DIL,
author = "Mendel Rosenblum and John K. Ousterhout",
title = "The design and implementation of a log-structured file
system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "1--15",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gifford:1991:SFS,
author = "David K. Gifford and Pierre Jouvelot and Mark A.
Sheldon and James W. {O'Toole, Jr.}",
title = "Semantic file systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "16--25",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vaswani:1991:ICA,
author = "Raj Vaswani and John Zahorjan",
title = "The implications of cache affinity on processor
scheduling for multiprogrammed, shared memory
multiprocessors",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "26--40",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Karlin:1991:ESC,
author = "Anna R. Karlin and Kai Li and Mark S. Manasse and
Susan Owicki",
title = "Empirical studies of competitive spinning for a
shared-memory multiprocessor",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "41--55",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muller:1991:HPM,
author = "Keith Muller and Joseph Pasquale",
title = "A high performance multi-structured file system
design",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "56--67",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Govindan:1991:SIM,
author = "Ramesh Govindan and David P. Anderson",
title = "Scheduling and {IPC} mechanisms for continuous media",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "68--80",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rangan:1991:DFS,
author = "P. Venkat Rangan and Harrick M. Vin",
title = "Designing file systems for digital video and audio",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "81--94",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:1991:SAE,
author = "Thomas E. Anderson and Brian N. Bershad and Edward D.
Lazowska and Henry M. Levy",
title = "Scheduler activations: effective kernel support for
the user-level management of parallelism",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "95--109",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Marsh:1991:FCU,
author = "Brian D. Marsh and Michael L. Scott and Thomas J.
LeBlanc and Evangelos P. Markatos",
title = "First-class user-level threads",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "110--121",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Draves:1991:UCI,
author = "Richard P. Draves and Brian N. Bershad and Richard F.
Rashid and Randall W. Dean",
title = "Using continuations to implement thread management and
communication in operating systems",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "122--136",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{LaRowe:1991:RNM,
author = "Richard P. {LaRowe, Jr.} and Carla Schlatter Ellis and
Laurence S. Kaplan",
title = "The robustness of {NUMA} memory management",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "137--151",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carter:1991:IPM,
author = "John B. Carter and John K. Bennett and Willy
Zwaenepoel",
title = "Implementation and performance of {Munin}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "152--164",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lampson:1991:ADS,
author = "Butler Lampson and Mart{\'\i}n Abadi and Michael
Burrows and Edward Wobber",
title = "Authentication in distributed systems: theory and
practice",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "165--182",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rodeheffer:1991:ARA,
author = "Thomas L. Rodeheffer and Michael D. Schroeder",
title = "Automatic reconfiguration in {Autonet}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "183--197",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baker:1991:MDF,
author = "Mary G. Baker and John H. Hartman and Michael D.
Kupfer and Ken W. Shirriff and John K. Ousterhout",
title = "Measurements of a distributed file system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "198--212",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kistler:1991:DOC,
author = "James J. Kistler and M. Satyanarayanan",
title = "Disconnected operation in the {Coda} file system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "213--225",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liskov:1991:RHF,
author = "Barbara Liskov and Sanjay Ghemawat and Robert Gruber
and Paul Johnson and Liuba Shrira",
title = "Replication in the {Harp} file system",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "226--238",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schmuck:1991:ETQ,
author = "Frank Schmuck and Jim Wylie",
title = "Experience with transactions in {QuickSilver}",
journal = j-OPER-SYS-REV,
volume = "25",
number = "5",
pages = "239--253",
month = oct,
year = "1991",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:57 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lazowska:1992:ASOa,
author = "Edward D. Lazowska",
title = "{13th ACM Symposium on Operating Systems Principles}:
panel session presentations",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "3--17",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:1992:SAO,
author = "Barton P. Miller and Charles McDowell",
title = "Summary of {ACM\slash ONR} workshop on parallel and
distributed debugging",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "18--31",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dasser:1992:TTO,
author = "Mahmoud Dasser",
title = "{TOMP} a total ordering multicast protocol",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "32--40",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Raynal:1992:ALC,
author = "Michel Raynal",
title = "About logical clocks for distributed systems",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "41--48",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gong:1992:SRD,
author = "Li Gong",
title = "A security risk of depending on synchronized clocks",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "49--53",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schwan:1992:MRT,
author = "Karsten Schwan and Hongyi Zhou",
title = "Multiprocessor real-time threads",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "54--65",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hong:1992:MPG,
author = "Zhao Hong and Huatian Li",
title = "A mechanism of process group for application
reliability in distributed systems",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "66--77",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Halder:1992:COW,
author = "S. Halder and K. Vidyasankar",
title = "Counterexamples to a one writer multireader atomic
variable construction of {Burns} and {Peterson}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "1",
pages = "78--87",
month = jan,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lazowska:1992:ASOb,
author = "Edward D. Lazowska",
title = "{13th ACM Symposium on Operating Systems Principles}:
``Work in Progress''; abstracts",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "7--7",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Massalin:1992:LFMa,
author = "Henry Massalin and Calton Pu",
title = "A {Lock-Free Multiprocessor OS Kernel}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "8--8",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chase:1992:OSA,
author = "Jeff Chase and Miche Baker-Harvey and Hank Levy and Ed
Lazowska",
title = "{Opal}: {A Single Address Space System} for 64-bit
{Architectures}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "9--9",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Duchamp:1992:SSW,
author = "Daniel Duchamp",
title = "Systems {Software} for {Wireless Mobile Computing}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "10--10",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:1992:DPS,
author = "John Wilkes and Chia Chao and Robert English and David
Jacobson and Bart Sears and Carl Staelin and Alex
Stepanov",
title = "{DataMesh} parallel storage servers",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "11--11",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herlihy:1992:MIH,
author = "Maurice Herlihy",
title = "A {Methodology} for {Implementing Highly Concurrent
Data Objects}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "12--12",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{LaRowe:1992:OSR,
author = "Rick LaRowe",
title = "Operating {Systems Research Related} to the {Galactica
Net Architecture}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "13--13",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pasquale:1992:PS,
author = "Joseph Pasquale",
title = "{Project Sequoia 2000}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "14--14",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wiecek:1992:VM,
author = "Cheryl A. Wiecek",
title = "{VMS} on {Mach}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "15--15",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jeffay:1992:NOS,
author = "Kevin Jeffay",
title = "Network and {Operating System Support} for {Digital
Audio} and {Video}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "16--16",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Neuman:1992:VSP,
author = "B. Clifford Neuman",
title = "The {Virtual System Project}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "17--17",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hillyer:1992:BFM,
author = "Bruce K. Hillyer and Bethany S. Robinson",
title = "The {BBFS Filesystem Model}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "18--18",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Harty:1992:ACP,
author = "Kieran Harty and David R. Cheriton",
title = "Application-Controlled {Physical Memory} using
{External Page-Cache Management}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "19--19",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Young:1992:ELT,
author = "Michael Wayne Young",
title = "{Episode}: {Lazy Transactions} for {Filesystem
Meta-Data Updates}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "20--20",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:1992:TIU,
author = "Michael B. Jones",
title = "A {Toolkit} for {Interposing User Code} at the {System
Interface}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "21--21",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Druschel:1992:MPO,
author = "Peter Druschel",
title = "Modularity and Protection are Orthogonal, or {``Why
$\mu$-kernel Architectures are Flawed''}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "22--22",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Marzullo:1992:TBR,
author = "Keith Marzullo and Mark D. Wood",
title = "A {Toolkit} for {Building Reactive Systems} or {A
Minute} on {Meta}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "23--23",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weihl:1992:PTB,
author = "William E. Weihl",
title = "{Prelude}: {Tools} for {Building Portable Parallel
Programs}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "24--24",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Perl:1992:PAC,
author = "Sharon E. Perl",
title = "Performance {Assertion Checking}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "25--25",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guy:1992:FRF,
author = "Richard G. Guy and John S. Heidemann and Thomas W.
{Page, Jr.}",
title = "The {Ficus Replicated File System}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "26--26",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reiter:1992:ISG,
author = "Michael Reiter",
title = "Integrating Security in a Group Oriented
Distributed System",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "27--27",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Walpole:1992:SAS,
author = "Jonathan Walpole and Richard Staehli",
title = "Supporting {Access} to {Stored Multimedia Data} in
{Large Distributed Systems Work} in {Progress}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "28--28",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kaashoek:1992:FIP,
author = "M. Frans Kaashoek and Robbert van Renesse and Hans van
Staveren and Andrew S. Tanenbaum",
title = "{FLIP}; an {Internetwork Protocol} for Supporting
Distributed Systems",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "29--29",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Finlayson:1992:SCV,
author = "Ross Finlayson",
title = "Structuring and {Communication} in the {Vanguard OS
Kernel}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "30--30",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{vanRennesse:1992:DIM,
author = "Robbert van Rennesse",
title = "Design and {Implementation} of a {Multicast Transport
Service}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "31--31",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herrtwich:1992:SSI,
author = "Ralf Guido Herrtwich",
title = "Summary of the {Second International Workshop} on
{Network} and {Operating System Support} for {Digital
Audio} and {Video}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "32--59",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gantenbein:1992:ABD,
author = "Rex E. Gantenbein",
title = "An annotated bibliography of dependable distributed
computing",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "60--81",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yang:1992:DCN,
author = "Cui-Qing Yang",
title = "Distributed computing in a {NUMP (Non-Uniform
Message-Passing)} environment",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "82--91",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ananda:1992:SAR,
author = "A. L. Ananda and B. H. Tay and E. K. Koh",
title = "A survey of asynchronous remote procedure calls",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "92--109",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Massalin:1992:LFMb,
author = "Henry Massalin and Calton Pu",
title = "A {Lock-Free Multiprocessor OS Kernel}",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "108--108",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Davari:1992:SUP,
author = "Sadegh Davari and Lui Sha",
title = "Sources of unbounded priority inversions in real-time
systems and a comparative study of possible solutions",
journal = j-OPER-SYS-REV,
volume = "26",
number = "2",
pages = "110--120",
month = apr,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ananthanarayanan:1992:EID,
author = "R. Ananthanarayanan and Sathis Menon and Ajay Mohindra
and Umakishore Ramachandran",
title = "Experiences in integrating distributed shared memory
with virtual memory management",
journal = j-OPER-SYS-REV,
volume = "26",
number = "3",
pages = "4--26",
month = jul,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{OShea:1992:RRP,
author = "G. O'Shea",
title = "Redundant rights in protection systems",
journal = j-OPER-SYS-REV,
volume = "26",
number = "3",
pages = "27--30",
month = jul,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hilzer:1992:SPC,
author = "Ralph C. {Hilzer, Jr.}",
title = "Synchronization of the producer\slash consumer problem
using semaphores, monitors, and the {Ada} rendezvous",
journal = j-OPER-SYS-REV,
volume = "26",
number = "3",
pages = "31--39",
month = jul,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:1992:PMP,
author = "Frank W. Miller",
title = "The performance of a mixed priority real-time
scheduling algorithm",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "5--13",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Inouye:1992:EVA,
author = "Jon Inouye and Ravindranath Konuru and Jonathan
Walpole and Bart Sears",
title = "The effects of virtually addressed caches on virtual
memory design and performance",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "14--29",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Borghoff:1992:DOD,
author = "Uwe M. Borghoff",
title = "Design of optimal distributed file systems: a
framework for research",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "30--61",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cao:1992:AMR,
author = "Jiannong Cao and K. C. Wang",
title = "An abstract model of rollback recovery control in
distributed systems",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "62--76",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Toinard:1992:NWD,
author = "G. Florin C. Toinard",
title = "A new way to design causally and totally ordered
multicast protocols",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "77--83",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kehne:1992:NBP,
author = "A. Kehne and J. Sch{\"o}nw{\"a}lder and H.
Langend{\"o}rfer",
title = "A nonce-based protocol for multiple authentications",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "84--89",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mooney:1992:CAO,
author = "James D. Mooney",
title = "The {CTRON} approach to operating system support for
software portability",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "90--97",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kifer:1992:OEO,
author = "Michael Kifer and Scott A. Smolka",
title = "{OSP}: an environment for operating system projects",
journal = j-OPER-SYS-REV,
volume = "26",
number = "4",
pages = "98--100",
month = oct,
year = "1992",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haddon:1993:BRG,
author = "Bruce K. Haddon",
title = "Book Review: {{\em Global Software: Developing
Applications for the International Market\/} by Dave
Taylor: (Springer-Verlag, New York 1992)}",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "5--6",
month = jan,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bartoli:1993:WAS,
author = "Alberto Bartoli and Sape J. Mullender and Martijn van
der Valk",
title = "Wide-address spaces: exploring the design space",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "11--17",
month = jan,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mosberger:1993:MCM,
author = "David Mosberger",
title = "Memory consistency models",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "18--26",
month = jan,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abawajy:1993:OPR,
author = "Djemal H. Abawajy",
title = "Orphan problems and remedies in distributed systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "27--32",
month = jan,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Low:1993:FGO,
author = "Marie Rose Low and Bruce Christianson",
title = "Fine grained object protection in {UNIX}",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "33--50",
month = jan,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hills:1993:SI,
author = "Ted Hills",
title = "Structured interrupts",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "51--68",
month = jan,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Leslie:1993:POS,
author = "Ian M. Leslie and Derek McAuley and Sape J.
Mullender",
title = "Pegasus---operating system support for distributed
multimedia systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "69--78",
month = jan,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guerrero:1993:IEA,
author = "R. Guerrero and L. Leguizamon and R. Gallard",
title = "Implementation and evaluation of alternative process
schedulers in {MINIX}",
journal = j-OPER-SYS-REV,
volume = "27",
number = "1",
pages = "79--100",
month = jan,
year = "1993",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/160551.160558",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "Compendex database;
https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Minix is a Unix clone Operating System, designed by
Tanembaum ([2], [3]) to allow beginners to do practical
training in Operatin Systems area. In this context the
present paper describes the work done by a group of
students implementing alternative process schedulers
disciplines and their evaluation comparing performance
estimates. Some unexpected deviations in the original
implementation (Minix V. 1. 0), found during software
development, are also reported.",
acknowledgement = ack-nhfb,
affiliation = "Univ Nacional de San Luis",
affiliation = "Dept. de Inf., Univ. Nacional de San Luis, Argentina",
affiliationaddress = "San Luis, Argent",
classification = "722.4; 723.1",
classification = "C0220 (Education and training); C6150J (Operating
systems); C7810C (Computer-aided instruction)",
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
journalabr = "Oper Syst Rev ACM",
keywords = "Alternative process schedulers; Computer operating
systems; Computer software; Evaluation; MINIX;
Performance; Scheduling; Software engineering",
keywords = "Alternative process schedulers disciplines; Beginners;
Performance estimates; Practical training; Software
development; Students; Unix clone operating system",
thesaurus = "Computer science education; Educational computing;
Scheduling; Unix",
}
@Article{Wong:1993:DSP,
author = "K. C. Wong",
title = "Determining the shortest process migration paths for
program compilation using a dynamic programming
approach",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "1--6",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Long:1993:NBM,
author = "Darrell D. E. Long",
title = "A note on bit-mapped free sector management",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "7--9",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Neuman:1993:NUT,
author = "B. Clifford Neuman and Stuart G. Stubblebine",
title = "A note on the use of timestamps as nonces",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "10--14",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Badrinath:1993:IMD,
author = "B. R. Badrinath and Arup Acharya and Tomasz
Imieli{\'n}ski",
title = "Impact of mobility on distributed computations",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "15--20",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patterson:1993:SRR,
author = "R. Hugo Patterson and Garth A. Gibson and M.
Satyanarayanan",
title = "A status report on research in transparent informed
prefetching",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "21--34",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kavka:1993:EDM,
author = "C. Kavka and M. Printista and R. Gallard",
title = "Extending device management in {Minix}",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "35--43",
month = apr,
year = "1993",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/155848.155856",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Minix is a Unix clone operating system, designed by
Tanembaum (1987), to allow beginners to do practical
training in the operating systems area. In this context
the present paper describes the work done by a group of
undergraduates implementing extensions in device
management. Problems in the original code, detected
during the analysis and development stages, are also
reported.",
acknowledgement = ack-nhfb,
affiliation = "Dept. de Inf., Univ. Nacional de San Luis, Argentina",
classification = "C6150J (Operating systems)",
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Device management; Minix; Operating systems; Unix
clone",
thesaurus = "Unix",
}
@Article{vanRenesse:1993:CCM,
author = "Robbert van Renesse",
title = "Causal controversy at {Le Mont St.-Michel}",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "44--53",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bryce:1993:MPD,
author = "C. Bryce and D. Hagimont and P. Joubert and C. Morin
and G. Muller and B. Rochat",
title = "Models and paradigms for distributed systems
structuring: summary of sessions",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "56--60",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chase:1993:DSA,
author = "Jeff Chase and Val{\'e}rie Issarnay and Hank Levy",
title = "Distribution in a single address space operating
system",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "61--65",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pu:1993:RLS,
author = "Calton Pu",
title = "Relaxing the limitations of serializable transactions
in distributed systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "66--71",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pike:1993:UNS,
author = "Rob Pike and Dave Presotto and Ken Thompson and Howard
Trickey and Phil Winterbottom",
title = "The use of name spaces in {Plan 9}",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "72--76",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saltzer:1993:NSS,
author = "Jerome H. Saltzer",
title = "{Needed}: a systematic structuring paradigm for
distributed data",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "77--81",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Almeida:1993:HAR,
author = "Carlos Almeida and Brad Glade and Keith Marzullo",
title = "High availability in a real-time system",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "82--87",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Douglis:1993:RCD,
author = "Fred Douglis",
title = "On the role of compression in distributed systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "88--93",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peterson:1993:LON,
author = "Larry L. Peterson",
title = "Life on the {OS}\slash network boundary",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "94--98",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stroud:1993:TRD,
author = "Robert Stroud",
title = "Transparency and reflection in distributed systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "99--103",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:1993:DHB,
author = "John Wilkes",
title = "{DataMesh}, house-building, and distributed systems
technology",
journal = j-OPER-SYS-REV,
volume = "27",
number = "2",
pages = "104--108",
month = apr,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yeo:1993:TIN,
author = "A. K. Yeo and A. L. Ananda and E. K. Koh",
title = "A taxonomy of issues in name systems design and
implementation",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "4--18",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gopalakrishnan:1993:PPA,
author = "R. Gopalakrishnan and Andreas D. Bovopoulos",
title = "A protocol processing architecture for networked
multimedia computers",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "19--33",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Raja:1993:SDP,
author = "Prasad Raja and Guevara Noubir",
title = "Static and dynamic polling mechanisms for {Fieldbus}
networks",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "34--45",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reddy:1993:NBT,
author = "P. Krishna Reddy and S. Bhalla",
title = "A non-blocking transaction data flow graph based
approach for replicated data",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "46--54",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yang:1993:ABG,
author = "Zhonghua Yang and T. Anthony Marsland",
title = "Annotated bibliography on global states and times in
distributed systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "55--74",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:1993:GCC,
author = "Xingwei Wang and Hong Zhao and Jiakeng Zhu",
title = "{GRPC}: a communication cooperation mechanism in
distributed systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "75--86",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ju:1993:PCU,
author = "Jiubin Ju and Gaochao Xu and Jie Tao",
title = "Parallel computing using idle workstations",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "87--96",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haro:1993:MEO,
author = "Christophe Haro and Christian Proust",
title = "A multitasking executive for operating systems
courses",
journal = j-OPER-SYS-REV,
volume = "27",
number = "3",
pages = "97--107",
month = jul,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:1993:SAO,
author = "Barton P. Miller and Charles McDowell",
title = "Summary of {ACM\slash ONR} workshop on parallel and
distributed debugging",
journal = j-OPER-SYS-REV,
volume = "27",
number = "4",
pages = "8--23",
month = oct,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Syverson:1993:KDP,
author = "Paul Syverson",
title = "On key distribution protocols for repeated
authentication",
journal = j-OPER-SYS-REV,
volume = "27",
number = "4",
pages = "24--30",
month = oct,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liebl:1993:ADS,
author = "Armin Liebl",
title = "Authentication in distributed systems: a
bibliography",
journal = j-OPER-SYS-REV,
volume = "27",
number = "4",
pages = "31--41",
month = oct,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Calvelli:1993:ARS,
author = "Claudio Calvelli and Vijay Varadharajan",
title = "Authentication and revocation in {SPM} extended
abstract",
journal = j-OPER-SYS-REV,
volume = "27",
number = "4",
pages = "42--57",
month = oct,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Romanovsky:1993:FTS,
author = "Alexander B. Romanovsky",
title = "Fault tolerance: synchronization of redundancy",
journal = j-OPER-SYS-REV,
volume = "27",
number = "4",
pages = "58--66",
month = oct,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Naimi:1993:DAK,
author = "Mohamed Naimi",
title = "Distributed algorithm for {K-entries} to critical
section based on the directed graphs",
journal = j-OPER-SYS-REV,
volume = "27",
number = "4",
pages = "67--75",
month = oct,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ciancarini:1993:LMM,
author = "P. Ciancarini and N. Guerrini",
title = "{Linda} meets {Minix}",
journal = j-OPER-SYS-REV,
volume = "27",
number = "4",
pages = "76--92",
month = oct,
year = "1993",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/163640.163647",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Currently much interest is devoted to the development
of systems supporting parallel and distributed
programming over a network of workstations. The authors
explore operating system support for this kind of
programming, that is usually implemented at the user
process level. They have chosen the Linda model as the
basis of a programming system for networks of personal
computers running Minix, a Unix-like operating system.
They briefly describe the Minix operating system and
its services for remote communication based on the
Amoeba protocol. They have extended Minix with new
communication primitives based on Linda; they show
their implementation, describing the new system
architecture, and compare the new system with other
Linda implementations.",
acknowledgement = ack-nhfb,
affiliation = "Bologna Univ., Italy",
classification = "C6110P (Parallel programming); C6140D (High level
languages); C6150N (Distributed systems)",
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Amoeba protocol; Communication primitives; Distributed
programming; Linda; Minix; Operating system support;
Personal computer networks; Remote communication; Unix;
Workstation network",
thesaurus = "Microcomputer applications; Network operating systems;
Parallel languages; Remote procedure calls",
}
@Article{Khalidi:1993:EFS,
author = "Yousef A. Khalidi and Michael N. Nelson",
title = "Extensible file systems in spring",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "1--14",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deJonge:1993:LDN,
author = "Wiebren de Jonge and M. Frans Kaashoek and Wilson C.
Hsieh",
title = "The {Logical Disk}: a new approach to improving file
systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "15--28",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "14th ACM Symposium on Operating Systems Principles,
Ashville, NC, USA.",
abstract = "The Logical Disk (LD) defines a new interface to disk
storage that separates file management and disk
management by using logical block numbers and block
lists. The LD interface is designed to support multiple
file systems and to allow multiple implementations,
both of which are important given the increasing use of
kernels that support multiple operating system
personalities. A log-structured implementation of LD
(LLD) demonstrates that LD can be implemented
efficiently. LLD adds about 5\% to 10\% to the purchase
cost of a disk for the main memory it requires.
Combining LLD with an existing file system results in a
log-structured file system that exhibits the same
performance characteristics as the Sprite
log-structured file system.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Math. and Comput. Sci., Vrije Univ.,
Amsterdam, Netherlands",
classification = "C6120 (File organisation); C6150J (Operating
systems)",
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Block lists; Disk management; Disk storage; File
management; File systems; Log-structured file system;
Logical block numbers; Logical Disk; MINIX; Multiple
file systems; Operating system personalities;
Performance characteristics; Sprite; UNIX",
thesaurus = "File organisation; Operating systems [computers];
Storage management",
}
@Article{Hartman:1993:ZSN,
author = "John H. Hartman and John K. Ousterhout",
title = "The {Zebra} striped network file system",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "29--43",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:1993:ULC,
author = "David R. Cheriton and Dale Skeen",
title = "Understanding the limitations of causally and totally
ordered communication",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "44--57",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oki:1993:IBA,
author = "Brian Oki and Manfred Pfluegl and Alex Siegel and Dale
Skeen",
title = "The {Information Bus}: an architecture for extensible
distributed systems",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "58--68",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hamilton:1993:SFB,
author = "Graham Hamilton and Michael L. Powell and James G.
Mitchell",
title = "{Subcontract}: a flexible base for distributed
programming",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "69--79",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:1993:IAT,
author = "Michael B. Jones",
title = "Interposition agents: transparently interposing user
code at the system interface",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "80--93",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hauser:1993:UTI,
author = "Carl Hauser and Christian Jacobi and Marvin Theimer
and Brent Welch and Mark Weiser",
title = "Using threads in interactive systems: a case study",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "94--105",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hosking:1993:PTA,
author = "Antony L. Hosking and J. Eliot B. Moss",
title = "Protection traps and alternatives for memory
management of an object-oriented language",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "106--119",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1993:IOS,
author = "J. Bradley Chen and Brian N. Bershad",
title = "The impact of operating system structure on memory
system performance",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "120--133",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Perl:1993:PAC,
author = "Sharon E. Perl and William E. Weihl",
title = "Performance assertion checking",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "134--145",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1993:LRV,
author = "M. Satyanarayanan and Henry H. Mashburn and Puneet
Kumar and David C. Steere and James J. Kistler",
title = "Lightweight recoverable virtual memory",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "146--160",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{OToole:1993:CCG,
author = "James O'Toole and Scott Nettles and David Gifford",
title = "Concurrent compacting garbage collection of a
persistent heap",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "161--174",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1993:IIK,
author = "Jochen Liedtke",
title = "Improving {IPC} by kernel design",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "175--188",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Druschel:1993:FHB,
author = "Peter Druschel and Larry L. Peterson",
title = "{Fbufs}: a high-bandwidth cross-domain transfer
facility",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "189--202",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wahbe:1993:ESB,
author = "Robert Wahbe and Steven Lucco and Thomas E. Anderson
and Susan L. Graham",
title = "Efficient software-based fault isolation",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "203--216",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birrell:1993:NO,
author = "Andrew Birrell and Greg Nelson and Susan Owicki and
Edward Wobber",
title = "Network objects",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "217--230",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:1993:HAV,
author = "Alan Jones and Andrew Hopper",
title = "Handling audio and video streams in a distributed
environment",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "231--243",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Maeda:1993:PSD,
author = "Chris Maeda and Brian N. Bershad",
title = "Protocol service decomposition for high-performance
networking",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "244--255",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wobber:1993:ATO,
author = "Edward Wobber and Mart{\'\i}n Abadi and Michael
Burrows and Butler Lampson",
title = "Authentication in the {Taos} operating system",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "256--269",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spreitzer:1993:PLI,
author = "Mike Spreitzer and Marvin Theimer",
title = "Providing location information in a ubiquitous
computing environment (panel session)",
journal = j-OPER-SYS-REV,
volume = "27",
number = "5",
pages = "270--283",
month = dec,
year = "1993",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nutt:1994:BRC,
author = "Gary J. Nutt",
title = "Book Review: {{\em Coloured Petri Nets: Basic
Concepts, Analysis Methods and Practical Use\/} (volume
1) by Kurt Jensen: (Springer-Verlag, 1992)}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "1--2",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kulkarni:1994:OSC,
author = "Dinesh C. Kulkarni and Arindam Banerji and David L.
Cohn",
title = "Operating systems and cost management",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "5--10",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birman:1994:RCS,
author = "Ken Birman",
title = "A response to {Cheriton} and {Skeen}'s criticism of
causal and totally ordered communication",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "11--21",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{vanRenesse:1994:WBC,
author = "Robbert van Renesse",
title = "Why bother with {CATOCS?}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "22--27",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cooper:1994:ECT,
author = "Robert Cooper",
title = "Experience with causally and totally ordered
communication support: a cautionary tale",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "28--31",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mukherjee:1994:MII,
author = "Bodhisattwa Mukherjee and Greg Eisenhauer and Kaushik
Ghosh",
title = "A machine independent interface for lightweight
threads",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "33--47",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mahoney:1994:OOF,
author = "Bill Mahoney",
title = "An ``open'' oriented file system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "48--54",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mummert:1994:VGC,
author = "L. Mummert and M. Satyanarayanan",
title = "Variable granularity cache coherence",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "55--60",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1994:SNIa,
author = "Jochen Liedtke",
title = "A short note on implementing ``new'' machine
instructions by software for efficient test of page
accessibility",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "61--65",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Benmohammed-Mahieddine:1994:PSI,
author = "K. Benmohammed-Mahieddine and P. M. Dew",
title = "A periodic symmetrically-initiated load balancing
algorithm for distributed systems",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "66--79",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bouabdallah:1994:MEF,
author = "Abdelmadjid Bouabdallah",
title = "On mutual exclusion in faulty distributed systems",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "80--87",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zimmermann:1994:MDM,
author = "Chris Zimmermann",
title = "Making distributed multimedia systems secure: the
switchboard approach",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "88--100",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1994:BRP,
author = "William M. Waite",
title = "Book Review: {{\em Programming with MOTIF\/} by Keith
D. Gregory: (Springer-Verlag, New York 1992)}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "1",
pages = "100--100",
month = jan,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Valentic:1994:BRH,
author = "Todd Valentic",
title = "Book Review: {{\em High-Speed Windows Applications:
Multitasking Design Methods\/} by Bruce E. Krell:
(Bantam Books, New York 1993)}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "4--5",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lightner:1994:BRT,
author = "Michael Lightner",
title = "Book Review: {{\em \TeX{} in Practice}, Volumes 1--4
by Stephan von Bechtolsheim: (Springer-Verlag, New York
1993)}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "6--8",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:1994:OSC,
author = "Maurice Wilkes",
title = "Operating systems in a changing world",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "9--21",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Blair:1994:SIW,
author = "G. S. Blair and A. Campbell and G. Coulson and N.
Davies and F. Garcia and D. Shepherd",
title = "Summary of the {4th International Workshop on Network
and Operating System Support for Digital Audio and
Video (NOSSDAV'93)}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "22--33",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aguirre:1994:DFH,
author = "G. Aguirre and M. Errecalde and S. Esquivel and G.
Leguizamon and R. Gallard",
title = "Design features of high level layers in {LAHNOS}, a
local area heterogeneous network operating system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "34--50",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wolf:1994:SAH,
author = "Lars C. Wolf and R. G. Herrtwich",
title = "The system architecture of the {Heidelberg} transport
system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "51--64",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fromentin:1994:LSD,
author = "Eddy Fromentin and Michel Raynal",
title = "Local states in distributed computations: a few
relations and formulas",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "65--72",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gschwind:1994:FAU,
author = "Michael K. Gschwind",
title = "{FTP} access as a user-defined file system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "73--80",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lu:1994:IOT,
author = "Qi Lu and M. Satyanarayanan",
title = "Isolation-only transactions for mobile computing",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "81--87",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hatkanagalekar:1994:NSI,
author = "Pradeep Hatkanagalekar",
title = "A note on structured interrupts",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "88--91",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gwinn:1994:SMT,
author = "Joe Gwinn",
title = "Some measurements of timeline gaps in {VAX\slash
VMS}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "2",
pages = "92--96",
month = apr,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bacon:1994:EAC,
author = "Jean Bacon and Richard Hayton and Sai Lai Lo and Ken
Moody",
title = "Extensible access control for a hierarchy of servers",
journal = j-OPER-SYS-REV,
volume = "28",
number = "3",
pages = "4--15",
month = jul,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carlsen:1994:OPA,
author = "Ulf Carlsen",
title = "Optimal privacy and authentication on a portable
communications system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "3",
pages = "16--23",
month = jul,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Woo:1994:LAP,
author = "Thomas Y. C. Woo and Simon S. Lam",
title = "A lesson on authentication protocol design",
journal = j-OPER-SYS-REV,
volume = "28",
number = "3",
pages = "24--37",
month = jul,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1994:SNIb,
author = "Jochen Liedtke",
title = "A short note on implementing thread exclusiveness and
address space locking",
journal = j-OPER-SYS-REV,
volume = "28",
number = "3",
pages = "38--42",
month = jul,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Crichlow:1994:COP,
author = "Joel M. Crichlow",
title = "Combining optimism and pessimism to produce high
availability in distributed transaction processing",
journal = j-OPER-SYS-REV,
volume = "28",
number = "3",
pages = "43--64",
month = jul,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Maffeis:1994:DIC,
author = "Silvano Maffeis",
title = "Design and implementation of a configurable
mixed-media file system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "4--10",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shrivastava:1994:CCL,
author = "Santosh K. Shrivastava",
title = "To {CATOCS} or not to {CATOCS}, that is the {\ldots}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "11--14",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Seung-Ju:1994:SBS,
author = "Jang Seung-Ju and Kim Gil-Yong",
title = "Spin-block synchronization algorithm in the shared
memory multiprocessor system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "15--30",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hills:1994:RNS,
author = "Ted Hills",
title = "Response to a note on structured interrupts",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "31--33",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barcellos:1994:HNO,
author = "Ant{\^o}nio Marinho Pilla Barcellos and Valdir Rossi
Belmonte Filho and Jo{\~a}o Frederico Lacava Schramm
and Cl{\'a}udio Fernando Resin Geyer",
title = "The {HetNOS} network operating system: a tool for
writing distributed applications",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "34--47",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Roscoe:1994:LNS,
author = "Timothy Roscoe",
title = "Linkage in the {Nemesis} single address space
operating system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "48--55",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spinellis:1994:TTL,
author = "Diomidis Spinellis",
title = "{Trace}: a tool for logging operating system call
transactions",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "56--63",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nuttall:1994:BSS,
author = "Mark Nuttall",
title = "A brief survey of systems providing process or object
migration facilities",
journal = j-OPER-SYS-REV,
volume = "28",
number = "4",
pages = "64--80",
month = oct,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Thekkath:1994:SDC,
author = "Chandramohan A. Thekkath and Henry M. Levy and Edward
D. Lazowska",
title = "Separating data and control transfer in distributed
operating systems",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "2--11",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chandra:1994:SPM,
author = "Rohit Chandra and Scott Devine and Ben Verghese and
Anoop Gupta and Mendel Rosenblum",
title = "Scheduling and page migration for multiprocessor
compute servers",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "12--24",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lim:1994:RSA,
author = "Beng-Hong Lim and Anant Agarwal",
title = "Reactive synchronization algorithms for
multiprocessors",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "25--35",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heinlein:1994:IMP,
author = "John Heinlein and Kourosh Gharachorloo and Scott
Dresser and Anoop Gupta",
title = "Integration of message passing and shared memory in
the {Stanford FLASH} multiprocessor",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "38--50",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Karamcheti:1994:SOM,
author = "Vijay Karamcheti and Andrew A. Chien",
title = "Software overhead in messaging layers: where does the
time go?",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "51--60",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chandra:1994:WTS,
author = "Satish Chandra and James R. Larus and Anne Rogers",
title = "Where is time spent in message-passing and
shared-memory programs?",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "61--73",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schmidt:1994:PHA,
author = "William J. Schmidt and Kelvin D. Nilsen",
title = "Performance of a hardware-assisted real-time garbage
collector",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "76--85",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wu:1994:ENV,
author = "Michael Wu and Willy Zwaenepoel",
title = "{eNVy}: a non-volatile, main memory storage system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "86--97",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Upton:1994:RAH,
author = "Michael Upton and Thomas Huff and Trevor Mudge and
Richard Brown",
title = "Resource allocation in a high clock rate
microprocessor",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "98--109",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Thekkath:1994:HSS,
author = "Chandramohan A. Thekkath and Henry M. Levy",
title = "Hardware and software support for efficient exception
handling",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "110--119",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Argade:1994:TMR,
author = "Pramod V. Argade and David K. Charles and Craig
Taylor",
title = "A technique for monitoring run-time dynamics of an
operating system and a microprocessor executing user
applications",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "122--131",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Uhlig:1994:TDS,
author = "Richard Uhlig and David Nagle and Trevor Mudge and
Stuart Sechrest",
title = "Trap-driven simulation with {Tapeworm II}",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "132--144",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Maynard:1994:CCC,
author = "Ann Marie Grizzaffi Maynard and Colette M. Donnelly
and Bret R. Olszewski",
title = "Contrasting characteristics and cache performance of
technical and multi-user commercial workloads",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "145--156",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bershad:1994:ACM,
author = "Brian N. Bershad and Dennis Lee and Theodore H. Romer
and J. Bradley Chen",
title = "Avoiding conflict misses dynamically in large
direct-mapped caches",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "158--170",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Talluri:1994:STP,
author = "Madhusudhan Talluri and Mark D. Hill",
title = "Surpassing the {TLB} performance of superpages with
less operating system support",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "171--182",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gallagher:1994:DMD,
author = "David M. Gallagher and William Y. Chen and Scott A.
Mahlke and John C. Gyllenhaal and Wen-mei W. Hwu",
title = "Dynamic memory disambiguation using the memory
conflict buffer",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "183--193",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hayashi:1994:AAS,
author = "Kenichi Hayashi and Tsunehisa Doi and Takeshi Horie
and Yoichi Koyanagi and Osamu Shiraki and Nobutaka
Imamura and Toshiyuki Shimizu and Hiroaki Ishihata and
Tatsuya Shindo",
title = "{AP1000+}: architectural support of {PUT\slash GET}
interface for parallelizing compiler",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "196--207",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Larus:1994:LMS,
author = "James R. Larus and Brad Richards and Guhan
Viswanathan",
title = "{LCM}: memory system support for parallel language
implementation",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "208--218",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Woo:1994:PAI,
author = "Steven Cameron Woo and Jaswinder Pal Singh and John L.
Hennessy",
title = "The performance advantages of integrating block data
transfer in cache-coherent multiprocessors",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "219--229",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Young:1994:IAS,
author = "Cliff Young and Michael D. Smith",
title = "Improving the accuracy of static branch prediction
using branch correlation",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "232--241",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Calder:1994:RBC,
author = "Brad Calder and Dirk Grunwald",
title = "Reducing branch costs via branch alignment",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "242--251",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carr:1994:COI,
author = "Steve Carr and Kathryn S. McKinley and Chau-Wen
Tseng",
title = "Compiler optimizations for improving data locality",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "252--262",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Engler:1994:DER,
author = "Dawson R. Engler and Todd A. Proebsting",
title = "{DCG}: an efficient, retargetable dynamic code
generation system",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "263--272",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heinrich:1994:PIF,
author = "Mark Heinrich and Jeffrey Kuskin and David Ofelt and
John Heinlein and Joel Baxter and Jaswinder Pal Singh
and Richard Simoni and Kourosh Gharachorloo and David
Nakahira and Mark Horowitz and Anoop Gupta and Mendel
Rosenblum and John Hennessy",
title = "The performance impact of flexibility in the {Stanford
FLASH} multiprocessor",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "274--285",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Skeppstedt:1994:SCA,
author = "Jonas Skeppstedt and Per Stenstr{\"o}m",
title = "Simple compiler algorithms to reduce ownership
overhead in cache coherence protocols",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "286--296",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schoinas:1994:FGA,
author = "Ioannis Schoinas and Babak Falsafi and Alvin R. Lebeck
and Steven K. Reinhardt and James R. Larus and David
A. Wood",
title = "Fine-grain access control for distributed shared
memory",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "297--306",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Laudon:1994:IMT,
author = "James Laudon and Anoop Gupta and Mark Horowitz",
title = "{Interleaving}: a multithreading technique targeting
multiprocessors and workstations",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "308--318",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carter:1994:HSF,
author = "Nicholas P. Carter and Stephen W. Keckler and William
J. Dally",
title = "Hardware support for fast capability-based
addressing",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "319--327",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Thekkath:1994:EMH,
author = "Radhika Thekkath and Susan J. Eggers",
title = "The effectiveness of multiple hardware contexts",
journal = j-OPER-SYS-REV,
volume = "28",
number = "5",
pages = "328--337",
month = dec,
year = "1994",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lightner:1995:BRT,
author = "Michael Lightner",
title = "Book Review: {{\em \TeX{} in Practice}, Stephan von
Bechtolsheim}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "2--6",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ju:1995:IDL,
author = "Jiubin Ju and Gaochao Xu and Kun Yang",
title = "An intelligent dynamic load balancer for workstation
clusters",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "7--16",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cena:1995:TRE,
author = "M. Cena and M. L. Crespo and R. Gallard",
title = "Transparent remote execution in {LAHNOS} by means of a
neural network device",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "17--28",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xie:1995:IIO,
author = "Li Xie and Xing Du and Jun Chen and Yuhua Zheng and
Zhongxiu Sun",
title = "An introduction to intelligent operating system
{KZ2}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "29--46",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shapiro:1995:SSS,
author = "Marc Shapiro",
title = "Summary of the {Sixth SIGOPS European Workshop on
``Matching Operating Systems to Application Needs''}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "47--51",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1995:AAA,
author = "M. Satyanarayanan and Brian Noble and Puneet Kumar and
Morgan Price",
title = "Application-aware adaptation for mobile computing",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "52--55",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Paradinas:1995:NDI,
author = "Pierre Paradinas and Jean-Jacques Vandewalle",
title = "New directions for integrated circuit cards operating
systems",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "56--61",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babaoglu:1995:GCL,
author = "{\"O}zalp Babao{\u{g}}lu and Andr{\'e} Schiper",
title = "On group communication in large-scale distributed
systems",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "62--67",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dean:1995:MDS,
author = "Dawson Dean and Richard Zippel",
title = "Matching data storage to application needs",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "68--73",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bershad:1995:SEM,
author = "Brian N. Bershad and Craig Chambers and Susan Eggers
and Chris Maeda and Dylan McNamee and Przemys{\l}aw
Pardyak and Stefan Savage and Emin G{\"u}n Sirer",
title = "{SPIN}---an extensible microkernel for
application-specific operating system services",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "74--77",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Engler:1995:OSK,
author = "Dawson R. Engler and M. Frans Kaashoek and James W.
{O'Toole, Jr.}",
title = "The operating system kernel as a secure programmable
machine",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "78--82",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:1995:CMO,
author = "David R. Cheriton and Kenneth J. Duda",
title = "A caching model of operating system kernel
functionality",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "83--86",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1995:ASS,
author = "Jochen Liedtke",
title = "Address space sparsity and fine granularity",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "87--90",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Black:1995:ORH,
author = "Andrew P. Black and Jonathan Walpole",
title = "Objects to the rescue! or httpd: the next generation
operating system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "1",
pages = "91--95",
month = jan,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kadhim:1995:BRLa,
author = "Basim Kadhim",
title = "Book Review: {{\em Linux: Unleashing the Workstation
in Your PC}, Stefan Strobel and Thomas Uhl}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "2--3",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1995:WMC,
author = "M. Satyanarayanan",
title = "Workshop on mobile computing systems and applications,
{December 1994}: digest of proceedings",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "4--12",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Roscoe:1995:CIS,
author = "Timothy Roscoe",
title = "{CLANGER}: an interpreted systems programming
language",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "13--20",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kleiman:1995:IT,
author = "Steve Kleiman and Joe Eykholt",
title = "Interrupts as threads",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "21--26",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Klostermeyer:1995:RDP,
author = "William F. Klostermeyer and Kankanahalli Srinivas",
title = "Reducing disk power consumption in a portable
computer",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "27--32",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Smolik:1995:OOF,
author = "Tomas Smolik",
title = "An object-oriented file system---an example of using
the class hierarchy framework concept",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "33--53",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lux:1995:AOM,
author = "Wolfgang Lux",
title = "Adaptable object migration: concept and
implementation",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "54--69",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schrimpf:1995:MPF,
author = "Harald Schrimpf",
title = "Migration of processes, files, and virtual devices in
the {MDX} operating system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "70--81",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Esquivel:1995:QOC,
author = "S. Esquivel and G. Leguizamon and R. Gallard",
title = "A quasi-optimal cluster allocation strategy for
parallel program execution in distributed systems using
genetic algorithms",
journal = j-OPER-SYS-REV,
volume = "29",
number = "2",
pages = "82--96",
month = apr,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1995:BRB,
author = "William M. Waite",
title = "Book Review: {{\em Building in Big Brother: The
Cryptographic Policy Debate}, Lance J. Hoffman}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "2--2",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Alves-Foss:1995:ACS,
author = "Jim Alves-Foss and Salvador Barbosa",
title = "Assessing computer security vulnerability",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "3--13",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kao:1995:ESA,
author = "I.-Lung Kao and Randy Chow",
title = "An efficient and secure authentication protocol using
uncertified keys",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "14--21",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Steiner:1995:REE,
author = "Michael Steiner and Gene Tsudik and Michael Waidner",
title = "Refinement and extension of encrypted key exchange",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "22--30",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1995:SNS,
author = "Jochen Liedtke",
title = "A short note a small virtually-addressed control
blocks",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "31--34",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Harry:1995:DVF,
author = "Michael Harry and Juan Miguel del Rosario and Alok
Choudhary",
title = "The design of {VIP-FS}: a virtual, parallel file
system for high performance parallel and distributed
computing",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "35--48",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Castori:1995:SRM,
author = "Pierre Castori",
title = "Semaphores revisited with {MMS}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "49--63",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Franky:1995:DPS,
author = "Maria Consuelo Franky",
title = "{DGDBM}: programming support for distributed
transactions over replicated files",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "64--74",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wainer:1995:IRT,
author = "Gabriel A. Wainer",
title = "Implementing real-time services in {MINIX}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "75--84",
month = jul,
year = "1995",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/206826.206846",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present the results of a project devoted to
providing programming facilities to develop hard
real-time software. We have used the MINIX operating
system as a tool. We allow the programmer to define
timing constraints for the tasks, letting the operating
system run these tasks in a timely fashion. In this
way, we can improve productivity, security and costs in
the system development cycle.",
acknowledgement = ack-nhfb,
affiliation = "Dept. de Comput., Buenos Aires Univ., Argentina",
classification = "C6115 (Programming support); C6130S (Data security);
C6150J (Operating systems)",
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Costs; Hard real-time software development; MINIX
operating system; Productivity; Programming facilities;
Real-time services; Security; System development cycle;
Tasks; Timing constraints",
thesaurus = "Operating systems [computers]; Real-time systems;
Security of data; Software cost estimation; Software
tools; Timing",
}
@Article{Romanovsky:1995:SDW,
author = "A. B. Romanovsky",
title = "Software diversity as a way to well-structured
concurrent software",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "85--90",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jia:1995:OSK,
author = "Xiaohua Jia and Mamoru Maekawa",
title = "Operating system kernel automatic construction",
journal = j-OPER-SYS-REV,
volume = "29",
number = "3",
pages = "91--96",
month = jul,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Blackman:1995:BRW,
author = "Sally Blackman",
title = "Book Review: {{\em The WEB Empowerment Book}, Ralph
Abraham, Frank Jas, and Willard Russell}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "2--2",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kadhim:1995:BRLb,
author = "Basim Kadhim",
title = "Book Review: {{\em Linux Universe}, Stefan Strobel and
Thomas Uhl}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "3--3",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheung:1995:EIO,
author = "W. H. Cheung and Anthony H. S. Loong",
title = "Exploring issues of operating systems structuring:
from microkernel to extensible systems",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "4--16",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Coulson:1995:APT,
author = "Geoff Coulson and Gordon Blair",
title = "Architectural principles and techniques for
distributed multimedia application support in operating
systems",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "17--24",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Petri:1995:LBF,
author = "S. Petri and H. Langend{\"o}rfer",
title = "Load balancing and fault tolerance in workstation
clusters migrating groups of communicating processes",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "25--36",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shyu:1995:VAT,
author = "Ing-Jye Shyu and Shiuh-Pyng Shieh",
title = "Virtual address translation for wide-address
architectures",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "37--46",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Welch:1995:SPM,
author = "Gregory F. Welch",
title = "A survey of power management techniques in mobile
computing operating systems",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "47--56",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mayes:1995:ULT,
author = "K. R. Mayes and S. Quick and B. C. Warboys",
title = "User-level threads on a general hardware interface",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "57--62",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oikawa:1995:RDU,
author = "Shuichi Oikawa and Hideyuki Tokuda",
title = "Reflection of developing user-level real-time thread
packages",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "63--76",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ding:1995:ULP,
author = "Yun Ding and Patrick Horster",
title = "Undetectable on-line password guessing attacks",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "77--86",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hu:1995:YCE,
author = "Ping Hu and Bruce Christianson",
title = "Is your computing environment secure?: security
problems with interrupt handling mechanisms",
journal = j-OPER-SYS-REV,
volume = "29",
number = "4",
pages = "87--96",
month = oct,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bressoud:1995:HBF,
author = "T. C. Bressoud and F. B. Schneider",
title = "Hypervisor-based fault tolerance",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "1--11",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chapin:1995:HFC,
author = "J. Chapin and M. Rosenblum and S. Devine and T. Lahiri
and D. Teodosiu and A. Gupta",
title = "{Hive}: fault containment for shared-memory
multiprocessors",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "12--25",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:1995:LVM,
author = "D. R. Cheriton and K. J. Duda",
title = "Logged virtual memory",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "26--38",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{vonEicken:1995:UNU,
author = "T. von Eicken and A. Basu and V. Buch and W. Vogels",
title = "{U-Net}: a user-level network interface for parallel
and distributed computing (includes {URL})",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "40--53",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nelson:1995:HAS,
author = "M. N. Nelson and M. Linton and S. Owicki",
title = "A highly available scalable {ITV} system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "54--67",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Steensgaard:1995:ONC,
author = "B. Steensgaard and E. Jul",
title = "Object and native code thread mobility among
heterogeneous computers (includes sources)",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "68--77",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patterson:1995:IPC,
author = "R. H. Patterson and G. A. Gibson and E. Ginting and D.
Stodolsky and J. Zelenka",
title = "Informed prefetching and caching",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "79--95",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:1995:HAH,
author = "J. Wilkes and R. Golding and C. Staelin and T.
Sullivan",
title = "The {HP AutoRAID} hierarchical storage system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "96--108",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:1995:SNF,
author = "T. E. Anderson and M. D. Dahlin and J. M. Neefe and D.
A. Patterson and D. S. Roselli and R. Y. Wang",
title = "Serverless network file systems",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "109--126",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heidemann:1995:PCC,
author = "J. Heidemann and G. Popek",
title = "Performance of cache coherence in stackable filing",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "127--141",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mummert:1995:EWC,
author = "L. B. Mummert and M. R. Ebling and M.
Satyanarayanan",
title = "Exploiting weak connectivity for mobile file access",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "143--155",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Joseph:1995:RTM,
author = "A. D. Joseph and A. F. de Lespinasse and J. A. Tauber
and D. K. Gifford and M. F. Kaashoek",
title = "{Rover}: a toolkit for mobile information access",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "156--171",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Terry:1995:MUC,
author = "D. B. Terry and M. M. Theimer and Karin Petersen and
A. J. Demers and M. J. Spreitzer and C. H. Hauser",
title = "Managing update conflicts in {Bayou}, a weakly
connected replicated storage system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "172--182",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Talluri:1995:NPT,
author = "M. Talluri and M. D. Hill and Y. A. Khalidi",
title = "A new page table for 64-bit address spaces",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "184--200",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Feeley:1995:IGM,
author = "M. J. Feeley and W. E. Morgan and E. P. Pighin and A.
R. Karlin and H. M. Levy and C. A. Thekkath",
title = "Implementing global memory management in a workstation
cluster",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "201--212",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Johnson:1995:CHP,
author = "K. L. Johnson and M. F. Kaashoek and D. A. Wallach",
title = "{CRL}: high-performance all-software distributed
shared memory",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "213--226",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baker:1995:GTP,
author = "Mary Baker",
title = "Going threadbare (panel session): sense or sedition? a
debate on the threads abstraction",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "227--227",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:1995:PCS,
author = "Eric W. Anderson",
title = "The performance of the {Container Shipping I/O}
system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "229--229",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fong:1995:TFS,
author = "Liana L. Fong and Mark S. Squillante",
title = "Time-function scheduling: a general approach to
controllable resource",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "230--230",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gopalakrishnan:1995:RTU,
author = "R. Gopalakrishnan and Guru M. Parulkar",
title = "A real-time upcall facility for protocol processing
with {QoS} guarantees",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "231--231",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ford:1995:UAI,
author = "Bryan Ford and Mike Hibler and Jay Lepreau",
title = "Using annotated interface definitions to optimize
{RPC}",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "232--232",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nieh:1995:SPS,
author = "Jason Nieh and Monica S. Lam",
title = "{SMART}: a processor scheduler for multimedia
applications",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "233--233",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gwertzman:1995:ARA,
author = "James S. Gwertzman and Margo Seltzer",
title = "Autonomous replication across wide-area
internetworks",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "234--234",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ghemawat:1995:UMO,
author = "Sanjay Ghemawat and M. Frans Kaashoek and Barbara
Liskov",
title = "Using a modified object buffer to improve the write
performance of an object-oriented database",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "235--235",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Harchol-Balter:1995:EPL,
author = "Mor Harchol-Balter and Allen B. Downey",
title = "Exploiting process lifetime distributions for dynamic
load balancing",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "236--236",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1995:MKC,
author = "J. Liedtke",
title = "On micro-kernel construction",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "237--250",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Engler:1995:EOS,
author = "D. R. Engler and M. F. Kaashoek and J. {O'Toole,
Jr.}",
title = "{Exokernel}: an operating system architecture for
application-level resource management",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "251--266",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bershad:1995:ESP,
author = "B. N. Bershad and S. Savage and P. Pardyak and E. G.
Sirer and M. E. Fiuczynski and D. Becker and
C. Chambers and S. Eggers",
title = "Extensibility safety and performance in the {SPIN}
operating system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "267--283",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rosenblum:1995:IAT,
author = "M. Rosenblum and E. Bugnion and S. A. Herrod and E.
Witchel and A. Gupta",
title = "The impact of architectural trends on operating system
performance",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "285--298",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1995:MPP,
author = "J. B. Chen and Y. Endo and K. Chan and D. Mazieres and
A. Dias and M. Seltzer and M. D. Smith",
title = "The measured performance of personal computer
operating systems",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "299--313",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pu:1995:OIS,
author = "C. Pu and T. Autrey and A. Black and C. Consel and C.
Cowan and J. Inouye and L. Kethana and J. Walpole and
K. Zhang",
title = "Optimistic incremental specialization: streamlining a
commercial operating system",
journal = j-OPER-SYS-REV,
volume = "29",
number = "5",
pages = "314--321",
month = dec,
year = "1995",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mitchell:1996:JBF,
author = "James G. Mitchell",
title = "{JavaOS}: back to the future",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "1--1",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mowry:1996:ACI,
author = "Todd C. Mowry and Angela K. Demke and Orran Krieger",
title = "Automatic compiler-inserted {I/O} prefetching for
out-of-core applications",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "3--17",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kimbrel:1996:TDC,
author = "Tracy Kimbrel and Andrew Tomkins and R. Hugo Patterson
and Brian Bershad and Pei Cao and Edward W. Felten and
Garth A. Gibson and Anna R. Karlin and Kai Li",
title = "A trace-driven comparison of algorithms for parallel
prefetching and caching",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "19--34",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sarkar:1996:ECC,
author = "Prasenjit Sarkar and John Hartman",
title = "Efficient cooperative caching using hints",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "35--46",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Perkovic:1996:ODR,
author = "Dejan Perkovic and Peter J. Keleher",
title = "Online data-race detection via coherency guarantees",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "47--57",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Costa:1996:LLL,
author = "Manuel Costa and Paulo Guedes and Manuel Sequeira and
Nuno Neves and Miguel Castro",
title = "Lightweight logging for lazy release consistent
distributed shared memory",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "59--73",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhou:1996:PET,
author = "Yuanyuan Zhou and Liviu Iftode and Kai Li",
title = "Performance evaluation of two home-based lazy release
consistency protocols for shared virtual memory
systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "75--88",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tennenhouse:1996:ANA,
author = "David Tennenhouse",
title = "Active networks (abstract)",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "89--89",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ford:1996:CIS,
author = "Bryan Ford and Sai Susarla",
title = "{CPU} inheritance scheduling",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "91--105",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Goyal:1996:HCS,
author = "Pawan Goyal and Xingang Guo and Harrick M. Vin",
title = "A hierarchical {CPU} scheduler for multimedia
operating systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "107--121",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Greenwald:1996:SBN,
author = "Michael Greenwald and David Cheriton",
title = "The synergy between non-blocking synchronization and
operating system structure",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "123--136",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ford:1996:MMR,
author = "Bryan Ford and Mike Hibler and Jay Lepreau and Patrick
Tullmann and Godmar Back and Stephen Clawson",
title = "Microkernels meet recursive virtual machines",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "137--151",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mosberger:1996:MPE,
author = "David Mosberger and Larry L. Peterson",
title = "Making paths explicit in the {Scout} operating
system",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "153--167",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Perl:1996:SWN,
author = "Sharon E. Perl and Richard L. Sites",
title = "Studies of {Windows NT} performance using dynamic
execution traces",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "169--183",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Endo:1996:ULE,
author = "Yasuhiro Endo and Zheng Wang and J. Bradley Chen and
Margo Seltzer",
title = "Using latency to evaluate interactive system
performance",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "185--199",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pardyak:1996:DBE,
author = "Przemys{\l}aw Pardyak and Brian N. Bershad",
title = "Dynamic binding for an extensible system",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "201--212",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Seltzer:1996:DDS,
author = "Margo I. Seltzer and Yasuhiro Endo and Christopher
Small and Keith A. Smith",
title = "Dealing with disaster: surviving misbehaved kernel
extensions",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "213--227",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Necula:1996:SKE,
author = "George C. Necula and Peter Lee",
title = "Safe kernel extensions without run-time checking",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "229--243",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Buzzard:1996:IHS,
author = "Greg Buzzard and David Jacobson and Milon Mackey and
Scott Marovich and John Wilkes",
title = "An implementation of the {Hamlyn} sender-managed
interface architecture",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "245--259",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Druschel:1996:LRP,
author = "Peter Druschel and Gaurav Banga",
title = "Lazy receiver processing {(LRP)}: a network subsystem
architecture for server systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "261--275",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brustoloni:1996:EBS,
author = "Jos{\'e} Carlos Brustoloni and Peter Steenkiste",
title = "Effects of buffering semantics on {I/O} performance",
journal = j-OPER-SYS-REV,
volume = "30",
number = "SI",
pages = "277--291",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deVivo:1996:BRD,
author = "Marco de Vivo",
title = "Book Review: {{\em Distributed Operating Systems\/} by
Andrew S. Tanenbaum}",
journal = j-OPER-SYS-REV,
volume = "30",
number = "1",
pages = "3--3",
month = jan,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1996:GPT,
author = "Jochen Liedtke and Kevin Elphinstone",
title = "Guarded page tables on {Mips R4600} or an exercise in
architecture-dependent micro optimization",
journal = j-OPER-SYS-REV,
volume = "30",
number = "1",
pages = "4--15",
month = jan,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Moore:1996:CSM,
author = "A. W. Moore and A. J. McGregor and J. W. Breen",
title = "A comparison of system monitoring methods, passive
network monitoring and kernel instrumentation",
journal = j-OPER-SYS-REV,
volume = "30",
number = "1",
pages = "16--38",
month = jan,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Samadzadeh:1996:DAT,
author = "M. H. Samadzadeh and B. S. Koshy",
title = "A display and analysis tool for process-resource
graphs",
journal = j-OPER-SYS-REV,
volume = "30",
number = "1",
pages = "39--62",
month = jan,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{VanMeter:1996:BSC,
author = "Rodney {Van Meter}",
title = "A brief survey of current work on network attached
peripherals (extended abstract)",
journal = j-OPER-SYS-REV,
volume = "30",
number = "1",
pages = "63--70",
month = jan,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eskicioglu:1996:CBD,
author = "M. Rasit Eskicio{\u{g}}lu",
title = "A comprehensive bibliography of distributed shared
memory",
journal = j-OPER-SYS-REV,
volume = "30",
number = "1",
pages = "71--96",
month = jan,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yang:1996:CPD,
author = "Zhonghua Yang and Keith Duddy",
title = "{CORBA}: a platform for distributed object computing",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "4--31",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shieh:1996:AKD,
author = "Shiuh-Pyng Shieh and Wen-Her Yang",
title = "An authentication and key distribution system for open
network systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "32--41",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ding:1996:WKA,
author = "Yun Ding and Patrick Horster",
title = "Why the {Kuperee} authentication system fails",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "42--51",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:1996:DRS,
author = "Ye-In Chang",
title = "A dynamic request set based algorithm for mutual
exclusion in distributed systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "52--62",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kotz:1996:FPP,
author = "David Kotz and Nils Nieuwejaar",
title = "Flexibility and performance of parallel file systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "63--73",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carretero:1996:PPF,
author = "J. Carretero and F. P{\'e}rez and P. de Miguel and F.
Garc{\'\i}a and L. Alonso",
title = "{ParFiSys}: a parallel file system for {MPP}",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "74--80",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Butenuth:1996:COS,
author = "Roger Butenuth and Wolfgang Burke and Hans-Ulrich
Hei{\ss}",
title = "{Cosy}: an operating system for highly parallel
computers",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "81--91",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liedtke:1996:SNC,
author = "Jochen Liedtke",
title = "A short note on cheap fine-grained time measurement",
journal = j-OPER-SYS-REV,
volume = "30",
number = "2",
pages = "92--94",
month = apr,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Syverson:1996:NLO,
author = "Paul F. Syverson",
title = "A new look at an old protocol",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "1--4",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tai:1996:VNO,
author = "K. C. Tai and Richard H. Carver",
title = "{VP}: a new operation for semaphores",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "5--11",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reed:1996:ACA,
author = "Benjamin Reed and Darrell D. E. Long",
title = "Analysis of caching algorithms for distributed file
systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "12--21",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ju:1996:SPT,
author = "Jiubin Ju and Yong Wang",
title = "Scheduling {PVM} tasks",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "22--31",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Varadharajan:1996:JAB,
author = "Vijay Varadharajan and Phillip Allen",
title = "Joint actions based authorization schemes",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "32--45",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Naimi:1996:DME,
author = "Mohamed Naimi",
title = "Distributed mutual exclusion on hypercubes",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "46--51",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Panadiwal:1996:HPA,
author = "Rajmohan Panadiwal and Andrzej M. Goscinski",
title = "A high performance and adaptive commit protocol for a
distributed environment",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "52--58",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mountassir:1996:DCD,
author = "H. Mountassir",
title = "Decidability of a class of dual communicating finite
state machines",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "59--66",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tsai:1996:RTS,
author = "Wen-Jiin Tsai and Suh-Yin Lee",
title = "Real-time scheduling of multimedia data retrieval to
minimize buffer requirement",
journal = j-OPER-SYS-REV,
volume = "30",
number = "3",
pages = "67--80",
month = jul,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hua:1996:DCM,
author = "Ji Hua and Xie Li",
title = "A distributed computing model based on multiserver",
journal = j-OPER-SYS-REV,
volume = "30",
number = "4",
pages = "3--11",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mitchell:1996:CKU,
author = "Chris J. Mitchell and Liqun Chen",
title = "Comments on the {S/KEY} user authentication scheme",
journal = j-OPER-SYS-REV,
volume = "30",
number = "4",
pages = "12--16",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:1996:SSA,
author = "Jongwoon Lee and Sungyoung Lee and Hyungill Kim",
title = "Scheduling soft aperiodic tasks in adaptable
fixed-priority systems",
journal = j-OPER-SYS-REV,
volume = "30",
number = "4",
pages = "17--28",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Robinson:1996:ASS,
author = "John T. Robinson",
title = "Analysis of steady-state segment storage utilizations
in a log-structured file system with least-utilized
segment cleaning",
journal = j-OPER-SYS-REV,
volume = "30",
number = "4",
pages = "29--32",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cornilleau:1996:CCA,
author = "T. Cornilleau and E. Gressier-Soudan",
title = "A combined-consistency approach: sequential \&
causal-consistency",
journal = j-OPER-SYS-REV,
volume = "30",
number = "4",
pages = "33--44",
month = oct,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Olukotun:1996:CSC,
author = "Kunle Olukotun and Basem A. Nayfeh and Lance Hammond
and Ken Wilson and Kunyung Chang",
title = "The case for a single-chip multiprocessor",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "2--11",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pai:1996:EMC,
author = "Vijay S. Pai and Parthasarathy Ranganathan and Sarita
V. Adve and Tracy Harton",
title = "An evaluation of memory consistency models for
shared-memory systems with {ILP} processors",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "12--23",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Scott:1996:SCT,
author = "Steven L. Scott",
title = "Synchronization and communication in the {T3E}
multiprocessor",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "26--36",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Krishnamurthy:1996:EAS,
author = "Arvind Krishnamurthy and Klaus E. Schauser and Chris
J. Scheiman and Randolph Y. Wang and David E. Culler
and Katherine Yelick",
title = "Evaluation of architectural support for global
address-based communication in large-scale parallel
machines",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "37--48",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Grunwald:1996:WPO,
author = "Dirk Grunwald and Richard Neves",
title = "Whole-program optimization for time and space
efficient threads",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "50--59",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Philbin:1996:TSC,
author = "James Philbin and Jan Edler and Otto J. Anshus and
Craig C. Douglas and Kai Li",
title = "Thread scheduling for cache locality",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "60--71",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1996:RFC,
author = "Peter M. Chen and Wee Teck Ng and Subhachandra Chandra
and Christopher Aycock and Gurushankar Rajamani and
David Lowell",
title = "The {Rio} file cache: surviving operating system
crashes",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "74--83",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:1996:PDV,
author = "Edward K. Lee and Chandramohan A. Thekkath",
title = "{Petal}: distributed virtual disks",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "84--92",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McKinley:1996:QAL,
author = "Kathryn S. McKinley and Olivier Temam",
title = "A quantitative analysis of loop nest locality",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "94--104",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Huang:1996:IBR,
author = "Andrew S. Huang and John Paul Shen",
title = "The intrinsic bandwidth requirements of ordinary
programs",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "105--114",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Seznec:1996:MBA,
author = "Andr{\'e} Seznec and St{\'e}phan Jourdan and Pascal
Sainrat and Pierre Michaud",
title = "Multiple-block ahead branch predictors",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "116--127",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1996:ABP,
author = "I-Cheng K. Chen and John T. Coffey and Trevor N.
Mudge",
title = "Analysis of branch prediction via data compression",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "128--137",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lipasti:1996:VLL,
author = "Mikko H. Lipasti and Christopher B. Wilkerson and John
Paul Shen",
title = "Value locality and load value prediction",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "138--147",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Romer:1996:SPI,
author = "Theodore H. Romer and Dennis Lee and Geoffrey M.
Voelker and Alec Wolman and Wayne A. Wong and Jean-Loup
Baer and Brian N. Bershad and Henry M. Levy",
title = "The structure and performance of interpreters",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "150--159",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fox:1996:ANC,
author = "Armando Fox and Steven D. Gribble and Eric A. Brewer
and Elan Amir",
title = "Adapting to network and client variability via
on-demand dynamic distillation",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "160--170",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Scales:1996:SLO,
author = "Daniel J. Scales and Kourosh Gharachorloo and
Chandramohan A. Thekkath",
title = "{Shasta}: a low overhead, software-only approach for
supporting fine-grain shared memory",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "174--185",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dwarkadas:1996:ICT,
author = "Sandhya Dwarkadas and Alan L. Cox and Willy
Zwaenepoel",
title = "An integrated compile-time\slash run-time software
distributed shared memory system",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "186--197",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bianchini:1996:HCL,
author = "R. Bianchini and L. I. Kontothanassis and R. Pinto and
M. De Maria and M. Abud and C. L. Amorim",
title = "Hiding communication latency and coherence overhead in
software {DSMs}",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "198--209",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Erlichson:1996:SAP,
author = "Andrew Erlichson and Neal Nuckolls and Greg Chesson
and John Hennessy",
title = "{SoftFLASH}: analyzing the performance of clustered
distributed virtual shared memory",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "210--220",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Luk:1996:CBP,
author = "Chi-Keung Luk and Todd C. Mowry",
title = "Compiler-based prefetching for recursive data
structures",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "222--233",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saghir:1996:EDD,
author = "Mazen A. R. Saghir and Paul Chow and Corinna G. Lee",
title = "Exploiting dual data-memory banks in digital signal
processors",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "234--243",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bugnion:1996:CDP,
author = "Edouard Bugnion and Jennifer M. Anderson and Todd C.
Mowry and Mendel Rosenblum and Monica S. Lam",
title = "Compiler-directed page coloring for multiprocessors",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "244--255",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jamrozik:1996:RNL,
author = "Herv{\'e} A. Jamrozik and Michael J. Feeley and
Geoffrey M. Voelker and James {Evans II} and Anna
R. Karlin and Henry M. Levy and Mary K. Vernon",
title = "Reducing network latency using subpages in a global
memory environment",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "258--267",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peir:1996:ICP,
author = "Jih-Kwon Peir and Windsor W. Hsu and Honesty Young and
Shauchi Ong",
title = "Improving cache performance with balanced tag and data
paths",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "268--278",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Verghese:1996:OSS,
author = "Ben Verghese and Scott Devine and Anoop Gupta and
Mendel Rosenblum",
title = "Operating system support for improving data locality
on {CC-NUMA} compute servers",
journal = j-OPER-SYS-REV,
volume = "30",
number = "5",
pages = "279--289",
month = dec,
year = "1996",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Robinson:1997:NPR,
author = "John T. Robinson and Murthy V. Devarakonda",
title = "Note on a problem with {Reed} and {Long}'s {FBR}
results",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "3--4",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tanenbaum:1997:RSA,
author = "Andrew S. Tanenbaum",
title = "Report on the {Seventh ACM SIGOPS European Workshop:
Systems Support for Worldwide Applications}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "5--17",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1997:AWC,
author = "M. Satyanarayanan and Mirjana Spasojevic",
title = "{AFS} and the {Web}: competitors or collaborators?",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "18--23",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dwyer:1997:MAF,
author = "Dane Dwyer and Vaduvur Bharghavan",
title = "A mobility-aware file system for partially connected
operation",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "24--30",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Richmond:1997:NPM,
author = "Michael Richmond and Michael Hitchens",
title = "A new process migration algorithm",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "31--42",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhu:1997:MIL,
author = "Weiping Zhu and Piotr Socko and Bartek Kiepuszewski",
title = "Migration impact on load balancing---an experience on
{Amoeba}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "43--53",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Romanovsky:1997:CGS,
author = "Alexander B. Romanovsky",
title = "Conversational group service",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "54--63",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Varadharajan:1997:ESP,
author = "Vijay Varadharajan",
title = "Extending the {Schematic Protection Model II}:
revocation",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "64--77",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zeadally:1997:ERT,
author = "Sherali Zeadally",
title = "An evaluation of the real-time performances of
{SVR4.0} and {SVR4.2}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "78--87",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Low:1997:JAS,
author = "Marie Rose Low and James A. Malcolm",
title = "A joint authorisation scheme",
journal = j-OPER-SYS-REV,
volume = "31",
number = "1",
pages = "88--96",
month = jan,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1997:BRP,
author = "W. M. Waite",
title = "Book Review: {{\em PostScript \& Acrobat\slash PDF},
Thomas Merz}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "1--1",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1997:BRR,
author = "W. M. Waite",
title = "Book Reviews: {Robert Slade's {\em Guide to Computer
Viruses}}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "1--1",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1997:BRW,
author = "W. M. Waite",
title = "Book Reviews: {{\em The Web Publisher's Illustrated
Quick Reference}, Ralph Grabowski}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "2--2",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Helme:1997:SFF,
author = "Arne Helme and Tage Stabell-Kul{\o}",
title = "Security functions for a file repository",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "3--8",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stabell-Kulo:1997:SLS,
author = "Tage Stabell-Kul{\o}",
title = "Security and log structured file systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "9--10",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babaoglu:1997:GMV,
author = "{\"O}zalp Babao{\u{g}}lu and Renzo Davoli and Alberto
Montresor",
title = "Group membership and view synchrony in partitionable
asynchronous distributed systems: specifications",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "11--22",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:1997:GCM,
author = "Qun Li and Hua Ji and Li Xie",
title = "Group consistency model which separates the
intra-group consistency maintenance from the
inter-group consistency maintenance in large scale
{DSM} systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "23--35",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rizzo:1997:VFA,
author = "Luigi Rizzo",
title = "A very fast algorithm for {RAM} compression",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "36--45",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Arredondo:1997:LDB,
author = "D. Arredondo and M. Errecalde and F. Piccoli and M.
Printista and R. Gallard and s. Flores",
title = "Load distribution and balancing support in a
workstation-based distributed system",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "46--59",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Karges:1997:DIP,
author = "Jonathan Karges and Otto Ritter and S{\'a}ndor
Suhai",
title = "Design and implementation of a parallel pipe",
journal = j-OPER-SYS-REV,
volume = "31",
number = "2",
pages = "60--94",
month = apr,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Auyong:1997:ASC,
author = "Keok Auyong and Chye-Lin Chee",
title = "Authentication services for computer networks and
electronic messaging systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "3",
pages = "3--15",
month = jul,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1997:AUM,
author = "Liqun Chen and Dieter Gollmann and Chris J.
Mitchell",
title = "Authentication using minimally trusted servers",
journal = j-OPER-SYS-REV,
volume = "31",
number = "3",
pages = "16--28",
month = jul,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:1997:FTD,
author = "Ye-In Chang and Yao-Jen Chang",
title = "A fault-tolerant dynamic triangular mesh protocol for
distributed mutual exclusion",
journal = j-OPER-SYS-REV,
volume = "31",
number = "3",
pages = "29--44",
month = jul,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hou:1997:MBR,
author = "Jianmin Hou and Xuandong Li and Xiaocong Fan and
Guoliang Zheng",
title = "A message-based real-time model by object-oriented
technique",
journal = j-OPER-SYS-REV,
volume = "31",
number = "3",
pages = "45--51",
month = jul,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vogt:1997:VUS,
author = "Carsten Vogt",
title = "Visualizing {UNIX} synchronization operations",
journal = j-OPER-SYS-REV,
volume = "31",
number = "3",
pages = "52--64",
month = jul,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heuring:1997:BRE,
author = "Vincent P. Heuring",
title = "Book Review: {{\em Essential Java Fast}, John
Cowell}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "2--2",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Markatos:1997:VWS,
author = "Evangelos P. Markatos",
title = "Visualizing working sets",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "3--11",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xu:1997:PCP,
author = "Shouhuai Xu and Gendu Zhang and Hong Zhu",
title = "On the properties of cryptographic protocols and the
weaknesses of the {BAN}-like logics",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "12--23",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ledru:1997:APE,
author = "Pascal Ledru",
title = "Adaptive parallelism: an early experiment with {Java}
remote method invocation",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "24--29",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:1997:BPF,
author = "Qun Li and Jie Jing and Li Xie",
title = "{BFXM}: a parallel file system model based on the
mechanism of distributed shared memory",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "30--40",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shi:1997:ICP,
author = "Weisong Shi and Weiwu Hu and Zhimin Tang",
title = "An interaction of coherence protocols and memory
consistency models in {DSM} systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "41--54",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rodriquez:1997:NCM,
author = "Santiago Rodr{\'\i}quez and Antonio P{\'e}rez and
Rafael M{\'e}ndez",
title = "A new checkpoint mechanism for real time operating
systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "55--62",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Romanovsky:1997:DCA,
author = "A. Romanovsky and A. F. Zorzo",
title = "On distribution of coordinated atomic actions",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "63--71",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ponder:1997:OUD,
author = "Carl Ponder",
title = "Organizing {UNIX} directories as lattices",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "72--77",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{He:1997:MDA,
author = "Yanxiang He and Donald H. Cooley and Jianping Zhang",
title = "A model for a distributed {OS} automatic generation
system",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "78--84",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{He:1997:SSD,
author = "Yanxiang He and Jianping Zhang and Donald H. Cooley
and Li Chen",
title = "Semantics subsystem in distributed {OS} formalization
generating system",
journal = j-OPER-SYS-REV,
volume = "31",
number = "4",
pages = "85--92",
month = oct,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:1997:CPW,
author = "Jennifer M. Anderson and Lance M. Berc and Jeffrey
Dean and Sanjay Ghemawat and Monika R. Henzinger and
Shun-Tak A. Leung and Richard L. Sites and Mark
T. Vandevoorde and Carl A. Waldspurger and William
E. Weihl",
title = "Continuous profiling: where have all the cycles
gone?",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "1--14",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:1997:SSA,
author = "Xiaolan Zhang and Zheng Wang and Nicholas Gloy and J.
Bradley Chen and Michael D. Smith",
title = "System support for automatic profiling and
optimization",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "15--26",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Savage:1997:EDD,
author = "Stefan Savage and Michael Burrows and Greg Nelson and
Patrick Sobalvarro and Thomas Anderson",
title = "{Eraser}: a dynamic data race detector for
multi-threaded programs",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "27--37",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ford:1997:FOS,
author = "Bryan Ford and Godmar Back and Greg Benson and Jay
Lepreau and Albert Lin and Olin Shivers",
title = "The {Flux OSKit}: a substrate for kernel and language
research",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "38--51",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kaashoek:1997:APF,
author = "M. Frans Kaashoek and Dawson R. Engler and Gregory R.
Ganger and Hector M. Brice{\~n}o and Russell Hunt and
David Mazi{\`e}res and Thomas Pinckney and Robert Grimm
and John Jannotti and Kenneth Mackenzie",
title = "Application performance and flexibility on exokernel
systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "52--65",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hartig:1997:PKB,
author = "Hermann H{\"a}rtig and Michael Hohmuth and Jochen
Liedtke and Sebastian Sch{\"o}nberg",
title = "The performance of {$\mu$}-kernel-based systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "66--77",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fox:1997:CBS,
author = "Armando Fox and Steven D. Gribble and Yatin Chawathe
and Eric A. Brewer and Paul Gauthier",
title = "Cluster-based scalable network services",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "78--91",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lowell:1997:FTR,
author = "David E. Lowell and Peter M. Chen",
title = "Free transactions with {Rio Vista}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "92--101",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Castro:1997:HHA,
author = "Miguel Castro and Atul Adya and Barbara Liskov and
Andrew C. Meyers",
title = "{HAC}: hybrid adaptive caching for distributed storage
systems",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "102--115",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wallach:1997:ESA,
author = "Dan S. Wallach and Dirk Balfanz and Drew Dean and
Edward W. Felten",
title = "Extensible security architectures for {Java}",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "116--128",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Myers:1997:DMI,
author = "Andrew C. Myers and Barbara Liskov",
title = "A decentralized model for information flow control",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "129--142",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bugnion:1997:DRC,
author = "Edouard Bugnion and Scott Devine and Mendel
Rosenblum",
title = "{Disco}: running commodity operating systems on
scalable multiprocessors",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "143--156",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Scales:1997:TTE,
author = "Daniel J. Scales and Kourosh Gharachorloo",
title = "Towards transparent and efficient software distributed
shared memory",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "157--169",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stets:1997:CSC,
author = "Robert Stets and Sandhya Dwarkadas and Nikolaos
Hardavellas and Galen Hunt and Leonidas Kontothanassis
and Srinivasan Parthasarathy and Michael Scott",
title = "{Cashmere-2L}: software coherent shared memory on a
clustered remote-write network",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "170--183",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nieh:1997:DIE,
author = "Jason Nieh and Monica S. Lam",
title = "The design, implementation and evaluation of {SMART}:
a scheduler for multimedia applications",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "184--197",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:1997:CRT,
author = "Michael B. Jones and Daniela Ro{\c{s}}u and
Marcel-C{\~a}t{\~a}lin Ro{\c{s}}u",
title = "{CPU} reservations and time constraints: efficient,
predictable scheduling of independent activities",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "198--211",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bolosky:1997:DSM,
author = "William J. Bolosky and Robert P. Fitzgerald and John
R. Douceur",
title = "Distributed schedule management in the {Tiger} video
fileserver",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "212--223",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Thekkath:1997:FSD,
author = "Chandramohan A. Thekkath and Timothy Mann and Edward
K. Lee",
title = "{Frangipani}: a scalable distributed file system",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "224--237",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Matthews:1997:IPL,
author = "Jeanna Neefe Matthews and Drew Roselli and Adam M.
Costello and Randolph Y. Wang and Thomas E. Anderson",
title = "Improving the performance of log-structured file
systems with adaptive methods",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "238--251",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Steere:1997:END,
author = "David C. Steere",
title = "Exploiting the non-determinism and asynchrony of set
iterators to reduce aggregate file {I/O} latency",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "252--263",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kuenning:1997:AHM,
author = "Geoffrey H. Kuenning and Gerald J. Popek",
title = "Automated hoarding for mobile computers",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "264--275",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Noble:1997:AAA,
author = "Brian D. Noble and M. Satyanarayanan and Dushyanth
Narayanan and James Eric Tilton and Jason Flinn and
Kevin R. Walker",
title = "Agile application-aware adaptation for mobility",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "276--287",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Petersen:1997:FUP,
author = "Karin Petersen and Mike J. Spreitzer and Douglas B.
Terry and Marvin M. Theimer and Alan J. Demers",
title = "Flexible update propagation for weakly consistent
replication",
journal = j-OPER-SYS-REV,
volume = "31",
number = "5",
pages = "288--301",
month = dec,
year = "1997",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Feustel:1998:DUI,
author = "Edward A. Feustel and Terry Mayfield",
title = "The {DGSA}: unmet information security challenges for
operating system designers",
journal = j-OPER-SYS-REV,
volume = "32",
number = "1",
pages = "3--22",
month = jan,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pfitzmann:1998:HBF,
author = "Birgit Pfitzmann and Michael Waidner",
title = "How to break fraud-detectable key recovery",
journal = j-OPER-SYS-REV,
volume = "32",
number = "1",
pages = "23--28",
month = jan,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Faber:1998:OTW,
author = "Theodore Faber",
title = "Optimizing throughout in a workstation-based network
file system over a high bandwidth local area network",
journal = j-OPER-SYS-REV,
volume = "32",
number = "1",
pages = "29--40",
month = jan,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babaoglu:1998:SSP,
author = "{\"O}zalp Babao{\u{g}}lu and Renzo Davoli and Alberto
Montresor and Roberto Segala",
title = "System support for partition-aware network
applications",
journal = j-OPER-SYS-REV,
volume = "32",
number = "1",
pages = "41--56",
month = jan,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{He:1998:PMM,
author = "Yanxiang He and Donald H. Cooley and Jianping Zhang",
title = "Planning management of multiagent-based distributed
open: computing environment model",
journal = j-OPER-SYS-REV,
volume = "32",
number = "1",
pages = "57--64",
month = jan,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waite:1998:OSR,
author = "W. M. Waite",
title = "Is operating systems review obsolete?",
journal = j-OPER-SYS-REV,
volume = "32",
number = "2",
pages = "1--1",
month = apr,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haring:1998:IWP,
author = "Gunter Haring and Christoph Lindemann and Martin
Reiser",
title = "International workshop performance evaluation",
journal = j-OPER-SYS-REV,
volume = "32",
number = "2",
pages = "2--3",
month = apr,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deVivo:1998:ISA,
author = "Marco de Vivo and Gabriela O. de Vivo and Germinal
Isern",
title = "{Internet} security attacks at the basic levels",
journal = j-OPER-SYS-REV,
volume = "32",
number = "2",
pages = "4--15",
month = apr,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gritzalis:1998:SIS,
author = "Stefanos Gritzalis and George Aggelis",
title = "Security issues surrounding programming languages for
mobile code: {JAVA} vs. {Safe-Tcl}",
journal = j-OPER-SYS-REV,
volume = "32",
number = "2",
pages = "16--32",
month = apr,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xu:1998:STP,
author = "Shouhuai Xu and Gendu Zhang and Hong Zhu",
title = "On the security of three-party cryptographic
protocols",
journal = j-OPER-SYS-REV,
volume = "32",
number = "3",
pages = "7--20",
month = jul,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See comments \cite{Ng:1999:CST}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mahmood:1998:TAD,
author = "Amjad Mahmood",
title = "Task allocation in distributed computing systems",
journal = j-OPER-SYS-REV,
volume = "32",
number = "3",
pages = "21--29",
month = jul,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kang:1998:ASN,
author = "Sung-Il Kang and Heung-Kyu Lee",
title = "Analysis and solution of non-preemptive policies for
scheduling readers and writers",
journal = j-OPER-SYS-REV,
volume = "32",
number = "3",
pages = "30--50",
month = jul,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See comment \cite{Kuhnhauser:1999:CKH}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dimitoglou:1998:DMT,
author = "George Dimitoglou",
title = "Deadlocks and methods for their detection, prevention
and recovery in modern operating systems",
journal = j-OPER-SYS-REV,
volume = "32",
number = "3",
pages = "51--54",
month = jul,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lu:1998:SLB,
author = "Sanglu Lu and Xie Li",
title = "A scalable loading balancing system for {NOWs}",
journal = j-OPER-SYS-REV,
volume = "32",
number = "3",
pages = "55--63",
month = jul,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yang:1998:CHR,
author = "Zhonghua Yang and Chengzheng Sun",
title = "{CORBA} for hard real time applications: some critical
issues",
journal = j-OPER-SYS-REV,
volume = "32",
number = "3",
pages = "64--71",
month = jul,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bordawekar:1998:CCF,
author = "Rajesh Bordawekar",
title = "A case for compositional file systems (extended
abstract)",
journal = j-OPER-SYS-REV,
volume = "32",
number = "3",
pages = "72--80",
month = jul,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Voelker:1998:RSP,
author = "Geoffrey M. Voelker",
title = "Report on the {SIGMETRICS'98\slash PERFORMANCE'98
Joint International Conference on Measurement and
Modeling of Computer Systems}",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "3--8",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:1998:NFA,
author = "Ross Anderson and Francesco Bergadano and Bruno Crispo
and Jong-Hyeon Lee and Charalampos Manifavas and Roger
Needham",
title = "A new family of authentication protocols",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "9--20",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mitchell:1998:FPH,
author = "Chris J. Mitchell and Chan Yeob Yeun",
title = "Fixing a problem in the {Helsinki} protocol",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "21--24",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:1998:TAP,
author = "D. Patiyoot and S. J. Shepherd",
title = "Techniques for authentication protocols and key
distribution on wireless {ATM} networks",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "25--32",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Joye:1998:IBS,
author = "Marc Joye and Sung-Ming Yen",
title = "{ID}-based secret-key cryptography",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "33--39",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wagner:1998:CCP,
author = "Bernhard Wagner",
title = "Controlling {CGI} programs",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "40--46",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cgi (common gateway interface)",
}
@Article{Kuhnhauser:1998:CIA,
author = "Winfried E. K{\"u}hnhauser",
title = "A classification of interdomain actions",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "47--61",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ryan:1998:SPD,
author = "Stein J. Ryan",
title = "Synchronization in portable device drivers",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "62--69",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wei:1998:SCC,
author = "Xiaohui Wei and Jiubin Ju",
title = "{SFT}: a consistent checkpointing algorithm with
shorter freezing time",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "70--76",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Robbins:1998:IEI,
author = "Steven Robbins",
title = "Introducing empirical investigation in undergraduate
operating systems",
journal = j-OPER-SYS-REV,
volume = "32",
number = "4",
pages = "77--80",
month = oct,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cooper:1998:CCM,
author = "Keith D. Cooper and Timothy J. Harvey",
title = "Compiler-controlled memory",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "2--11",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Seidl:1998:SHO,
author = "Matthew L. Seidl and Benjamin G. Zorn",
title = "Segregating heap objects by reference behavior and
lifetime",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "12--23",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Strout:1998:SIS,
author = "Michelle Mills Strout and Larry Carter and Jeanne
Ferrante and Beth Simon",
title = "Schedule-independent storage mapping for loops",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "24--33",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sodani:1998:EAI,
author = "Avinash Sodani and Gurindar S. Sohi",
title = "An empirical analysis of instruction repetition",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "35--45",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:1998:STS,
author = "Walter Lee and Rajeev Barua and Matthew Frank and
Devabhaktuni Srikrishna and Jonathan Babb and Vivek
Sarkar and Saman Amarasinghe",
title = "Space-time scheduling of instruction-level parallelism
on a raw machine",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "46--57",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hammond:1998:DSS,
author = "Lance Hammond and Mark Willey and Kunle Olukotun",
title = "Data speculation support for a chip multiprocessor",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "58--69",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{VanMeter:1998:VNV,
author = "Rodney {Van Meter} and Gregory G. Finn and Steve
Hotz",
title = "{VISA}: {Netstation}'s virtual {Internet SCSI}
adapter",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "71--80",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Acharya:1998:ADP,
author = "Anurag Acharya and Mustafa Uysal and Joel Saltz",
title = "Active disks: programming model, algorithms and
evaluation",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "81--91",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gibson:1998:CEH,
author = "Garth A. Gibson and David F. Nagle and Khalil Amiri
and Jeff Butler and Fay W. Chang and Howard Gobioff and
Charles Hardin and Erik Riedel and David Rochberg and
Jim Zelenka",
title = "A cost-effective, high-bandwidth storage
architecture",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "92--103",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Machanick:1998:HST,
author = "Philip Machanick and Pierre Salverda and Lance
Pompe",
title = "Hardware-software trade-offs in a direct {Rambus}
implementation of the {RAMpage} memory hierarchy",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "105--114",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Roth:1998:DBP,
author = "Amir Roth and Andreas Moshovos and Gurindar S. Sohi",
title = "Dependence based prefetching for linked data
structures",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "115--126",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weissman:1998:PCS,
author = "Boris Weissman",
title = "Performance counters and state sharing annotations: a
unified approach to thread locality",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "127--138",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Calder:1998:CCD,
author = "Brad Calder and Chandra Krintz and Simmi John and Todd
Austin",
title = "Cache-conscious data placement",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "139--149",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Le:1998:OET,
author = "Bich C. Le",
title = "An out-of-order execution technique for runtime binary
translators",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "151--158",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Krintz:1998:OET,
author = "Chandra Krintz and Brad Calder and Han Bok Lee and
Benjamin G. Zorn",
title = "Overlapping execution with transfer using non-strict
execution for mobile programs",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "159--169",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stark:1998:VLP,
author = "Jared Stark and Marius Evers and Yale N. Patt",
title = "Variable length path branch prediction",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "170--179",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Verghese:1998:PIS,
author = "Ben Verghese and Anoop Gupta and Mendel Rosenblum",
title = "Performance isolation: sharing and isolation in
shared-memory multiprocessors",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "181--192",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:1998:UMA,
author = "Yuqun Chen and Angelos Bilas and Stefanos N.
Damianakis and Cezary Dubnicki and Kai Li",
title = "{UTLB}: a mechanism for address translation on network
interfaces",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "193--204",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pai:1998:LAR,
author = "Vivek S. Pai and Mohit Aron and Gaurov Banga and
Michael Svendsen and Peter Druschel and Willy
Zwaenepoel and Erich Nahum",
title = "Locality-aware request distribution in cluster-based
network servers",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "205--216",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Temam:1998:IOL,
author = "Olivier Temam",
title = "Investigating optimal local memory performance",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "218--227",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ghosh:1998:PMA,
author = "Somnath Ghosh and Margaret Martonosi and Sharad
Malik",
title = "Precise miss analysis for program transformations with
caches of arbitrary associativity",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "228--239",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peir:1998:CDM,
author = "Jih-Kwon Peir and Yongjoon Lee and Windsor W. Hsu",
title = "Capturing dynamic memory reference behavior with
adaptive cache topology",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "240--250",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Citron:1998:AMM,
author = "Daniel Citron and Dror Feitelson and Larry Rudolph",
title = "Accelerating multi-media processing by implementing
memoing in multiplication and division units",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "252--261",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fu:1998:VSS,
author = "Chao-Ying Fu and Matthew D. Jennings and Sergei Y.
Larin and Thomas M. Conte",
title = "Value speculation scheduling for high performance
processors",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "262--271",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ranganathan:1998:ESD,
author = "Narayan Ranganathan and Manoj Franklin",
title = "An empirical study of decentralized {ILP} execution
models",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "272--281",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schnarr:1998:FOP,
author = "Eric Schnarr and James R. Larus",
title = "Fast out-of-order processor simulation using
memoization",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "283--294",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jacob:1998:LSM,
author = "Bruce L. Jacob and Trevor N. Mudge",
title = "A look at several memory management units,
{TLB}-refill mechanisms, and page table organizations",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "295--306",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ranganathan:1998:PDW,
author = "Parthasarathy Ranganathan and Kourosh Gharachorloo and
Sarita V. Adve and Luiz Andr{\'e} Barroso",
title = "Performance of database workloads on shared-memory
systems with out-of-order processors",
journal = j-OPER-SYS-REV,
volume = "32",
number = "5",
pages = "307--318",
month = dec,
year = "1998",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bacon:1999:REA,
author = "Jean Bacon",
title = "Report on the {Eighth ACM SIGOPS European Workshop}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "1",
pages = "6--17",
month = jan,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ryan:1999:SPD,
author = "Stein J. Ryan",
title = "Synchronization in portable device drivers",
journal = j-OPER-SYS-REV,
volume = "33",
number = "1",
pages = "18--25",
month = jan,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xiao-Hui:1999:SAS,
author = "Wei Xiao-Hui and Ju Jiu-Bin",
title = "{SCR} algorithm: saving\slash restoring states of file
systems",
journal = j-OPER-SYS-REV,
volume = "33",
number = "1",
pages = "26--33",
month = jan,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gu:1999:EJT,
author = "Yan Gu and B. S. Lee and Wentong Cai",
title = "Evaluation of {Java} thread performance on two
different multithreaded kernels",
journal = j-OPER-SYS-REV,
volume = "33",
number = "1",
pages = "34--46",
month = jan,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kwon:1999:CSR,
author = "Taekyoung Kwon and Jooseok Song",
title = "Clarifying straight replays and forced delays",
journal = j-OPER-SYS-REV,
volume = "33",
number = "1",
pages = "47--52",
month = jan,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kuhnhauser:1999:CKH,
author = "Winfried E. K{\"u}hnhauser",
title = "A comment on {S. Kang}'s and {H. Lee}'s paper on
{``Analysis and solution of non-preemptive policies for
scheduling readers and writers'' (OSR 32(2))}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "2",
pages = "4--4",
month = apr,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Kang:1998:ASN}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dan:1999:QAM,
author = "Pei Dan and Wang Dongsheng and Zhang Youhui and Shen
Meiming",
title = "Quasi-asynchronous migration: a novel migration
protocol for {PVM} tasks",
journal = j-OPER-SYS-REV,
volume = "33",
number = "2",
pages = "5--14",
month = apr,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Campbell:1999:OSA,
author = "Andrew T. Campbell and Irene Katzela and Kazuho Miki
and John Vicente",
title = "{Open Signaling for ATM, INTERNET and Mobile Networks
(OPENSIG'98)}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "2",
pages = "15--28",
month = apr,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:1999:WWA,
author = "Danai Patiyoot and S. J. Shepherd",
title = "{WASS}: wireless {ATM} security system",
journal = j-OPER-SYS-REV,
volume = "33",
number = "2",
pages = "29--35",
month = apr,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:1999:CST,
author = "Danai Patiyoot and S. J. Shepherd",
title = "Cryptographic security techniques for wireless
networks",
journal = j-OPER-SYS-REV,
volume = "33",
number = "2",
pages = "36--50",
month = apr,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Halfmann:1999:ESP,
author = "Udo Halfmann and Winfried E. K{\"u}hnhauser",
title = "Embedding security policies into a distributed
computing environment",
journal = j-OPER-SYS-REV,
volume = "33",
number = "2",
pages = "51--64",
month = apr,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ng:1999:CST,
author = "Siaw-Lynn Ng",
title = "Comments on {``On the Security of Three-Party
Cryptographic Protocols'' by Xu, Zhang, Zhu}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "3",
pages = "5--6",
month = jul,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Xu:1998:STP}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kotz:1999:MAF,
author = "David Kotz and Robert S. Gray",
title = "Mobile agents and the future of the {Internet}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "3",
pages = "7--13",
month = jul,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1999:VPE,
author = "M. Satyanarayanan and Jason Flinn and Kevin R.
Walker",
title = "Visual proxy: exploiting {OS} customizations without
application source code",
journal = j-OPER-SYS-REV,
volume = "33",
number = "3",
pages = "14--18",
month = jul,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:1999:BBB,
author = "Jong-Hyeon Lee",
title = "The big brother ballot",
journal = j-OPER-SYS-REV,
volume = "33",
number = "3",
pages = "19--25",
month = jul,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:1999:MES,
author = "D. Patiyoot and S. J. Shepherd",
title = "Modelling and evaluation of security induced delay in
wireless {ATM} networks",
journal = j-OPER-SYS-REV,
volume = "33",
number = "3",
pages = "26--31",
month = jul,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jin:1999:FRF,
author = "Hai Jin",
title = "On-the-fly reconstruction of the failed disk in
{RAID}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "3",
pages = "32--42",
month = jul,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kang:1999:PEN,
author = "Sung-Il Kang and Kihyun Pyun and Heung-Kyu Lee",
title = "Performance evaluation of non-preemptive policies for
scheduling readers and writers",
journal = j-OPER-SYS-REV,
volume = "33",
number = "3",
pages = "43--61",
month = jul,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:1999:DPS,
author = "M. Satyanarayanan",
title = "Digest of proceedings, {Seventh IEEE Workshop on Hot
Topics in Operating Systems, March 29--30, 1999, Rio
Rico, AZ}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "4--21",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:1999:SIA,
author = "Danai Patiyoot and S. J. Shepard",
title = "Security issues in {ATM} networks",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "22--35",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:1999:WSS,
author = "D. Patiyoot and S. J. Shepherd",
title = "{WASS}: a security services for wireless {ATM}
networks",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "36--41",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bull:1999:NMA,
author = "John A. Bull and David J. Otway",
title = "A nested mutual authentication protocol",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "42--47",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:1999:AFV,
author = "Yuqing Zhang and Jihong Li and Guozhen Xiao",
title = "An approach to the formal verification of the
two-party cryptographic protocols",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "48--51",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See comments \cite{Ji:2001:CAF}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waddington:1999:RPG,
author = "D. G. Waddington and D. Hutchison",
title = "Resource partitioning in general purpose operating
systems: experimental results in {Windows NT}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "52--74",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Toinard:1999:FMP,
author = "C. Toinard and G. Florin and C. Carrez",
title = "A formal method to prove ordering properties of
multicast systems",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "75--75",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baquero:1999:USC,
author = "Carlos Baquero and Francisco Moura",
title = "Using structural characteristics for autonomous
operation",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "90--96",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saito:1999:MAP,
author = "Yasushi Saito and Brian N. Bershad and Henry M.
Levy",
title = "Manageability, availability and performance in
{Porcupine}: a highly scalable, cluster-based mail
service",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "1--15",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wolman:1999:SPC,
author = "Alec Wolman and M. Voelker and Nitin Sharma and Neal
Cardwell and Anna Karlin and Henry M. Levy",
title = "On the scale and performance of cooperative {Web}
proxy caching",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "16--31",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schmidt:1999:IPS,
author = "Brian K. Schmidt and Monica S. Lam and J. Duane
Northcutt",
title = "The interactive performance of {SLIM}: a stateless,
thin-client architecture",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "32--47",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Flinn:1999:EAA,
author = "Jason Flinn and M. Satyanarayanan",
title = "Energy-aware adaptation for mobile applications",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "48--63",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wetherall:1999:ANV,
author = "David Wetherall",
title = "Active network vision and reality: lessons from a
capsule-based system",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "64--79",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liu:1999:BRH,
author = "Xiaoming Liu and Christoph Kreitz and Robbert van
Renesse and Jason Hickey and Mark Hayden and Kenneth
Birman and Robert Constable",
title = "Building reliable, high-performance communication
systems from components",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "80--92",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vogels:1999:FSU,
author = "Werner Vogels",
title = "File system usage in {Windows NT 4.0}",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "93--109",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Santry:1999:DWF,
author = "Douglas S. Santry and Michael J. Feeley and Norman C.
Hutchinson and Alistair C. Veitch and Ross W. Carton
and Jacob Ofir",
title = "Deciding when to forget in the {Elephant} file
system",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "110--123",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mazieres:1999:SKM,
author = "David Mazi{\`e}res and Michael Kaminsky and M. Frans
Kaashoek and Emmett Witchel",
title = "Separating key management from file system security",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "124--139",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chiueh:1999:ISP,
author = "Tzi-cker Chiueh and Ganesh Venkitachalam and Prashant
Pradhan",
title = "Integrating segmentation and paging protection for
safe, efficient and transparent software extensions",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "140--153",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Govil:1999:CDR,
author = "Kinshuk Govil and Dan Teodosiu and Yongqiang Huang and
Mendel Rosenblum",
title = "Cellular {Disco}: resource management using virtual
clusters on shared-memory multiprocessors",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "154--169",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shapiro:1999:EFC,
author = "Jonathan S. Shapiro and Jonathan M. Smith and David J.
Farber",
title = "{EROS}: a fast capability system",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "170--185",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Adjie-Winoto:1999:DII,
author = "William Adjie-Winoto and Elliot Schwartz and Hari
Balakrishnan and Jeremy Lilley",
title = "The design and implementation of an intentional naming
system",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "186--201",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sirer:1999:DID,
author = "Emin G{\"u}n Sirer and Robert Grimm and Arthur J.
Gregory and Brian N. Bershad",
title = "Design and implementation of a distributed virtual
machine for networked computers",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "202--216",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Morris:1999:CMR,
author = "Robert Morris and Eddie Kohler and John Jannotti and
M. Frans Kaashoek",
title = "The {Click} modular router",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "217--231",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aron:1999:STE,
author = "Mohit Aron and Peter Druschel",
title = "Soft timers: efficient microsecond software timer
support for network processing",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "232--246",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Douceur:1999:PBR,
author = "John R. Douceur and William J. Bolosky",
title = "Progress-based regulation of low-importance
processes",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "247--260",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Duda:1999:BVT,
author = "Kenneth J. Duda and David R. Cheriton",
title = "Borrowed-virtual-time {(BVT)} scheduling: supporting
latency-sensitive threads in a general-purpose
scheduler",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "261--276",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zuberi:1999:ESM,
author = "Khawar M. Zuberi and Padmanabhan Pillai and Kang G.
Shin",
title = "{EMERALDS}: a small-memory real-time microkernel",
journal = j-OPER-SYS-REV,
volume = "33",
number = "5",
pages = "277--299",
month = dec,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nicholas:2000:OTD,
author = "Tyrone Nicholas and Jerzy A. Barchanski",
title = "Overview of {TOS}: a distributed educational operating
system in {Java}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "1",
pages = "2--10",
month = jan,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dube:2000:SHC,
author = "Rohit Dube",
title = "Scalable hierarchical coarse-grained timers",
journal = j-OPER-SYS-REV,
volume = "34",
number = "1",
pages = "11--20",
month = jan,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kun:2000:SMA,
author = "Yang Kun and Guo Xin and Liu Dayou",
title = "Security in mobile agent system: problems and
approaches",
journal = j-OPER-SYS-REV,
volume = "34",
number = "1",
pages = "21--28",
month = jan,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lepreau:2000:SSS,
author = "Jay Lepreau and Eric Eide",
title = "Session summaries from the {17th Symposium on
Operating Systems Principle (SOSP'99)}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "4--5",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Theimer:2000:TMW,
author = "Mark Theimer and M. Satyanarayanan and Maria Ebling
and Mary Baker and Frans Kaashoek and Jay Lepreau and
Andrew Black and Carla Ellis",
title = "Tribute to {Mark Weiser} (summary only)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "6--7",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saltzer:2000:CCI,
author = "Jerry Saltzer",
title = "Copying with complexity (invited talk) (summary
only)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "7--8",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lampson:2000:CSR,
author = "Butler Lampson",
title = "Computer systems research (invited talk) (summary
only): past and future",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "8--9",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saito:2000:MAP,
author = "Yasushi Saito and Brian N. Bershad and Henry M.
Levy",
title = "Manageability, availability and performance in
{Porcupine}: a highly scalable, cluster-based mail
service (summary only)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "9--11",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wolman:2000:SPC,
author = "Alec Wolman and Geoffrey M. Voelker and Nitin Sharma
and Neal Cardwell and Anna Karlin and Henry M. Levy",
title = "On the scale and performance of cooperative {Web}
proxy caching",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "11--12",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schimdt:2000:IPS,
author = "Brian K. Schimdt and Monica S. Lam and J. Duane
Northcut",
title = "The interactive performance of {SLIM}: a stateless,
thin-client architecture",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "12--13",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Flinn:2000:EAA,
author = "Jason Flinn and M. Satyanarayanan",
title = "Energy-aware adaptation for mobile applications",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "13--14",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wetherall:2000:ANV,
author = "David Wetherall",
title = "Active network vision and reality: lessons from a
capsule-based system",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "15--16",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liu:2000:BRH,
author = "Xiaoming Liu and Christoph Kreitz and Robbert van
Renesse and Jason Hickey and Mark Hayden and Kenneth
Birman and Robert Constable",
title = "Building reliable, high-performance communication
systems from components",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "16--17",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vogels:2000:FSU,
author = "Werner Vogels",
title = "File system usage in {Windows NT 4.0}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "17--18",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Santry:2000:DWF,
author = "Douglas S. Santry and Michael J. Feeley and Norman C.
Hutchinson and Alistair C. Veitch and Ross W. Carton
and Jacob Ofir",
title = "Deciding when to forget in the {Elephant} file
system",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "18--19",
month = apr,
year = "2000",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/346152.346180",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mazieres:2000:SKM,
author = "David Mazi{\`e}res and Michael Kaminsky and M. Frans
Kaashoek and Emmett Witchel",
title = "Separating key management from file system security",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "19--20",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chiueh:2000:ISP,
author = "Tzi-Cker Chiueh and Ganesh Venkitachalam and Prashant
Pradhan",
title = "Integrating segmentation and paging protection for
safe, efficient and transparent software extensions",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "20--20",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Govil:2000:CDR,
author = "Kingshuk Govil and Dan Teodosiu and Yongqiang Huang
and Mendel Rosenblum",
title = "Cellular disco: resource management using virtual
clusters on shared-memory multiprocessors",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "21--21",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shapiro:2000:EFC,
author = "Jonathan S. Shapiro and Jonathan M. Smith and David J.
Farber",
title = "{EROS}: a fast capability system",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "21--22",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Adjie-Winoto:2000:DII,
author = "William Adjie-Winoto and Elliot Schwartz and Hari
Balakrishnan and Jeremy Lilley",
title = "The design and implementation of an intentional naming
system",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "22--22",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sirer:2000:DID,
author = "Emin G{\"u}n Sirer and Robert Grimm and Arthur J.
Gregory and Brian N. Bershad",
title = "Design and implementation of a distributed virtual
machine for networked computers",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "23--23",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Morris:2000:CMR,
author = "Robert Morris and Eddie Kohler and John Jannotti and
M. Frans Kaashoek",
title = "The click modular router",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "24--25",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aron:2000:STE,
author = "Mohit Aron and Peter Druschel",
title = "Soft timers: efficient microsecond software timer
support for network processing",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "25--26",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Douceur:2000:PBR,
author = "John R. Douceur and William J. Bolosky",
title = "Process-based regulation of low-importance processes",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "26--27",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Duda:2000:BVT,
author = "Kenneth J. Duda and David R. Cheriton",
title = "Borrowed-virtual-time {(BVT)} scheduling: supporting
latency-sensitive threads in a general-purpose
scheduler",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "27--28",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zuberi:2000:ESM,
author = "Khawar M. Zuberi and Padmanabhan Pillai and Kang G.
Shin",
title = "{EMERALDS}: a small-memory real-time microkernel",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "28--29",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shapiro:2000:LLW,
author = "Marc Shapiro",
title = "Lessons learned from a wide area sharing platform",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "29--29",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bolosky:2000:MDC,
author = "William J. Bolosky and John R. Doucher and Marvin
Theimer",
title = "Mutually-distrusting cooperative file systems",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "29--30",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ganger:2000:IMB,
author = "Greg Ganger and Steve Schlosser and John Griffin and
David Nagle",
title = "Incorporating {MEMS}-based storage into computer
systems",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "30--30",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lepreau:2000:HCE,
author = "Jay Lepreau and Chris Alfeld and David Andersen and
Kristin Wright",
title = "A highly configurable emulation facility for
distributed systems and networks",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "30--30",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ramachandran:2000:SIU,
author = "Umakishore Ramachandran",
title = "System infrastructure for ubiquitous presence",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "31--31",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Regehr:2000:HSP,
author = "John Regehr and John A. Stankovic",
title = "Hierarchical schedulers, performance guarantee, and
resource management",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "31--31",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Flatt:2000:CPC,
author = "Matthew Flatt and Alastair Reid and Jay Lepreau",
title = "{CpU}: practical components for systems software",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "32--32",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Scott:2000:IOC,
author = "Michael L. Scott and Sandhya Dwarkadas and Srinivasan
Parthasarathy and Rajeev Balasubramonian and DeQing
Chen and Grigorios Magklis and Athanasios Papathanasiou
and Eduardo Pinheiro and Umit Rencuzogullari and
Chunquiang Tang",
title = "{Interweave}: object caching meets software
distributed shared memory",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "32--32",
month = apr,
year = "2000",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/346152.346220",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deLara:2000:PCBa,
author = "Eyal de Lara and Dan Wallach and Willy Zwaenepoel",
title = "{Puppeteer}: component-based adaptation for mobile
computing",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "33--33",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lu:2000:FCRa,
author = "Chenyang Lu and John A. Stankovic and Tarek Abdelzaher
and Sang H. Son and Gang Tao",
title = "Feedback control real-time scheduling: support for
performance guarantees in unpredictable environments",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "33--33",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shinjo:2000:DCEa,
author = "Yasushi Shinjo and Calton Pu",
title = "Developing correct and efficient multithreaded
programs with thread-specific data and a partial
evaluator",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "33--33",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yu:2000:TTAa,
author = "Haifeng Yu",
title = "{TACT}: tunable availability and consistency tradeoffs
for replicated {Internet} services",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "33--33",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brown:2000:TBMa,
author = "Aaron Brown",
title = "Towards benchmarks for maintainability, availability
and growth\slash evolution",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "34--34",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:2000:Ta,
author = "David Cheriton",
title = "{TRIAD}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "34--34",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Halvorsen:2000:NLFa,
author = "P{\aa}l Halvorsen",
title = "Network level framing: speeding up a multimedia
storage server",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "34--34",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ryutov:2000:RESa,
author = "Tatyana Ryutov and Clifford Neuman",
title = "Representation and evaluation of security policies",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "34--34",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cecchet:2000:DSM,
author = "Emmanuel Cecchet",
title = "Distributed shared memory for large computing clusters
based on memory-mapped networks (poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "35--35",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2000:AGP,
author = "Fay Chang and Garth Gibson",
title = "Automatic generation of {I/O} prefetching hints
through speculative execution (poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "35--35",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kilicote:2000:PPA,
author = "Han Kilicote",
title = "{PASIS}: perpetually available and secure information
systems (poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "35--35",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Amiri:2000:AFP,
author = "Khalil Amiri and David Petrou and Greg Ganger and
Garth Gibson",
title = "Automatic function placement in distributed storage
systems",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "36--36",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chandra:2000:DQT,
author = "Surendar Chandra and Carla Schlatter Ellis and Amin
Vahdat",
title = "Differentiated {QoS} through quality aware
transformation of {Web} content",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "36--36",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Halvorsen:2000:IPO,
author = "P{\aa}l Halvorsen and Thomas Plagemann and Vera
Goebel",
title = "The {INSTANCE} project: operating system enhancements
to support multimedia servers",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "36--36",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ong:2000:IVM,
author = "Joon Suan Ong and Yvonne Coady and Michael J.
Feeley",
title = "Integrating virtual memory with user-level network
communication",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "36--37",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Acharya:2000:RFR,
author = "Anurag Acharya and Maximilian Ibel and Matthias
Koelsch and Michael Schmitt",
title = "{RENS}: a framework for rapidly evolvable network
services",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "37--37",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:2000:SDS,
author = "Donald Miller and Alan Skousen",
title = "The {Sombrero} distributed single address space
operating system",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "37--37",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Negishi:2000:TCS,
author = "Yasushi Negishi",
title = "{Tuplink}: a communication system for {PDAs} and
micro-devices",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "37--37",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gribble:2000:PDD,
author = "Steven D. Gribble and Eric A. Brewer and David Culler
and Joseph M. Hellerstein",
title = "Persistent distributed data structures to simplify
cluster-based {Internet} services",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "37--38",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jul:2000:HPC,
author = "Eric Jul and Povl Koch and J{\o}rgen S. Hansen and
Michael Svendsen and Kim Henriksen and Kenn Nielsen and
Mads Dydensborg",
title = "High-performance cluster-based {Internet} servers",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "38--38",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zadok:2000:FLS,
author = "Erez Zadok and Jason Nieh",
title = "{FIST}: a language for stackable file systems",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "38--38",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Howell:2000:RDS,
author = "Jon Howell and David Kotz",
title = "Restricted delegation: seamlessly spanning
administrative boundaries",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "38--39",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McDonald:2000:DFM,
author = "Ian McDonald",
title = "Distributed, flexible memory management in an
operating system supporting quality of service",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "39--39",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Neugebauer:2000:ULP,
author = "Rolf Neugebauer",
title = "A {Unix}-like personality supporting
quality-of-service",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "39--39",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pradhan:2000:SHP,
author = "Prashant Pradhan and Anindya Neogi",
title = "{Suez}: high-performance real-time {IP} router",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "39--39",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deLara:2000:PCBb,
author = "Eyal de Lara and Dan Wallach and Willy Zwaenepoel",
title = "{Puppeteer}: component-based adaptation for mobile
computing (poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "40--40",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lu:2000:FCRb,
author = "Chenyang Lu and John A. Stankovic and Tarek Abdelzaher
and Sang H. Son and Gang Tao",
title = "Feedback control real-time scheduling: support for
performance guarantees in unpredictable environments
(poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "40--40",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shinjo:2000:DCEb,
author = "Yasushi Shinjo",
title = "Developing correct and efficient multithreaded
programs with thread-specific data and a partial
evaluator",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "40--40",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yu:2000:TTAb,
author = "Haifeng Yu",
title = "{TACT}: tunable availability and consistency tradeoffs
for replicated {Internet} services (poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "40--40",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brown:2000:TBMb,
author = "Aaron Brown",
title = "Towards benchmarks for maintainability, availability
and growth\slash evolution({MAGE})",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "41--41",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheriton:2000:Tb,
author = "David Cheriton",
title = "{TRIAD}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "41--41",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Halvorsen:2000:NLFb,
author = "P{\aa}l Halvorsen",
title = "Network level farming: speeding up a multimedia
storage server",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "41--41",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ryutov:2000:RESb,
author = "Tatyana Ryutov and Clifford Neuman",
title = "Representation and evaluation of security policies
(poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "41--41",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ling:2000:AOT,
author = "Yibei Ling and Tracy Mullen and Xiaola Lin",
title = "Analysis of optimal thread pool size",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "42--55",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lacoste:2000:TSP,
author = "Marc Lacoste",
title = "Towards a secure platform for distributed mobile
object computing",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "56--73",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lu:2000:SSN,
author = "Sanglu Lu and Li Xie",
title = "Scalable scheduling on a network of workstations",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "74--83",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ximing:2000:RIC,
author = "Chen Ximing and Lu Xianliang",
title = "Runtime incremental concentrated scheduling on
{NOW(NRICS)}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "84--96",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Trono:2000:FCC,
author = "John A. Trono and William E. Taylor",
title = "Further comments on {\em ``A Correct and Unrestrictive
Implementation of General Semaphores''}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "5--10",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See
\cite{Hemmendinger:1988:CIG,Kearns:1988:CUI,Hemmendinger:1989:CCU}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xu:2000:TS,
author = "Baowen Xu",
title = "Tagged semaphores",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "11--15",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See comments \cite{Trono:2000:CTS}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pei:2000:SKC,
author = "Pengjun Pei and Guohua Cui and Kun Peng",
title = "On a session key compromise problem in {[KC95]}
protocol",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "16--18",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sun:2000:AFA,
author = "Yongxing Sun and Xinmei Wang",
title = "An approach to finding the attacks on the
cryptographic protocols",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "19--28",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ji:2000:SOI,
author = "Li Ji and Li Tianning and Chen Guihai and Xie Li and
C. L. Wang",
title = "Strategies optimization and integration in {DSM}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "29--39",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Iskra:2000:IDE,
author = "K. A. Iskra and F. van der Linden and Z. W. Hendrikse
and B. J. Overeinder and G. D. van Albada and
P. M. A. Sloot",
title = "The implementation of dynamite: an environment for
migrating {PVM} tasks",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "40--55",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mitchell:2000:MSN,
author = "Chris J. Mitchell",
title = "Making serial number based authentication robust
against loss of state",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "56--59",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bouabdallah:2000:DTB,
author = "A. Bouabdallah and C. Laforest",
title = "A distributed token-based algorithm for the dynamic
resource allocation problem",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "60--68",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Creak:2000:TOS,
author = "G. Alan Creak and Robert Sheehan",
title = "A top-down operating systems course",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "69--80",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Trono:2000:CTS,
author = "John A. Trono",
title = "Comments on {\em ``Tagged semaphores''}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "7--11",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Xu:2000:TS}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2000:TPE,
author = "Chun-Li Lin and Hung-Min Sun and Tzonelih Hwang",
title = "Three-party encrypted key exchange: attacks and a
solution",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "12--20",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Beder:2000:AFT,
author = "D. M. Beder and A. Romanovsky and B. Randell and C. R.
Snow and R. J. Stroud",
title = "An application of fault tolerance patterns and
coordinated atomic actions to a problem in railway
scheduling",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "21--31",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Satyanarayanan:2000:CTR,
author = "M. Satyanarayanan",
title = "Caching trust rather than content",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "32--33",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sierra:2000:NPE,
author = "J. M. Sierra and S. J. Shepherd",
title = "New phase 1 exchange mode for {IKE} framework",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "34--40",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ballintijn:2000:CIP,
author = "Gerco Ballintijn and Maarten van Steen",
title = "Characterizing {Internet} performance to support
wide-area application development",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "41--47",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sonntag:2000:MAS,
author = "Michael Sonntag and Rudolf H{\"o}rmanseder",
title = "Mobile agent security based on payment",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "48--55",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Duchien:2000:POR,
author = "Laurence Duchien and G{\'e}rard Florin and Lionel
Seinturier",
title = "Partial order relations in distributed object
environments",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "56--75",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bal:2000:DAS,
author = "Henri Bal and Raoul Bhoedjang and Rutger Hofman and
Ceriel Jacobs and Thilo Kielmann and Jason Maassen and
Rob van Nieuwpoort and John Romein and Luc Renambot and
Tim R{\"u}hl and Ronald Veldema and Kees Verstoep and
Aline Baggio and Gerco Ballintijn and Ihor Kuz and
Guillaume Pierre and Maarten van Steen and Andy
Tanenbaum and Gerben Doornbos and Desmond Germans and
Hans Spoelder and Evert-Jan Baerends and Stan van
Gisbergen and Hamideh Afsermanesh and Dick van Albada
and Adam Belloum and David Dubbeldam and Zeger
Hendrikse and Bob Hertzberger and Alfons Hoekstra and
Kamil Iskra and Drona Kandhai and Dennis Koelma and
Frank van der Linden and Benno Overeinder and Peter
Sloot and Piero Spinnato and Dick Epema and Arjan van
Gemund and Pieter Jonker and Andrei Radulescu and Cees
van Reeuwijk and Henk Sips and Peter Knijnenburg and
Michael Lew and Floris Sluiter and Lex Wolters and Hans
Blom and Cees de Laat and Aad van der Steen",
title = "The distributed {ASCI Supercomputer} project",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "76--96",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schlosser:2000:DCS,
author = "Steven W. Schlosser and John Linwood Griffin and David
F. Nagle and Gregory R. Ganger",
title = "Designing computer systems with {MEMS}-based storage",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "1--12",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gharachorloo:2000:ADA,
author = "Kourosh Gharachorloo and Madhu Sharma and Simon Steely
and Stephen {Van Doren}",
title = "Architecture and design of {AlphaServer GS320}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "13--24",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Martin:2000:TSA,
author = "Milo M. K. Martin and Daniel J. Sorin and Anatassia
Ailamaki and Alaa R. Alameldeen and Ross M. Dickson and
Carl J. Mauer and Kevin E. Moore and Manoj Plakal and
Mark D. Hill and David A. Wood",
title = "Timestamp snooping: an approach for extending {SMPs}",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "25--36",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nanda:2000:MPR,
author = "Ashwini Nanda and Kwok-Ken Mak and Krishnan Sugarvanam
and Ramendra K. Sahoo and Vijayaraghavan Soundarararjan
and T. Basil Smith",
title = "{MemorIES3}: a programmable, real-time hardware
emulation tool for multiprocessor server design",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "37--48",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gibson:2000:FVS,
author = "Jeff Gibson and Robert Kunz and David Ofelt and Mark
Horowitz and John Hennessy and Mark Heinrich",
title = "{FLASH} vs. (Simulated) {FLASH}: closing the
simulation loop",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "49--58",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chou:2000:UML,
author = "Andy Chou and Benjamin Chelf and Dawson Engler and
Mark Heinrich",
title = "Using meta-level compilation to check {FLASH} protocol
code",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "59--70",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bhoedjang:2000:EDA,
author = "Raoul A. F. Bhoedjang and Kees Verstoep and Tim
R{\"u}hl and Henri E. Bal and Rutger F. H. Hofman",
title = "Evaluating design alternatives for reliable
communication on high-speed networks",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "71--81",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mattson:2000:CS,
author = "Peter Mattson and William J. Dally and Scott Rixner
and Ujval J. Kapasi and John D. Owens",
title = "Communication scheduling",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "82--92",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hill:2000:SAD,
author = "Jason Hill and Robert Szewczyk and Alec Woo and Seth
Hollar and David Culler and Kristofer Pister",
title = "System architecture directions for networked sensors",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "93--104",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lebeck:2000:PAP,
author = "Alvin R. Lebeck and Xiaobo Fan and Heng Zeng and Carla
Ellis",
title = "Power aware page allocation",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "105--116",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Berger:2000:HSM,
author = "Emery D. Berger and Kathryn S. McKinley and Robert D.
Blumofe and Paul R. Wilson",
title = "{Hoard}: a scalable memory allocator for multithreaded
applications",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "117--128",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Flautner:2000:TLP,
author = "Kristi{\'a}n Flautner and Rich Uhlig and Steve
Reinhardt and Trevor Mudge",
title = "Thread-level parallelism and interactive performance
of desktop applications",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "129--138",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kawahito:2000:ENP,
author = "Motohiro Kawahito and Hideaki Komatsu and Toshio
Nakatani",
title = "Effective null pointer check elimination utilizing
hardware trap",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "139--149",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2000:FVL,
author = "Youtao Zhang and Jun Yang and Rajiv Gupta",
title = "Frequent value locality and value-centric data cache
design",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "150--159",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Burrows:2000:EFV,
author = "M. Burrows and U. Erlingson and S-T. A. Leung and M.
T. Vandevoorde and C. A. Waldspurger and K. Walker and
W. E. Weihl",
title = "Efficient and flexible value sampling",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "160--167",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Thekkath:2000:ASC,
author = "David Lie Chandramohan Thekkath and Mark Mitchell and
Patrick Lincoln and Dan Boneh and John Mitchell and
Mark Horowitz",
title = "Architectural support for copy and tamper resistant
software",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "168--177",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Burke:2000:ASF,
author = "Jerome Burke and John McDonald and Todd Austin",
title = "Architectural support for fast symmetric-key
cryptography",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "178--189",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kubiatowicz:2000:OAG,
author = "John Kubiatowicz and David Bindel and Yan Chen and
Steven Czerwinski and Patrick Eaton and Dennis Geels
and Ramakrishna Gummadi and Sean Rhea and Hakim
Weatherspoon and Chris Wells and Ben Zhao",
title = "{OceanStore}: an architecture for global-scale
persistent storage",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "190--201",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Duesterwald:2000:SPH,
author = "Evelyn Duesterwald and Vasanth Bala",
title = "Software profiling for hot path prediction: less is
more",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "202--211",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zahir:2000:CCD,
author = "Rumi Zahir and Jonathan Ross and Dale Morris and Drew
Hess",
title = "{OS} and compiler considerations in the design of the
{IA-64} architecture",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "212--221",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Connors:2000:HSD,
author = "Daniel A. Connors and Hillery C. Hunter and Ben-Chung
Cheng and Wen-mei W. Hwu",
title = "Hardware support for dynamic activation of
compiler-directed computation reuse",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "222--233",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Snavely:2000:SJS,
author = "Allan Snavely and Dean M. Tullsen",
title = "Symbiotic jobscheduling for a simultaneous
multithreaded processor",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "234--244",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Redstone:2000:AOS,
author = "Joshua A. Redstone and Susan J. Eggers and Henry M.
Levy",
title = "An analysis of operating system behavior on a
simultaneous multithreaded architecture",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "245--256",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sundaramoorthy:2000:SPI,
author = "Karthik Sundaramoorthy and Zach Purser and Eric
Rotenburg",
title = "Slipstream processors: improving both performance and
fault tolerance",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "257--268",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ji:2001:CAF,
author = "Dongyao Ji and Yuming Wang",
title = "Comments on {{\em ``An approach to the formal
verification of the two-party cryptographic
protocols''\/} by Zhang, Li and Xiao}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "6--7",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Zhang:1999:AFV}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haddon:2001:ISS,
author = "Bruce K. Haddon",
title = "{IEEE} storage system standards",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "8--16",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhu:2001:PCO,
author = "Ming-Yuan Zhu and Lei Luo and Guang-Zhe Xiong",
title = "A provably correct operating system: $\delta$-core",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "17--33",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ram:2001:CCM,
author = "D. Janaki Ram and M. Uma Mahesh and N. S. K. Chandra
Sekhar and Chitra Babu",
title = "Causal consistency in mobile environment",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "34--40",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2001:EPD,
author = "Chun-Li Lin and Hung-Min Sun and Tzonelih Hwang",
title = "Efficient and practical {DHEKE} protocols",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "41--47",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bovet:2001:RBO,
author = "Daniel P. Bovet and Marco Cesati",
title = "A real bottom-up operating systems course",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "48--60",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rao:2001:PBP,
author = "Herman Chung-Hwa Rao and Yih-Farn Chen and Ming-Feng
Chen",
title = "A proxy-based personal {Web} archiving service",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "61--72",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Montresor:2001:MDN,
author = "Alberto Montresor and Renzo Davoli and {\"O}zalp
Babao{\u{g}}lu",
title = "Middleware for dependable network services in
partitionable distributed systems",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "73--96",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herlihy:2001:OMD,
author = "Maurice Herlihy and Srikanta Tirthapura and Roger
Wattenhofer",
title = "Ordered {Multicast} and {Distributed Swap}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "85--96",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eisenhauer:2001:MTC,
author = "Greg Eisenhauer and Fabi{\'a}n E. Bustamante and
Karsten Schwan",
title = "A middleware toolkit for client-initiated service
specialization",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "7--20",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Al-Theneyan:2001:EJU,
author = "Ahmed Al-Theneyan and Piyush Mehrotra and Mohammed
Zubair",
title = "Enhancing {Jini} for use across non-multicastable
networks",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "21--30",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Litiu:2001:DMC,
author = "Radu Litiu and Atul Prakash",
title = "{DACIA}: a mobile component framework for building
adaptive distributed applications",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "31--42",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2001:USC,
author = "Yuqing Zhang and Chunling Wang and Jianping Wu and
Xing Li",
title = "Using {SMV} for cryptographic protocol analysis: a
case study",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "43--50",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Huang:2001:VBC,
author = "Z. Huang and C. Sun and M. Purvis and S. Cranefield",
title = "View-based consistency and false sharing effect in
distributed shared memory",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "51--60",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vakali:2001:MDS,
author = "Athena Vakali and Evimaria Terzi",
title = "Multimedia data storage and representation issues on
tertiary storage subsystems: an overview",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "61--77",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2001:TCR,
author = "Youhui Zhang and Dongsheng Wang and Weimin Zheng",
title = "Transparent checkpointing and rollback recovery
mechanism for {Windows NT} applications",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "78--85",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bozyigit:2001:ULP,
author = "M. Bozyigit and M. Wasiq",
title = "User-level process checkpoint and restore for
migration",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "86--96",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See comment \cite{Rauch:2002:CTU}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Crampton:2001:AA,
author = "Jason Crampton and George Loizou",
title = "Authorisation and antichains",
journal = j-OPER-SYS-REV,
volume = "35",
number = "3",
pages = "6--15",
month = jul,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shriram:2001:IMP,
author = "Alok Shriram and Anuraag Sarangi and Avinash S.",
title = "{ICHU} model for processor allocation in distributed
operating systems",
journal = j-OPER-SYS-REV,
volume = "35",
number = "3",
pages = "16--21",
month = jul,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhu:2001:MMO,
author = "Ming-Yuan Zhu and Lei Luo and Guang-Ze Xiong",
title = "The minimal model of operating systems",
journal = j-OPER-SYS-REV,
volume = "35",
number = "3",
pages = "22--29",
month = jul,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2001:CNP,
author = "Bu-Sung Lee and Wen-Tong Cai and Stephen J. Turner and
Jit-Beng Koh",
title = "Comparison of network protocol and architecture for
distributed virtual simulation environment",
journal = j-OPER-SYS-REV,
volume = "35",
number = "3",
pages = "30--42",
month = jul,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gupta:2001:DBA,
author = "Vijay Gupta",
title = "A distributed backoff algorithm to support real-time
traffic on {Ethernet}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "3",
pages = "43--66",
month = jul,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gupta:2001:RFR,
author = "B. Gupta and S. K. Banerjee",
title = "A {Roll-Forward Recovery Scheme} for {Solving} the
{Problem} of {Coasting Forward} for {Distributed
Systems}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "3",
pages = "55--66",
month = jul,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wen:2001:RNS,
author = "Jun Wen and Xiang-liang Lu",
title = "Realize network subsystem {QoS} guarantee",
journal = j-OPER-SYS-REV,
volume = "35",
number = "3",
pages = "67--71",
month = jul,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saunders:2001:RBA,
author = "G. Saunders and M. Hitchens and V. Varadharajan",
title = "Role-based access control and the access control
matrix",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "6--20",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oestreicher:2001:ECJ,
author = "Dan Oestreicher",
title = "Experience with a commercial {Java} implementation of
group communication using reliable multicast",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "21--31",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Park:2001:SEK,
author = "Chang-Seop Park and Dong-Hoon Lee",
title = "Secure and efficient key management for dynamic
multicast groups",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "32--38",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2001:CNI,
author = "Yuhong Li and Lars Wolf",
title = "Collection of network information in active networks",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "39--49",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dovrolis:2001:HHI,
author = "Constantinos Dovrolis and Brad Thayer and Parameswaran
Ramanathan",
title = "{HIP}: hybrid interrupt-polling for the network
interface",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "50--60",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Suranauwarat:2001:DII,
author = "Sukanya Suranauwarat and Hideo Taniguchi",
title = "The design, implementation and initial evaluation of
an advanced knowledge-based process scheduler",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "61--81",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Huang:2001:HRD,
author = "Tao Huang and Teng Xu and Xianliang Lu",
title = "A high resolution disk {I/O} trace system",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "82--87",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ludwig:2001:FSE,
author = "Stefan Ludwig and Winfried Kalfa",
title = "File system encryption with integrated user
management",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "88--93",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dawu:2001:TES,
author = "Gu Dawu and Wang Yi",
title = "On the techniques of enhancing the security of block
ciphers",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "94--96",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zdancewic:2001:UHC,
author = "Steve Zdancewic and Lantian Zheng and Nathaniel
Nystrom and Andrew C. Myers",
title = "Untrusted hosts and confidentiality: secure program
partitioning",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "1--14",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rodrigues:2001:BUA,
author = "Rodrigo Rodrigues and Miguel Castro and Barbara
Liskov",
title = "{BASE}: using abstraction to improve fault tolerance",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "15--28",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yu:2001:CLA,
author = "Haifeng Yu and Amin Vahdat",
title = "The costs and limits of availability for replicated
services",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "29--42",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Arpaci-Dusseau:2001:ICG,
author = "Andrea C. Arpaci-Dusseau and Remzi H.
Arpaci-Dusseau",
title = "Information and control in gray-box systems",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "43--56",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Engler:2001:BDB,
author = "Dawson Engler and David Yu Chen and Seth Hallem and
Andy Chou and Benjamin Chelf",
title = "Bugs as deviant behavior: a general approach to
inferring errors in systems code",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "57--72",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chou:2001:ESO,
author = "Andy Chou and Junfeng Yang and Benjamin Chelf and Seth
Hallem and Dawson Engler",
title = "An empirical study of operating systems errors",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "73--88",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pillai:2001:RTD,
author = "Padmanabhan Pillai and Kang G. Shin",
title = "Real-time dynamic voltage scaling for low-power
embedded operating systems",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "89--102",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chase:2001:MES,
author = "Jeffrey S. Chase and Darrell C. Anderson and Prachi N.
Thakar and Amin M. Vahdat and Ronald P. Doyle",
title = "Managing energy and server resources in hosting
centers",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "103--116",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Iyer:2001:ASD,
author = "Sitaram Iyer and Peter Druschel",
title = "Anticipatory scheduling: a disk scheduling framework
to overcome deceptive idleness in synchronous {I/O}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "117--130",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Andersen:2001:RON,
author = "David Andersen and Hari Balakrishnan and Frans
Kaashoek and Robert Morris",
title = "Resilient overlay networks",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "131--145",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heidemann:2001:BEW,
author = "John Heidemann and Fabio Silva and Chalermek
Intanagonwiwat and Ramesh Govindan and Deborah Estrin
and Deepak Ganesan",
title = "Building efficient wireless sensor networks with
low-level naming",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "146--159",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Snoeren:2001:MBC,
author = "Alex C. Snoeren and Kenneth Conley and David K.
Gifford",
title = "Mesh-based content routing using {XML}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "160--173",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muthitacharoen:2001:LBN,
author = "Athicha Muthitacharoen and Benjie Chen and David
Mazi{\`e}res",
title = "A low-bandwidth network file system",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "174--187",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rowstron:2001:SMC,
author = "Antony Rowstron and Peter Druschel",
title = "Storage management and caching in {PAST}, a
large-scale, persistent peer-to-peer storage utility",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "188--201",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dabek:2001:WAC,
author = "Frank Dabek and M. Frans Kaashoek and David Karger and
Robert Morris and Ion Stoica",
title = "Wide-area cooperative storage with {CFS}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "202--215",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spalink:2001:BRS,
author = "Tammo Spalink and Scott Karlin and Larry Peterson and
Yitzchak Gottlieb",
title = "Building a robust software-based router using network
processors",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "216--229",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Welsh:2001:SAW,
author = "Matt Welsh and David Culler and Eric Brewer",
title = "{SEDA}: an architecture for well-conditioned, scalable
{Internet} services",
journal = j-OPER-SYS-REV,
volume = "35",
number = "5",
pages = "230--243",
month = dec,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eichert:2002:CVA,
author = "Stuart Eichert and Osman N. Ertugay and Dan Nessett
and Suresh Vobbilisetty",
title = "Commercially viable active networking",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "8--22",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:2002:MSE,
author = "D. Patiyoot",
title = "Migration \slash evolution of security towards
wireless {ATM}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "23--30",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patiyoot:2002:SIW,
author = "Danai Patiyoot",
title = "Security issues for wireless {ATM} networks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "31--57",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wolthusen:2002:AUC,
author = "Stephen D. Wolthusen",
title = "Access and use control using externally controlled
reference monitors",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "58--69",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mao:2002:LRM,
author = "Yun Mao and Youhui Zhang and Dongsheng Wang and Weimin
Zheng",
title = "{LND}: a reliable multi-tier storage device in {NOW}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "70--80",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wen:2002:DQG,
author = "Jun Wen and Xianliang Lu",
title = "The design of {QoS} guarantee network subsystem",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "81--87",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{He:2002:FBC,
author = "Yanxiang He and Zhuomin Du and Xuhui Li and Donald H.
Cooley and Jing He",
title = "A field-based collaboration strategy in {MADCE}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "88--96",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barr:2002:NSL,
author = "Rimon Barr and John C. Bicket and Daniel S. Dantas and
Bowei Du and T. W. Danny Kim and Bing Zhou and Emin
G{\"u}n Sirer",
title = "On the need for system-level support for ad hoc and
sensor networks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "2",
pages = "1--5",
month = apr,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Borselius:2002:PAU,
author = "Niklas Borselius and Chris J. Mitchell and Aaron
Wilson",
title = "A pragmatic alternative to undetachable signatures",
journal = j-OPER-SYS-REV,
volume = "36",
number = "2",
pages = "6--11",
month = apr,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Youhui:2002:CBH,
author = "Zhang Youhui and Wang Dongsheng",
title = "A checkpoint-based high availability run-time system
for {Windows NT} clusters",
journal = j-OPER-SYS-REV,
volume = "36",
number = "2",
pages = "12--18",
month = apr,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waddington:2002:IPE,
author = "Daniel G. Waddington and Ramesh Viswanathan",
title = "Interaction points: exploiting operating system
mechanisms for inter-component communications",
journal = j-OPER-SYS-REV,
volume = "36",
number = "2",
pages = "19--35",
month = apr,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ong:2002:UVC,
author = "T. M. Ong and T. M. Lim and B. S. Lee and C. K. Yeo",
title = "{Unicorn}: voluntary computing over {Internet}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "2",
pages = "36--51",
month = apr,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peng:2002:MPC,
author = "Bi Peng and Xie Fei and Yang Guangwen and Wang
Dingxing",
title = "A multi-protocol cross-domain communication model for
metacomputing systems",
journal = j-OPER-SYS-REV,
volume = "36",
number = "2",
pages = "52--63",
month = apr,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rauch:2002:CTU,
author = "Felix Rauch and Thomas M. Stricker",
title = "Comments on {{\em ``Transparent User-Level Process
Checkpoint and Restore for Migration''} by Bozyigit and
Wasiq}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "8--9",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
note = "See \cite{Bozyigit:2001:ULP}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jun:2002:CAW,
author = "Lu Jun and Lu Xianliang and Han Hong and Wei
Qingsong",
title = "A cooperative asynchronous write mechanism for {NAS}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "25--32",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wada:2002:EDM,
author = "Yutaka Wada and Zixue Cheng",
title = "An efficient distributed method for allocating
resources based on an unobstructed squeezing
technique",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "33--45",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2002:FRU,
author = "Cheng-Chi Lee and Min-Shiang Hwang and Wei-Peng
Yang",
title = "A flexible remote user authentication scheme using
{Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "46--52",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kumar:2002:CSR,
author = "Arun Kumar and Neeran Karnik and Girish Chafle",
title = "Context sensitivity in role-based access control",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "53--66",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Amanton:2002:CCP,
author = "Laurent Amanton and Mohamed Na{\"\i}mi",
title = "The concept of {\em causal-phase\/} ordering for
overlapped broadcasts",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "67--81",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yeo:2002:PAU,
author = "C. K. Yeo and B. S. Lee and M. H. Er",
title = "A peering architecture for ubiquitous {IP} multicast
streaming",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "82--95",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Han:2002:DMA,
author = "Hong Han and Xian Liang Lu and Jun Lu and Chen Bo and
Ren Li Yong",
title = "Data mining aided signature discovery in network-based
intrusion detection system",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "7--13",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yeh:2002:SAK,
author = "Her-Tyan Yeh and Hung-Min Sun",
title = "Simple authenticated key agreement protocol resistant
to password guessing attacks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "14--22",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2002:RUA,
author = "Cheng-Chi Lee and Li-Hua Li and Min-Shiang Hwang",
title = "A remote user authentication scheme using hash
functions",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "23--29",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Borselius:2002:VTS,
author = "Niklas Borselius and Chris J. Mitchell and Aaron
Wilson",
title = "On the value of threshold signatures",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "30--35",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jin:2002:DPO,
author = "Chao Jin and Weimin Zheng and Feng Zhou and Yinghui
Wu",
title = "A distributed persistent object store for scalable
service",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "36--49",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jun:2002:SNF,
author = "Lu Jun and Lu Xianliang and Luo Guangchun and Han Hong
and Zhou Xu",
title = "{STFS}: a novel file system for efficient small
writes",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "50--54",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yao:2002:PNA,
author = "Nian-Min Yao and Ming-Yang Zheng and Jiu-Bin Ju",
title = "{Pipeline}: a new architecture of high performance
servers",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "55--64",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Estrin:2002:KAS,
author = "Deborah Estrin",
title = "Keynote address: {Sensor} network research: emerging
challenges for architecture, systems, and languages",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "1--4",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rajwar:2002:TLF,
author = "Ravi Rajwar and James R. Goodman",
title = "Transactional lock-free execution of lock-based
programs",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "5--17",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Martinez:2002:SSA,
author = "Jos{\'e} F. Mart{\'\i}nez and Josep Torrellas",
title = "Speculative synchronization: applying thread-level
speculation to explicitly parallel applications",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "18--29",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lepak:2002:TSS,
author = "Kevin M. Lepak and Mikko H. Lipasti",
title = "Temporally silent stores",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "30--41",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sherwood:2002:ACL,
author = "Timothy Sherwood and Erez Perelman and Greg Hamerly
and Brad Calder",
title = "Automatically characterizing large scale program
behavior",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "45--57",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ogata:2002:BFO,
author = "Kazunori Ogata and Hideaki Komatsu and Toshio
Nakatani",
title = "Bytecode fetch optimization for a {Java} interpreter",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "58--67",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2002:UIO,
author = "Tao Li and Lizy Kurian John and Anand Sivasubramaniam
and N. Vijaykrishnan and Juan Rubio",
title = "Understanding and improving operating system effects
in control flow prediction",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "68--80",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levis:2002:MTV,
author = "Philip Levis and David Culler",
title = "{Mat{\'e}}: a tiny virtual machine for sensor
networks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "85--95",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Juang:2002:EEC,
author = "Philo Juang and Hidekazu Oki and Yong Wang and
Margaret Martonosi and Li Shiuan Peh and Daniel
Rubenstein",
title = "Energy-efficient computing for wildlife tracking:
design tradeoffs and early experiences with
{ZebraNet}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "96--107",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kirovski:2002:ETS,
author = "Darko Kirovski and Milenko Drini{\'c} and Miodrag
Potkonjak",
title = "Enabling trusted software integrity",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "108--120",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zeng:2002:EME,
author = "Heng Zeng and Carla S. Ellis and Alvin R. Lebeck and
Amin Vahdat",
title = "{ECOSystem}: managing energy as a first class
operating system resource",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "123--132",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ashok:2002:CMC,
author = "Raksit Ashok and Saurabh Chheda and Csaba Andras
Moritz",
title = "Cool-Mem: combining statically speculative memory
accessing with selective address translation for energy
efficiency",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "133--143",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sasanka:2002:JLG,
author = "Ruchira Sasanka and Christopher J. Hughes and Sarita
V. Adve",
title = "Joint local and global hardware adaptations for
energy",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "144--155",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2002:DEC,
author = "Dongkeun Kim and Donald Yeung",
title = "Design and evaluation of compiler algorithms for
pre-execution",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "159--170",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhai:2002:COS,
author = "Antonia Zhai and Christopher B. Colohan and J. Gregory
Steffan and Todd C. Mowry",
title = "Compiler optimization of scalar value communication
between speculative threads",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "171--183",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oplinger:2002:ESR,
author = "Jeffrey Oplinger and Monica S. Lam",
title = "Enhancing software reliability with speculative
threads",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "184--196",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Butts:2002:DDI,
author = "J. Adam Butts and Guri Sohi",
title = "Dynamic dead-instruction detection and elimination",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "199--210",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2002:ANU,
author = "Changkyu Kim and Doug Burger and Stephen W. Keckler",
title = "An adaptive, non-uniform cache structure for
wire-delay dominated on-chip caches",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "211--222",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mukherjee:2002:CSA,
author = "Shubhendu S. Mukherjee and Federico Silla and Peter
Bannon and Joel Emer and Steve Lang and David Webb",
title = "A comparative study of arbitration algorithms for the
{Alpha 21364} pipelined router",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "223--234",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2002:IWS,
author = "Hyong-youb Kim and Vijay S. Pai and Scott Rixner",
title = "Increasing {Web} server throughput with network
interface data caching",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "239--250",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kohler:2002:PLO,
author = "Eddie Kohler and Robert Morris and Benjie Chen",
title = "Programming language optimizations for modular router
configurations",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "251--263",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sivathanu:2002:ERA,
author = "Muthian Sivathanu and Andrea C. Arpaci-Dusseau and
Remzi H. Arpaci-Dusseau",
title = "Evolving {RPC} for active storage",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "264--276",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cooksey:2002:SCD,
author = "Robert Cooksey and Stephan Jourdan and Dirk
Grunwald",
title = "A stateless, content-directed data prefetching
mechanism",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "279--290",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gordon:2002:SCC,
author = "Michael I. Gordon and William Thies and Michal
Karczmarek and Jasper Lin and Ali S. Meli and Andrew
A. Lamb and Chris Leger and Jeremy Wong and Henry
Hoffmann and David Maze and Saman Amarasinghe",
title = "A stream compiler for communication-exposed
architectures",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "291--303",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Witchel:2002:MMP,
author = "Emmett Witchel and Josh Cates and Krste
Asanovi{\'c}",
title = "{Mondrian} memory protection",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5",
pages = "304--316",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Adya:2002:FFA,
author = "Atul Adya and William J. Bolosky and Miguel Castro and
Gerald Cermak and Ronnie Chaiken and John R. Douceur
and Jon Howell and Jacob R. Lorch and Marvin Theimer
and Roger P. Wattenhofer",
title = "{Farsite}: federated, available, and reliable storage
for an incompletely trusted environment",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "1--14",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saito:2002:TAR,
author = "Yasushi Saito and Christos Karamanolis and Magnus
Karlsson and Mallik Mahalingam",
title = "Taming aggressive replication in the {Pangaea}
wide-area file system",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "15--30",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muthitacharoen:2002:IRW,
author = "Athicha Muthitacharoen and Robert Morris and Thomer M.
Gil and Benjie Chen",
title = "{Ivy}: a read\slash write peer-to-peer file system",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "31--44",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Qie:2002:DPU,
author = "Xiaohu Qie and Ruoming Pang and Larry Peterson",
title = "Defensive programming: using an annotation toolkit to
build {DoS}-resistant software",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "45--60",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kumar:2002:UMC,
author = "Sanjeev Kumar and Kai Li",
title = "Using model checking to debug device firmware",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "61--74",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Musuvathi:2002:CPA,
author = "Madanlal Musuvathi and David Y. W. Park and Andy Chou
and Dawson R. Engler and David L. Dill",
title = "{CMC}: a pragmatic approach to model checking real
code",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "75--88",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Navarro:2002:PTO,
author = "Juan Navarro and Sitararn Iyer and Peter Druschel and
Alan Cox",
title = "Practical, transparent operating system support for
superpages",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "89--104",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Flautner:2002:VAP,
author = "Kriszti{\'a}n Flautner and Trevor Mudge",
title = "{Vertigo}: automatic performance-setting for {Linux}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "105--116",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weissel:2002:CNS,
author = "Andreas Weissel and Bj{\"o}rn Beutel and Frank
Bellosa",
title = "Cooperative {I/O}: a novel {I/O} semantics for
energy-aware applications",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "117--129",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Madden:2002:TTA,
author = "Samuel Madden and Michael J. Franklin and Joseph M.
Hellerstein and Wei Hong",
title = "{TAG}: a {Tiny AGgregation} service for ad-hoc sensor
networks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "131--146",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Elson:2002:FGN,
author = "Jeremy Elson and Lewis Girod and Deborah Estrin",
title = "Fine-grained network time synchronization using
reference broadcasts",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "147--163",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Goel:2002:STS,
author = "Ashvin Goel and Luca Abeni and Charles Krasic and Jim
Snow and Jonathan Walpole",
title = "Supporting time-sensitive applications on a commodity
{OS}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "165--180",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Waldspurger:2002:MRM,
author = "Carl A. Waldspurger",
title = "Memory resource management in {VMware ESX} server",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "181--194",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Whitaker:2002:SPD,
author = "Andrew Whitaker and Marianne Shaw and Steven D.
Gribble",
title = "Scale and performance in the {Denali} isolation
kernel",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "195--209",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dunlap:2002:REI,
author = "George W. Dunlap and Samuel T. King and Sukru Cinar
and Murtaza A. Basrai and Peter M. Chen",
title = "{ReVirt}: enabling intrusion analysis through
virtual-machine logging and replay",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "211--224",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shen:2002:IRM,
author = "Kai Shen and Hong Tang and Tao Yang and Lingkun Chu",
title = "Integrated resource management for cluster-based
{Internet} services",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "225--238",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Urgaonkar:2002:ROA,
author = "Bhuvan Urgaonkar and Prashant Shenoy and Timothy
Roscoe",
title = "Resource overbooking and application profiling in
shared hosting platforms",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "239--254",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{White:2002:IEE,
author = "Brian White and Jay Lepreau and Leigh Stoller and
Robert Ricci and Shashi Guruprasad and Mac Newbold and
Mike Hibler and Chad Barb and Abhijeet Joglekar",
title = "An integrated experimental environment for distributed
systems and networks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "255--270",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vahdat:2002:SAL,
author = "Amin Vahdat and Ken Yocum and Kevin Walsh and Priya
Mahadevan and Dejan Kosti{\'c} and Jeff Chase and David
Becker",
title = "Scalability and accuracy in a large-scale network
emulator",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "271--284",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cox:2002:PMB,
author = "Landon P. Cox and Christopher D. Murray and Brian D.
Noble",
title = "{Pastiche}: making backup cheap and easy",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "285--298",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Castro:2002:SRS,
author = "Miguel Castro and Peter Druschel and Ayalvadi Ganesh
and Antony Rowstron and Dan S. Wallach",
title = "Secure routing for structured peer-to-peer overlay
networks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "299--314",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saroiu:2002:AIC,
author = "Stefan Saroiu and Krishna P. Gummadi and Richard J.
Dunn and Steven D. Gribble and Henry M. Levy",
title = "An analysis of {Internet} content delivery systems",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "315--327",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Venkataramani:2002:TNM,
author = "Arun Venkataramani and Ravi Kokku and Mike Dahlin",
title = "{TCP Nice}: a mechanism for background transfers",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "329--343",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2002:ERR,
author = "Limin Wang and Vivek Pai and Larry Peterson",
title = "The effectiveness of request redirection on {CDN}
robustness",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "345--360",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Osman:2002:DIZ,
author = "Steven Osman and Dinesh Subhraveti and Gong Su and
Jason Nieh",
title = "The design and implementation of {Zap}: a system for
migrating computing environments",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "361--376",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sapuntzakis:2002:OMV,
author = "Constantine P. Sapuntzakis and Ramesh Chandra and Ben
Pfaff and Jim Chow and Monica S. Lam and Mendel
Rosenblum",
title = "Optimizing the migration of virtual computers",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "377--390",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hawblitzel:2002:LFJ,
author = "Chris Hawblitzel and Thorsten von Eicken",
title = "{Luna}: a flexible {Java} protection system",
journal = j-OPER-SYS-REV,
volume = "36",
number = "5S",
pages = "391--403",
month = dec,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 12:49:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guangchun:2003:ABL,
author = "Luo Guangchun and Zhang Jun and Lu Xianliang and Lu
Jun",
title = "Active block layout: a high performance disk layout
mechanism",
journal = j-OPER-SYS-REV,
volume = "37",
number = "1",
pages = "5--13",
month = jan,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liu:2003:ODS,
author = "Jing Liu and Mingyang Zheng and Jiubin Ju",
title = "Offering different services by server clusters",
journal = j-OPER-SYS-REV,
volume = "37",
number = "1",
pages = "14--22",
month = jan,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2003:ULC,
author = "Youhui Zhang and Weimin Zheng",
title = "User-level communication based cooperative caching",
journal = j-OPER-SYS-REV,
volume = "37",
number = "1",
pages = "23--33",
month = jan,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pascal:2003:PID,
author = "Patricia Pascal and Thierry Monteil",
title = "{PAPER}: influence of deterministic customers in time
sharing scheduler",
journal = j-OPER-SYS-REV,
volume = "37",
number = "1",
pages = "34--45",
month = jan,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guangchun:2003:MND,
author = "Luo Guangchun and Lu Xianliang and Li Jiong and Zhang
Jun",
title = "{MADIDS}: a novel distributed {IDS} based on mobile
agent",
journal = j-OPER-SYS-REV,
volume = "37",
number = "1",
pages = "46--53",
month = jan,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levine:2003:DD,
author = "Gertrude Neuman Levine",
title = "Defining deadlock",
journal = j-OPER-SYS-REV,
volume = "37",
number = "1",
pages = "54--64",
month = jan,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2003:SEOa,
author = "Chih-Wei Lin and Jau-Ji Shen and Min-Shiang Hwang",
title = "Security enhancement for {Optimal Strong-Password
Authentication} protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "7--12",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2003:PSAa,
author = "Sung-Woon Lee and Woo-Hun Kim and Hyun-Sung Kim and
Kee-Young Yoo",
title = "Parallizable simple authenticated key agreement
protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "13--18",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wei:2003:DND,
author = "Qingsong Wei and Xianliang Lu and Xu Zhou",
title = "{DFTS}: a novel distributed high fault-tolerance
storage mechanism",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "19--24",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guangchun:2003:HNC,
author = "Luo Guangchun and Zhang Jun and Lu Xianliang and Lu
Jun",
title = "{HCCM}: a novel cache consistence mechanism",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "25--36",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yang:2003:TER,
author = "Kun Yang and Xin Guo and Alex Galis and Bo Yang and
Dayou Liu",
title = "Towards efficient resource on-demand in {Grid
Computing}",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "37--43",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pinilla:2003:JPI,
author = "Ruben Pinilla and Marisa Gil",
title = "{JVM}: platform independent vs. performance
dependent",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "44--56",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levine:2003:DDF,
author = "Gertrude Neuman Levine",
title = "Defining deadlock with fungible resources",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "5--11",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2003:SEOb,
author = "Chih-Wei Lin and Jau-Ji Shen and Min-Shiang Hwang",
title = "Security enhancement for {Optimal Strong-Password
Authentication Protocol}",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "12--16",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2003:PSAb,
author = "Sung-Woon Lee and Woo-Hun Kim and Hyun-Sung Kim and
Kee-Young Yoo",
title = "Parallizable simple authenticated key agreement
protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "17--22",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Luo:2003:PBO,
author = "Lei Luo and Ming-Yuan Zhu",
title = "Partitioning based operating system: a formal model",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "23--35",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tse:2003:RAO,
author = "K. W. Tse and W. K. Lam and P. K. Lun",
title = "Reservation aware operating system for grid economy",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "36--42",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2003:ACP,
author = "S. C. Wang and K. Q. Yan and C. F. Cheng",
title = "Asynchronous consensus protocol for the unreliable
un-fully connected network",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "43--54",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wei:2003:NDQ,
author = "Qingsong Wei and Xianliang Lu and Liyong Ren and Xu
Zhou",
title = "A novel disk queue to reduce disk {I/O} of messaging
system",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "55--60",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rippert:2003:PFO,
author = "Christophe Rippert",
title = "Protection in flexible operating system
architectures",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "8--18",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ku:2003:WLL,
author = "Wei-Chi Ku and Chien-Ming Chen and Hui-Lung Lee",
title = "Weaknesses of {Lee--Li--Hwang}'s hash-based password
authentication scheme",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "19--25",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ku:2003:TSA,
author = "Wei-Chi Ku and Hao-Chuan Tsai and Shuai-Min Chen",
title = "Two simple attacks on {Lin--Shen--Hwang}'s
strong-password authentication protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "26--31",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2003:IBP,
author = "Hyun-Sung Kim and Sung-Woon Lee and Kee-Young Yoo",
title = "{ID}-based password authentication scheme using smart
cards and fingerprints",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "32--41",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hwang:2003:ASM,
author = "Min-Shiang Hwang and Chao-Chen Yang and Cheng-Yeh
Shiu",
title = "An authentication scheme for mobile satellite
communication systems",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "42--47",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pinilla:2003:UJT,
author = "Ruben Pinilla and Marisa Gil",
title = "{ULT}: a {Java} threads model for platform independent
execution",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "48--62",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liyong:2003:NPP,
author = "Ren Liyong and Chen Bo and Wu Jing",
title = "A novel packet-pair-based inferring bandwidth
congestion control mechanism for layered multicast",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "63--69",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2003:RAU,
author = "S. C. Wang and K. Q. Yan and C. F. Cheng",
title = "Reaching agreement on an unknown network with partial
graphic information",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "70--89",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baquero:2003:TPP,
author = "Carlos Baquero and Nuno Lopes",
title = "Towards peer-to-peer content indexing",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "90--96",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kuhnhauser:2004:RKO,
author = "Winfried E. K{\"u}hnhauser",
title = "Root {Kits}: an operating systems viewpoint",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "12--23",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2004:CUA,
author = "Sung-Woon Lee and Hyun-Sung Kim and Kee-Young Yoo",
title = "Cryptanalysis of a user authentication scheme using
hash functions",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "24--28",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ku:2004:HBS,
author = "Wei-Chi Ku",
title = "A hash-based strong-password authentication scheme
without using {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "29--34",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2004:AFV,
author = "Yuqing Zhang and Xiuying Liu",
title = "An approach to the formal verification of the
three-principal cryptographic protocols",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "35--42",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2004:SCB,
author = "Bu-Sung Lee and Wing-Keong Woo and Chai-Kiat Yeo and
Teck-Meng Lim and Bee-Hwa Lim and Yuxiong He and Jie
Song",
title = "Secure communications between bandwidth brokers",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "43--57",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gupta:2004:DDD,
author = "B. Gupta and Z. Liu and Z. Liang",
title = "On designing direct dependency: based fast recovery
algorithms for distributed systems",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "58--73",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Benchaiba:2004:DME,
author = "M. Bencha{\"\i}ba and A. Bouabdallah and N. Badache
and M. Ahmed-Nacer",
title = "Distributed mutual exclusion algorithms in mobile ad
hoc networks: an overview",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "74--89",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wei:2004:RDS,
author = "Qingsong Wei and Bo Chen and Xianliang Lu and Liyong
Ren and Xu Zhou",
title = "The research of the distributed stripped storage
spatial model",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "90--96",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Matthews:2004:CRR,
author = "Jeanna Neefe Matthews",
title = "The case for repeated research in operating systems",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "5--7",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tsegaye:2004:CLW,
author = "Melekam Tsegaye and Richard Foss",
title = "A comparison of the {Linux} and {Windows} device
driver architectures",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "8--33",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2004:RMA,
author = "Yuqing Zhang and Xiuying Liu",
title = "Running-mode analysis of the {Security Socket Layer}
protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "34--40",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2004:RFD,
author = "S. C. Wang and K. Q. Yan",
title = "Revisiting fault diagnosis agreement in a new
territory",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "41--61",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yoon:2004:SUA,
author = "Eun-Jun Yoon and Eun-Kyung Ryu and Kee-Young Yoo",
title = "A secure user authentication scheme using hash
functions",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "62--68",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2004:SSP,
author = "Jung-Seuk Lee and Jun-Cheol Jeon and Kee-Young Yoo",
title = "A security scheme for protecting security policies in
firewall",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "69--72",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Scott:2004:CIB,
author = "Michael Scott",
title = "Cryptanalysis of an {ID}-based password authentication
scheme using {Smart Cards} and fingerprints",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "73--75",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2004:SOT,
author = "Min-Hui Lin and Chin-Chen Chang",
title = "A secure one-time password authentication scheme with
low-computation for mobile communications",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "76--84",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2004:IAK,
author = "Narn-Yih Lee and Chien-Nan Wu",
title = "Improved authentication key exchange protocol without
using one-way hash function",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "85--92",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2004:SAA,
author = "Cheng-Chi Lee and Min-Shiang Hwang and I-En Liao",
title = "A server assisted authentication protocol for
detecting error vectors",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "93--96",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Serral:2004:LNS,
author = "Ren{\'e} Serral and Marisa Gil",
title = "A {Linux} networking study",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "1--11",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ling:2004:MCF,
author = "Yibei Ling and Wai Chen",
title = "Measuring cache freshness by additive age",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "12--17",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xu:2004:DDC,
author = "Zhou Xu and Lu Xialiang and Hou Mengshu",
title = "{DCFS}: distributed cooperative fault-tolerance
storage mechanism",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "18--25",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{ZhouXu:2004:DDR,
author = "ZhouXu and Lu Xianliang and Hou Mengshu and Wu Jin",
title = "A dynamic distributed replica management mechanism
based on accessing frequency detecting",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "26--34",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:2004:IAM,
author = "Bi-Hui Chen",
title = "Improvement of authenticated multiple-key agreement
protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "35--41",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yan:2004:NAR,
author = "Kuo-Qin Yan and Shu-Ching Wang and Mao-Lun Chiang",
title = "New application of reliable agreement: underlying an
unsecured business environment",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "42--57",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2004:ICK,
author = "Tian-Fu Lee and Tzonelih Hwang",
title = "Improved conference key distribution protocol based on
a symmetric balanced incomplete block design",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "58--64",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2004:IDA,
author = "Ya-Fan Chang and Chin-Chen Chang and Chia-Lin Kao",
title = "An improvement on a deniable authentication protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "65--74",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hwang:2004:KAS,
author = "Min-Shiang Hwang and Li-Hua Li and Cheng-Chi Lee",
title = "A key authentication scheme with non-repudiation",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "75--78",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2004:SES,
author = "Ya-Fen Chang and Chin-Chen Chang",
title = "A secure and efficient strong-password authentication
protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "79--90",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yang:2004:ISE,
author = "Chou-Chen Yang and Ren-Ching Wang",
title = "An improvement of security enhancement for the
timestamp-based password authentication scheme using
{Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "91--96",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Leschke:2004:ASF,
author = "Tim Leschke",
title = "Achieving speed and flexibility by separating
management from protection: embracing the {Exokernel}
operating system",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "5--19",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bouillot:2004:CMD,
author = "Nicolas Bouillot and Eric Gressier-Soudan",
title = "Consistency models for distributed interactive
multimedia applications",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "20--32",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Geva:2004:CFI,
author = "Mordechai Geva and Yair Wiseman",
title = "A common framework for inter-process communication on
a cluster",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "33--44",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yuan-bo:2004:ITA,
author = "Guo Yuan-bo and Ma Jian-feng",
title = "An intrusion-tolerant authorization and authentication
scheme in distributed environments",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "45--51",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2004:IDM,
author = "Chin-Chen Chang and Iuon-Chang Lin",
title = "An improvement of delegated multisignature scheme with
document decomposition",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "52--57",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2004:CGS,
author = "Chin-Chen Chang and Yeu-Pong Lai",
title = "A convertible group signature scheme",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "58--65",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2004:CES,
author = "Li-Hua Li and Chi-Yu Liu and Min-Shiang Hwang",
title = "Cryptanalysis of an efficient secure group signature
scheme",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "66--69",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2004:CMK,
author = "Narn-Yih Lee and Ming-Feng Lee",
title = "Comments on multiparty key exchange scheme",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "70--73",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liaw:2004:SPA,
author = "Horng-Twu Liaw and Shiou-Wei Fan and Wei-Chen Wu",
title = "A simple password authentication using a polynomial",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "74--79",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2004:SOT,
author = "Ya-Fen Chang and Chin-Chen Chang and Jui-Yi Kuo",
title = "A secure one-time password authentication scheme using
{Smart Cards} without limiting login times",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "80--90",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2004:RFB,
author = "Chin-Chen Chang and Iuon-Chang Lin",
title = "Remarks on fingerprint-based remote user
authentication scheme using {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "91--96",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hammond:2004:PTC,
author = "Lance Hammond and Brian D. Carlstrom and Vicky Wong
and Ben Hertzberg and Mike Chen and Christos Kozyrakis
and Kunle Olukotun",
title = "Programming with transactional coherence and
consistency {(TCC)}",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "1--13",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Budiu:2004:SC,
author = "Mihai Budiu and Girish Venkataramani and Tiberiu
Chelcea and Seth Copen Goldstein",
title = "Spatial computation",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "14--26",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ekanayake:2004:ULP,
author = "Virantha Ekanayake and Clinton {Kelly IV} and Rajit
Manohar",
title = "An ultra low-power processor for sensor networks",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "27--36",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lumb:2004:DSD,
author = "Christopher R. Lumb and Richard Golding",
title = "{D-SPTF}: decentralized request distribution in
brick-based storage systems",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "37--47",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saito:2004:FBD,
author = "Yasushi Saito and Svend Fr{\o}lund and Alistair Veitch
and Arif Merchant and Susan Spence",
title = "{FAB}: building distributed enterprise disk arrays
from commodity components",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "48--58",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Denehy:2004:DSA,
author = "Timothy E. Denehy and John Bent and Florentina I.
Popovici and Andrea C. Arpaci-Dusseau and Remzi
H. Arpaci-Dusseau",
title = "Deconstructing storage arrays",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "59--71",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhuang:2004:HIE,
author = "Xiaotong Zhuang and Tao Zhang and Santosh Pande",
title = "{HIDE}: an infrastructure for efficiently protecting
information leakage on the address bus",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "72--84",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Suh:2004:SPE,
author = "G. Edward Suh and Jae W. Lee and David Zhang and
Srinivas Devadas",
title = "Secure program execution via dynamic information flow
tracking",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "85--96",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Huh:2004:CDM,
author = "Jaehyuk Huh and Jichuan Chang and Doug Burger and
Gurindar S. Sohi",
title = "Coherence decoupling: making use of incoherence",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "97--106",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Srinivasan:2004:CFP,
author = "Srikanth T. Srinivasan and Ravi Rajwar and Haitham
Akkary and Amit Gandhi and Mike Upton",
title = "Continual flow pipelines",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "107--119",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Desikan:2004:SSR,
author = "Rajagopalan Desikan and Simha Sethumadhavan and Doug
Burger and Stephen W. Keckler",
title = "Scalable selective re-execution for {EDGE}
architectures",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "120--132",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Regehr:2004:HSA,
author = "John Regehr and Alastair Reid",
title = "{HOIST}: a system for automatically deriving static
analyzers for embedded systems",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "133--143",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2004:HTV,
author = "Perry H. Wang and Jamison D. Collins and Hong Wang and
Dongkeun Kim and Bill Greene and Kai-Ming Chan and
Aamir B. Yunus and Terry Sych and Stephen F. Moore and
John P. Shen",
title = "Helper threads via virtual multithreading on an
experimental {Itanium-2} processor-based platform",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "144--155",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hauswirth:2004:LOM,
author = "Matthias Hauswirth and Trishul M. Chilimbi",
title = "Low-overhead memory leak detection using adaptive
statistical profiling",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "156--164",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shen:2004:LPP,
author = "Xipeng Shen and Yutao Zhong and Chen Ding",
title = "Locality phase prediction",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "165--176",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhou:2004:DTP,
author = "Pin Zhou and Vivek Pandey and Jagadeesan Sundaresan
and Anand Raghuraman and Yuanyuan Zhou and Sanjeev
Kumar",
title = "Dynamic tracking of page miss ratio curve for memory
management",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "177--188",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rabbah:2004:COP,
author = "Rodric M. Rabbah and Hariharan Sandanagobalane and
Mongkol Ekpanyapong and Weng-Fai Wong",
title = "Compiler orchestrated prefetching via speculation and
predication",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "189--198",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cher:2004:SPM,
author = "Chen-Yong Cher and Antony L. Hosking and T. N.
Vijaykumar",
title = "Software prefetching for mark-sweep garbage
collection: hardware analysis and software redesign",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "199--210",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lowell:2004:DVM,
author = "David E. Lowell and Yasushi Saito and Eileen J.
Samberg",
title = "Devirtualizable virtual machines enabling general,
single-node, online maintenance",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "211--223",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Smolens:2004:FBS,
author = "Jared C. Smolens and Brian T. Gold and Jangwoo Kim and
Babak Falsafi and James C. Hoe and Andreas G. Nowatzyk",
title = "{Fingerprinting}: bounding soft-error detection
latency and bandwidth",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "224--234",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bronevetsky:2004:ALC,
author = "Greg Bronevetsky and Daniel Marques and Keshav Pingali
and Peter Szwed and Martin Schulz",
title = "Application-level checkpointing for shared memory
programs",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "235--247",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wu:2004:FOM,
author = "Qiang Wu and Philo Juang and Margaret Martonosi and
Douglas W. Clark",
title = "Formal online methods for voltage\slash frequency
control in multiple clock domain microprocessors",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "248--259",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gomaa:2004:HRL,
author = "Mohamed Gomaa and Michael D. Powell and T. N.
Vijaykumar",
title = "Heat-and-run: leveraging {SMT} and {CMP} to manage
power density through the operating system",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "260--270",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2004:PDE,
author = "Xiaodong Li and Zhenmin Li and Francis David and Pin
Zhou and Yuanyuan Zhou and Sarita Adve and Sanjeev
Kumar",
title = "Performance directed energy management for main memory
and disks",
journal = j-OPER-SYS-REV,
volume = "38",
number = "5",
pages = "271--283",
month = dec,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chou:2005:XRR,
author = "Shihyu Chou and Eric Jui-Lin Lu and Yi-Hui Chen",
title = "{X-RDR}: a role-based delegation processor for
{Web}-based information systems",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "4--21",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Song:2005:SBP,
author = "Jia Song",
title = "Segment-based proxy caching for distributed
cooperative media content servers",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "22--33",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chuan:2005:LBN,
author = "Zhan Chuan and Lu Xianliang and Hou Mengshu and Zhou
Xu",
title = "A {LVQ}-based neural network anti-spam email
approach",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "34--39",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Das:2005:HKM,
author = "Manik Lal Das and Ashutosh Saxena and Ved P. Gulati
and Deepak B. Phatak",
title = "Hierarchical key management scheme using polynomial
interpolation",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "40--47",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2005:NMS,
author = "Ting-Yi Chang and Min-Shiang Hwang and Wei-Pang
Yang",
title = "A new multi-stage secret sharing scheme using one-way
function",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "48--55",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mengshu:2005:TMP,
author = "Hou Mengshu and Lu Xianliang and Zhou Xu and Zhan
Chuan",
title = "A trust model of {P2P} system based on confirmation
theory",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "56--62",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xu:2005:SBA,
author = "Zhou Xu and Lu Xianliang and Hou Mengshu and Zhan
Chuan",
title = "A speed-based adaptive dynamic parallel downloading
technique",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "63--69",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2005:EAP,
author = "Ya-Fen Chang and Chin-Chen Chang",
title = "An efficient authentication protocol for mobile
satellite communication systems",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "70--84",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ku:2005:WYR,
author = "Wei-Chi Ku and Min-Hung Chiang and Shen-Tien Chang",
title = "Weaknesses of {Yoon--Ryu--Yoo}'s hash-based password
authentication scheme",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "85--89",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ku:2005:CFR,
author = "Wei-Chi Ku and Shuai-Min Chen",
title = "Cryptanalysis of a flexible remote user authentication
scheme using {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "90--96",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dijkstra:2005:MRO,
author = "Edsger W. Dijkstra",
title = "My recollections of operating system design",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "4--40",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:2005:AMS,
author = "Cliff Jones and David Lomet and Alexander Romanovsky
and Gerhard Weikum and Alan Fekete and Marie-Claude
Gaudel and Henry F. Korth and Rogerio de Lemos and
Eliot Moss and Ravi Rajwar and Krithi Ramamritham and
Brian Randell and Luis Rodrigues",
title = "The atomic manifesto: a story in four quarks",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "41--46",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levine:2005:CDP,
author = "Gertrude Neuman Levine",
title = "The classification of deadlock prevention and
avoidance is erroneous",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "47--50",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Joshi:2005:MVO,
author = "Rushikesh K. Joshi and Subash Rajaa",
title = "Modeling {VP} operation: the {Diwali Festival
Problem}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "51--53",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gil:2005:TCS,
author = "Marisa Gil and Ruben Pinilla",
title = "Thread coloring: a scheduler proposal from user to
hardware threads",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "54--70",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Steinke:2005:NPF,
author = "Robert Steinke and Micah Clark and Elihu McMahon",
title = "A new pattern for flexible worker threads with
in-place consumption message queues",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "71--73",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wiseman:2005:ABS,
author = "Yair Wiseman",
title = "{ARC} based superpaging",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "74--78",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dodge:2005:SIL,
author = "Catherine Dodge and Cynthia Irvine and Thuy Nguyen",
title = "A study of initialization in {Linux} and {OpenBSD}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "79--93",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hwang:2005:TAU,
author = "Kuo-Feng Hwang and I-En Liao",
title = "Two attacks on a user friendly remote authentication
scheme with {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "94--96",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wiseman:2005:EEE,
author = "Yair Wiseman and Karsten Schwan and Patrick Widener",
title = "Efficient end to end data exchange using configurable
compression",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "4--23",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2005:PFA,
author = "Zhiqiang Lin and Chao Wang and Bing Mao and Li Xie",
title = "A policy flexible architecture for secure operating
system",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "24--33",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guerrero:2005:ECB,
author = "Jorge Herrer{\'\i}as Guerrero and Roberto G{\'o}mez
C{\'a}rdenas",
title = "An example of communication between security tools:
{IPTables} --- {Snort}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "34--43",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Luo:2005:RCS,
author = "Guangchun Luo and Xianliang Lu and Ting Yang",
title = "The research on consistency of space\slash time of
{IDS}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "44--51",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tang:2005:DIL,
author = "Yan Tang and Tao Wang and Xiaoming Li",
title = "The design and implementation of {LilyTask} in shared
memory",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "52--63",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Srinivas:2005:MCS,
author = "A. Vijay Srinivas and D. Janakiram",
title = "A model for characterizing the scalability of
distributed systems",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "64--71",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2005:ULC,
author = "Youhui Zhang and Dongsheng Wong and Weimin Zheng",
title = "User-level checkpoint and recovery for {LAM\slash
MPI}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "72--81",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yan:2005:BFC,
author = "Kuo-Qin Yan and Shu-Ching Wang",
title = "The bounds of faulty components on consensus with dual
failure modes",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "82--89",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:2005:EDS,
author = "Yi-Hwa Chen and Jinn-Ke Jan",
title = "Enhancement of digital signature with message recovery
using self-certified public keys and its variants",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "90--96",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Loepere:2005:STM,
author = "Keith Loepere",
title = "Stackable thread mechanisms",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "4--17",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gwinn:2005:QSV,
author = "Joseph M. Gwinn",
title = "Quality-of-Service versus {Realtime}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "18--22",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gupta:2005:TAI,
author = "Vijay Shivshanker Gupta",
title = "Trust and accountability issues in scalable
invalidation-based {Web} cache consistency",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "23--36",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nijim:2005:PAA,
author = "Mais Nijim and Tao Xie and Xiao Qin",
title = "Performance analysis of an admission controller for
{CPU}- and {I/O}-intensive applications in
self-managing computer systems",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "37--45",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cheng:2005:MAS,
author = "Chien-Fu Cheng and Shu-Ching Wang and Tyne Liang",
title = "Multi-agent schema of {Mobile IP} protocol for mobile
environment",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "46--65",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2005:ECS,
author = "Chih-Hung Wang and Yan-Sheng Kuo",
title = "An efficient contract signing protocol using the
aggregate signature scheme to protect signers' privacy
and promote reliability",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "66--79",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2005:SCU,
author = "S. C. Wang and M. L. Chiang and K. Q. Yan and K. F.
Jea",
title = "Streets of consensus under unknown unreliable
network",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "80--96",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Seshadri:2005:PVC,
author = "Arvind Seshadri and Mark Luk and Elaine Shi and Adrian
Perrig and Leendert van Doorn and Pradeep Khosla",
title = "{Pioneer}: verifying code integrity and enforcing
untampered code execution on legacy systems",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "1--16",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Efstathopoulos:2005:LEP,
author = "Petros Efstathopoulos and Maxwell Krohn and Steve
VanDeBogart and Cliff Frey and David Ziegler and Eddie
Kohler and David Mazi{\`e}res and Frans Kaashoek and
Robert Morris",
title = "Labels and event processes in the asbestos operating
system",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "17--30",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Witchel:2005:MMI,
author = "Emmett Witchel and Junghwan Rhee and Krste
Asanovi{\'c}",
title = "{Mondrix}: memory isolation for {Linux} using
{Mondrian} memory protection",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "31--44",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aiyer:2005:BFT,
author = "Amitanand S. Aiyer and Lorenzo Alvisi and Allen
Clement and Mike Dahlin and Jean-Philippe Martin and
Carl Porth",
title = "{BAR} fault tolerance for cooperative services",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "45--58",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abd-El-Malek:2005:FSB,
author = "Michael Abd-El-Malek and Gregory R. Ganger and Garth
R. Goodson and Michael K. Reiter and Jay J. Wylie",
title = "Fault-scalable {Byzantine} fault-tolerant services",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "59--74",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Loo:2005:IDO,
author = "Boon Thau Loo and Tyson Condie and Joseph M.
Hellerstein and Petros Maniatis and Timothy Roscoe and
Ion Stoica",
title = "Implementing declarative overlays",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "75--90",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Joshi:2005:DPP,
author = "Ashlesha Joshi and Samuel T. King and George W. Dunlap
and Peter M. Chen",
title = "Detecting past and present intrusions through
vulnerability-specific predicates",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "91--104",
month = dec,
year = "2005",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1095810.1095820",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Most systems contain software with
yet-to-be-discovered security vulnerabilities. When a
vulnerability is disclosed, administrators face the
grim reality that they have been running software which
was open to attack. Sites that value availability may
be forced to continue running this vulnerable software
until the accompanying patch has been tested. Our goal
is to improve security by detecting intrusions that
occurred before the vulnerability was disclosed and by
detecting and responding to intrusions that are
attempted after the vulnerability is disclosed. We
detect when a vulnerability is triggered by executing
vulnerability-specific predicates as the system runs or
replays. This paper describes the design,
implementation and evaluation of a system that supports
the construction and execution of these
vulnerability-specific predicates. Our system, called
IntroVirt, uses virtual-machine introspection to
monitor the execution of application and operating
system software. IntroVirt executes predicates over
past execution periods by combining virtual-machine
introspection with virtual-machine replay. IntroVirt
eases the construction of powerful predicates by
allowing predicates to run existing target code in the
context of the target system, and it uses checkpoints
so that predicates can execute target code without
perturbing the state of the target system. IntroVirt
allows predicates to refresh themselves automatically
so they work in the presence of preemptions. We show
that vulnerability-specific predicates can be written
easily for a wide variety of real vulnerabilities, can
detect and respond to intrusions over both the past and
present time intervals, and add little overhead for
most vulnerabilities.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cohen:2005:CIC,
author = "Ira Cohen and Steve Zhang and Moises Goldszmidt and
Julie Symons and Terence Kelly and Armando Fox",
title = "Capturing, indexing, clustering, and retrieving system
history",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "105--118",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Soules:2005:CUC,
author = "Craig A. N. Soules and Gregory R. Ganger",
title = "{Connections}: using context to enhance file search",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "119--132",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Costa:2005:VEE,
author = "Manuel Costa and Jon Crowcroft and Miguel Castro and
Antony Rowstron and Lidong Zhou and Lintao Zhang and
Paul Barham",
title = "{Vigilante}: end-to-end containment of {Internet}
worms",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "133--147",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vrable:2005:SFC,
author = "Michael Vrable and Justin Ma and Jay Chen and David
Moore and Erik Vandekieft and Alex C. Snoeren and
Geoffrey M. Voelker and Stefan Savage",
title = "Scalability, fidelity, and containment in the
{Potemkin Virtual Honeyfarm}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "148--162",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Goel:2005:TIR,
author = "Ashvin Goel and Kenneth Po and Kamran Farhadi and
Zheng Li and Eyal de Lara",
title = "The {Taser} intrusion recovery system",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "163--176",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhu:2005:HHD,
author = "Qingbo Zhu and Zhifeng Chen and Lin Tan and Yuanyuan
Zhou and Kimberly Keeton and John Wilkes",
title = "{Hibernator}: helping disk arrays sleep through the
winter",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "177--190",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nightingale:2005:SED,
author = "Edmund B. Nightingale and Peter M. Chen and Jason
Flinn",
title = "Speculative execution in a distributed file system",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "191--205",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Prabhakaran:2005:IFS,
author = "Vijayan Prabhakaran and Lakshmi N. Bairavasundaram and
Nitin Agrawal and Haryadi S. Gunawi and Andrea
C. Arpaci-Dusseau and Remzi H. Arpaci-Dusseau",
title = "{IRON} file systems",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "206--220",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yu:2005:RED,
author = "Yuan Yu and Tom Rodeheffer and Wei Chen",
title = "{RaceTrack}: efficient detection of data race
conditions via adaptive tracking",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "221--234",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Qin:2005:RTB,
author = "Feng Qin and Joseph Tucek and Jagadeesan Sundaresan
and Yuanyuan Zhou",
title = "{Rx}: treating bugs as allergies---a safe method to
survive software failures",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "235--248",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eggert:2005:ISP,
author = "Lars Eggert and Joseph D. Touch",
title = "Idletime scheduling with preemption intervals",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "249--262",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Huang:2005:FDD,
author = "Hai Huang and Wanda Hung and Kang G. Shin",
title = "{FS2}: dynamic data replication in free disk space for
improving disk performance and energy consumption",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "263--276",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baratto:2005:TVD,
author = "Ricardo A. Baratto and Leonard N. Kim and Jason
Nieh",
title = "{THINC}: a virtual display architecture for
thin-client computing",
journal = j-OPER-SYS-REV,
volume = "39",
number = "5",
pages = "277--290",
month = dec,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Matthews:2006:OSR,
author = "Jeanna N. Matthews",
title = "Operating systems review: looking back and looking
forward",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "1--2",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fiuczynski:2006:POH,
author = "Marc E. Fiuczynski",
title = "{PlanetLab}: overview, history, and future
directions",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "6--10",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Peterson:2006:DPP,
author = "Larry Peterson and Timothy Roscoe",
title = "The design principles of {PlanetLab}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "11--16",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Spring:2006:UPN,
author = "Neil Spring and Larry Peterson and Andy Bavier and
Vivek Pai",
title = "Using {PlanetLab} for network research: myths,
realities, and best practices",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "17--24",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ricci:2006:LRA,
author = "Robert Ricci and David Oppenheimer and Jay Lepreau and
Amin Vahdat",
title = "Lessons from resource allocators for large-scale
multiuser testbeds",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "25--32",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Albrecht:2006:PAM,
author = "Jeannie Albrecht and Christopher Tuttle and Alex C.
Snoeren and Amin Vahdat",
title = "{PlanetLab} application management using plush",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "33--40",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Madhyastha:2006:OOA,
author = "Harsha V. Madhyastha and Arun Venkataramani and Arvind
Krishnamurthy and Thomas Anderson",
title = "{Oasis}: an overlay-aware network stack",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "41--48",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nakao:2006:SRO,
author = "Akihiro Nakao and Larry Peterson and Andy Bavier",
title = "Scalable routing overlay networks",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "49--61",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wong:2006:CCO,
author = "Bernard Wong and Emin G{\"u}n Sirer",
title = "{ClosestNode.com}: an open access, scalable, shared
geocast service for distributed systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "62--64",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Park:2006:CMS,
author = "KyoungSoo Park and Vivek S. Pai",
title = "{CoMon}: a mostly-scalable monitoring system for
{PlanetLab}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "65--74",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muir:2006:POP,
author = "Steve Muir and Larry Peterson and Marc Fiuczynski and
Justin Cappos and John Hartman",
title = "Privileged operations in the {PlanetLab} virtualised
environment",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "75--88",
month = jan,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1113361.1113375",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualised systems have experienced a resurgence in
popularity in recent years, whether used to support
multiple OSes running on a user's desktop, provide
commercial application hosting facilities, or isolate a
large number of users from each other in global network
testbeds. We also see an increasing level of interest
in having entities within these virtualised systems
interact with each other, either as peers or as helpers
providing a service to clients.Very little work has
been previously conducted on how such interaction
between virtualised environments can take place. We
introduce Proper, a service running on the PlanetLab
system, that allows unprivileged entities to access
privileged operations in a safe, tightly controlled
manner.This paper describes our work designing and
implementing Proper, including a discussion of the
various architectural decisions made. We describe how
implementing such a system in a traditional UNIX
environment is non-trivial, and provide a number of
examples of how services running on PlanetLab actually
use Proper.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Huang:2006:PMA,
author = "Mark Huang and Andy Bavier and Larry Peterson",
title = "{PlanetFlow}: maintaining accountability for network
services",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "89--94",
month = jan,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1113361.1113376",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "PlanetFlow is a network auditing service that
maintains comprehensive, permanent accountability for
all traffic generated by PlanetLab services, in
accordance with common Internet practice and the terms
of the PlanetLab Acceptable Use Policy. PlanetFlow
audits the usage of PlanetLab network resources in
order to facilitate the resolution of complaints, limit
liability, and minimize problematic behavior.The
current implementation of PlanetFlow consists of a low
overhead flow classifier, an autonomously managed
distributed database, and a publicly accessible Web
interface. PlanetFlow currently processes up to 4 TB of
generated traffic per day, and incurs negligible CPU
and storage overhead.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heiser:2006:VMM,
author = "Gernot Heiser and Volkmar Uhlig and Joshua
LeVasseur",
title = "Are virtual-machine monitors microkernels done
right?",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "95--99",
month = jan,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1113361.1113363",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A paper by Hand et al. at the recent HotOS workshop
re-examined microkernels and contrasted them to
virtual-machine monitors (VMMs). It found that the two
kinds of systems share architectural commonalities but
also have a number of technical differences which the
paper examined. It concluded that VMMs are a special
case of microkernels, ``microkernels done right''. A
closer examination of that paper shows that it contains
a number of statements which are poorly justified or
even refuted by the literature. While we believe that
it is indeed timely to reexamine the merits and issues
of microkernels, such an examination needs to be based
on facts.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tanenbaum:2006:FSD,
author = "Andrew S. Tanenbaum and Jorrit N. Herder and Herbert
Bos",
title = "File size distribution on {UNIX} systems: then and
now",
journal = j-OPER-SYS-REV,
volume = "40",
number = "1",
pages = "100--104",
month = jan,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bridges:2006:SSH,
author = "Patrick G. Bridges and Arthur B. MacCabe and Orran
Krieger",
title = "System software for high end computing",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "6--7",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mergen:2006:VHP,
author = "Mark F. Mergen and Volkmar Uhlig and Orran Krieger and
Jimi Xenidis",
title = "Virtualization for high-performance computing",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "8--11",
month = apr,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1131322.1131328",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The specific demands of high-performance computing
(HPC) often mismatch the assumptions and algorithms
provided by legacy operating systems (OS) for common
workload mixes. While feature- and application-rich
OSes allow for flexible and low-cost hardware
configurations, rapid development, and flexible testing
and debugging, the mismatch comes at the cost of ---
oftentimes significant --- performance degradation for
HPC applications.The ubiquitous availability of
virtualization support in all relevant hardware
architectures enables new programming and execution
models for HPC applications without loosing the comfort
and support of existing OS and application
environments. In this paper we discuss the trends,
motivations, and issues in hardware virtualization with
emphasis on their value in HPC environments.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{VanHensbergen:2006:PRP,
author = "Eric {Van Hensbergen}",
title = "{P.R.O.S.E}.: partitioned reliable operating system
environment",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "12--15",
month = apr,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1131322.1131329",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This document re-evaluates the software stack in the
light of para-virtualization technology and hypervisor
support within next generation processors and operating
systems. We describe an infrastructure enabling the use
of logical partitions (LPARs) for the execution of
stand-alone applications along side traditional
operating systems. The design goal is to provide an
environment allowing normal users to execute, interact
and manage these custom kernels in much the same way
they would with typical applications. The development
environment is a set of modular component libraries
providing necessary system services, and a familiar
debug environment provided by exposing partition memory
and control interfaces to a ``controller'' partition.
We describe the implementation of our prototype using
the IBM research hypervisor along with the Linux kernel
and explore potential applications that could benefit
from this new environment.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tournier:2006:TFD,
author = "Jean-Charles Tournier and Patrick G. Bridges and
Arthur B. MacCabe and Patrick M. Widener and Zaid
Abudayyeh and Ron Brightwell and Rolf Riesen and
Trammel Hudson",
title = "Towards a framework for dedicated operating systems
development in high-end computing systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "16--21",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Minnich:2006:RWK,
author = "Ronald G. Minnich and Matthew J. Sottile and Sung-Eun
Choi and Erik Hendriks and Jim McKie",
title = "Right-weight kernels: an off-the-shelf alternative to
custom light-weight kernels",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "22--28",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Beckman:2006:OSI,
author = "Pete Beckman and Kamil Iskra and Kazutomo Yoshii and
Susan Coghlan",
title = "Operating system issues for petascale systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "29--33",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{DaSilva:2006:KIO,
author = "Dilma {Da Silva} and Orran Krieger and Robert W.
Wisniewski and Amos Waterland and David Tam and Andrew
Baumann",
title = "{K42}: an infrastructure for operating system
research",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "34--42",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chakravorty:2006:HCS,
author = "Sayantan Chakravorty and Celso L. Mendes and Laxmikant
V. Kal{\'e} and Terry Jones and Andrew Tauferner and
Todd Inglett and Jos{\'e} Moreira",
title = "{HPC-Colony}: services and interfaces for very large
systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "43--49",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ong:2006:KLS,
author = "Hong Ong and Jeffrey Vetter and R. Scott Studham and
Collin McCurdy and Bruce Walker and Alan Cox",
title = "Kernel-level single system image for petascale
computing",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "50--54",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Petrini:2006:SSF,
author = "Fabrizio Petrini and Jarek Nieplocha and Vinod
Tipparaju",
title = "{SFT}: scalable fault tolerance",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "55--62",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Engelmann:2006:MAR,
author = "Christian Engelmann and Stephen L. Scott and David E.
Bernholdt and Narasimha R. Gottumukkala and Chokchai
Leangsuksun and Jyothish Varma and Chao Wang and Frank
Mueller and Aniruddha G. Shet and P. Sadayappan",
title = "{MOLAR}: adaptive runtime support for high-end
computing operating and runtime systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "63--72",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rauchwerger:2006:SMW,
author = "Lawrence Rauchwerger and Nancy M. Amato",
title = "{SmartApps}: middle-ware for adaptive applications on
reconfigurable platforms",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "73--82",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Teller:2006:IPD,
author = "Patricia J. Teller and Seetharami R. Seelam",
title = "Insights into providing dynamic adaptation of
operating system policies",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "83--89",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zheng:2006:PEA,
author = "Gengbin Zheng and Chao Huang and Laxmikant V.
Kal{\'e}",
title = "Performance evaluation of automatic checkpoint-based
fault tolerance for {AMPI} and {Charm++}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "90--99",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nieh:2006:ETO,
author = "Jason Nieh and Chris Vaill",
title = "Experiences teaching operating systems using virtual
platforms and {Linux}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "100--104",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Freiling:2006:IIC,
author = "Felix C. Freiling and Hagen V{\"o}lzer",
title = "Illustrating the impossibility of crash-tolerant
consensus in asynchronous systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "105--109",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Koren:2006:SLK,
author = "Oded Koren",
title = "A study of the {Linux} kernel evolution",
journal = j-OPER-SYS-REV,
volume = "40",
number = "2",
pages = "110--112",
month = apr,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sirer:2006:I,
author = "Emin G{\"u}n Sirer",
title = "Introduction",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "8--8",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Babaoglu:2006:MCC,
author = "{\"O}zalp Babao{\u{g}}lu and M{\'a}rk Jelasity and
Anne-Marie Kermarrec and Alberto Montresor and Maarten
van Steen",
title = "Managing clouds: a case for a fresh look at large
unreliable dynamic networks",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "9--13",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patel:2006:BGA,
author = "Jay A. Patel and Indranil Gupta",
title = "Bridging the gap: augmenting centralized systems with
{P2P} technologies",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "14--17",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Clulow:2006:SCG,
author = "Jolyon Clulow and Tyler Moore",
title = "Suicide for the common good: a new strategy for
credential revocation in self-organizing systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "18--21",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bindal:2006:CSO,
author = "Ruchir Bindal and Pei Cao",
title = "Can self-organizing {P2P} file distribution provide
{QoS} guarantees?",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "22--30",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Douglis:2006:MSC,
author = "Fred Douglis and Michael Branson and Kirsten Hildrum
and Bin Rong and Fan Ye",
title = "Multi-site cooperative data stream analysis",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "31--37",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hoke:2006:ICM,
author = "Evan Hoke and Jimeng Sun and John D. Strunk and
Gregory R. Ganger and Christos Faloutsos",
title = "{InteMon}: continuous mining of sensor data in
large-scale self-infrastructures",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "38--44",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gordon:2006:SSP,
author = "Minor Gordon",
title = "Small-scale peer-to-peer overlays",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "45--48",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhong:2006:RWB,
author = "Ming Zhong and Kai Shen",
title = "Random walk based node sampling in self-organizing
networks",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "49--55",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hales:2006:TAS,
author = "David Hales and {\"O}zalp Babao{\u{g}}lu",
title = "Towards automatic social bootstrapping of peer-to-peer
protocols",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "56--60",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Corbo:2006:SNE,
author = "Jacomo Corbo and Antoni Calv{\'o}-Armengol and David
Parkes",
title = "A study of {Nash} equilibrium in contribution games
for peer-to-peer networks",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "61--66",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Antoniadis:2006:EER,
author = "Panayotis Antoniadis and Costas Courcoubetis",
title = "Enforcing efficient resource provisioning in
peer-to-peer file sharing systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "67--72",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ozkasap:2006:EBA,
author = "{\"O}znur {\"O}zkasap and Z{\"u}lk{\"u}f Gen{\c{c}}
and Emre Atsan",
title = "Epidemic-based approaches for reliable multicast in
mobile ad hoc networks",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "73--79",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herder:2006:MHR,
author = "Jorrit N. Herder and Herbert Bos and Ben Gras and
Philip Homburg and Andrew S. Tanenbaum",
title = "{MINIX 3}: a Highly Reliable, Self-Repairing Operating
System",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "80--89",
month = jul,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1151374.1151391",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 24 08:49:31 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "http://www.minix3.org/doc/OSR-2006.pdf;
http://www.minix3.org/docs/jorrit-herder/osr-jul06.pdf",
abstract = "Different kinds of people use computers now than
several decades ago, but operating systems have not
fully kept pace with this change. It is true that we
have point-and-click GUIs now instead of command line
interfaces, but the expectation of the average user is
different from what it used to be, because the user is
different. Thirty or 40 years ago, when operating
systems began to solidify into their current form,
almost all computer users were programmers, scientists,
engineers, or similar professionals doing heavy-duty
computation, and they cared a great deal about speed.
Few teenagers and even fewer grandmothers spent hours a
day behind their terminal. Early users expected the
computer to crash often; reboots came as naturally as
waiting for the neighborhood TV repairman to come
replace the picture tube on their home TVs. All that
has changed and operating systems need to change with
the times.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muller:2006:SPC,
author = "Gilles Muller and Yoann Padioleau and Julia L. Lawall
and Ren{\'e} Rydhof Hansen",
title = "Semantic patches considered helpful",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "90--92",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Erlingsson:2006:AHE,
author = "{\'U}lfar Erlingsson and John MacCormick",
title = "Ad hoc extensibility and access control",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "93--101",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Konishi:2006:LIL,
author = "Ryusuke Konishi and Yoshiji Amagai and Koji Sato and
Hisashi Hifumi and Seiji Kihara and Satoshi Moriai",
title = "The {Linux} implementation of a log-structured file
system",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "102--107",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bosse:2006:VFA,
author = "Stefan Bosse",
title = "{VAMNET}: the functional approach to distributed
programming",
journal = j-OPER-SYS-REV,
volume = "40",
number = "3",
pages = "108--114",
month = jul,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Johansen:2006:FSS,
author = "H{\aa}vard Johansen and Andr{\'e} Allavena and Robbert
van Renesse",
title = "{Fireflies}: {Scalable} support for intrusion-tolerant
network overlays",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "3--13",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217937",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes and evaluates Fireflies, a
scalable protocol for supporting intrusion-tolerant
network overlays. While such a protocol cannot
distinguish Byzantine nodes from correct nodes in
general, Fireflies provides correct nodes with a
reasonably current view of which nodes are live, as
well as a pseudo-random mesh for communication. The
amount of data sent by correct nodes grows linearly
with the aggregate rate of failures and recoveries,
even if provoked by Byzantine nodes. The set of correct
nodes form a connected submesh; correct nodes cannot be
eclipsed by Byzantine nodes. Fireflies is deployed and
evaluated on PlanetLab.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Portokalidis:2006:AEF,
author = "Georgios Portokalidis and Asia Slowinska and Herbert
Bos",
title = "{Argos}: an emulator for fingerprinting zero-day
attacks for advertised honeypots with automatic
signature generation",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "15--27",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217938",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As modern operating systems and software become larger
and more complex, they are more likely to contain bugs,
which may allow attackers to gain illegitimate access.
A fast and reliable mechanism to discern and generate
vaccines for such attacks is vital for the successful
protection of networks and systems. In this paper we
present Argos, a containment environment for worms as
well as human orchestrated attacks. Argos is built upon
a fast x86 emulator which tracks network data
throughout execution to identify their invalid use as
jump targets, function addresses, instructions, etc.
Furthermore, system call policies disallow the use of
network data as arguments to certain calls. When an
attack is detected, we perform `intelligent' process-
or kernel-aware logging of the corresponding emulator
state for further offline processing. In addition, our
own forensics shellcode is injected, replacing the
malevolent shellcode, to gather information about the
attacked process. By correlating the data logged by the
emulator with the data collected from the network, we
are able to generate accurate network intrusion
detection signatures for the exploits that are immune
to payload mutations. The entire process can be
automated and has few if any false positives, thus
rapid global scale deployment of the signatures is
possible.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ho:2006:PTB,
author = "Alex Ho and Michael Fetterman and Christopher Clark
and Andrew Warfield and Steven Hand",
title = "Practical taint-based protection using demand
emulation",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "29--41",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217939",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many software attacks are based on injecting malicious
code into a target host. This paper demonstrates the
use of a well-known technique, data tainting, to track
data received from the network as it propagates through
a system and to prevent its execution. Unlike past
approaches to taint tracking, which track tainted data
by running the system completely in an emulator or
simulator, resulting in considerable execution
overhead, our work demonstrates the ability to
dynamically switch a running system between virtualized
and emulated execution. Using this technique, we are
able to explore hardware support for taint-based
protection that is deployable in real-world situations,
as emulation is only used when tainted data is being
processed by the CPU. By modifying the CPU, memory, and
I/O devices to support taint tracking and protection,
we guarantee that data received from the network may
not be executed, even if it is written to, and later
read from disk. We demonstrate near native speeds for
workloads where little taint data is present.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "demand emulation; emulation; false tainting; QEMU;
tainting; virtualization; virtual machine; Xen",
}
@Article{Spear:2006:SSP,
author = "Michael F. Spear and Tom Roeder and Orion Hodson and
Galen C. Hunt and Steven Levi",
title = "Solving the starting problem: device drivers as
self-describing artifacts",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "45--57",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217941",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Run-time conflicts can affect even the most rigorously
tested software systems. A reliance on execution-based
testing makes it prohibitively costly to test every
possible interaction among potentially thousands of
programs with complex configurations. In order to
reduce configuration problems, detect developer errors,
and reduce developer effort, we have created a new
first class operating system abstraction, the
application abstraction, which enables both online and
offline reasoning about programs and their
configuration requirements. We have implemented a
subset of the application abstraction for device
drivers in the Singularity operating system.
Programmers use the application abstraction by placing
declarative statements about hardware and communication
requirements within their code. Our design enables
Singularity to learn the input/output and interprocess
communication requirements of drivers without executing
driver code. By reasoning about this information within
the domain of Singularity's strong software isolation
architecture, the installer can execute a subset the
system's resource management algorithm at install time
to verify that a new driver will not conflict with
existing software. This abstract representation also
allows the system to run the full algorithm at driver
start time to ensure that there are never resource
conflicts between executing drivers, and that drivers
never use undeclared resources.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "declarative configuration; dependable computing;
experience with existing systems; operating systems;
programming language support",
}
@Article{Padioleau:2006:UCE,
author = "Yoann Padioleau and Julia L. Lawall and Gilles
Muller",
title = "Understanding collateral evolution in {Linux} device
drivers",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "59--71",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217942",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In a modern operating system (OS), device drivers can
make up over 70\% of the source code. Driver code is
also heavily dependent on the rest of the OS, for
functions and data structures defined in the kernel and
driver support libraries. These properties pose a
significant problem for OS evolution, as any changes in
the interfaces exported by the kernel and driver
support libraries can trigger a large number of
adjustments in dependent drivers. These adjustments,
which we refer to as collateral evolutions, may be
complex, entailing substantial code reorganizations. As
to our knowledge there exist no tools to help in this
process, collateral evolution is thus time consuming
and error prone. In this paper, we present a
qualitative and quantitative assessment of collateral
evolution in Linux device driver code. We provide a
taxonomy of evolutions and collateral evolutions, and
use an automated patch-analysis tool that we have
developed to measure the number of evolutions and
collateral evolutions that affect device drivers
between Linux versions 2.2 and 2.6. In particular, we
find that from one version of Linux to the next,
collateral evolutions can account for up to 35\% of the
lines modified in such code.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "device drivers; Linux; software evolution",
}
@Article{Ball:2006:TSA,
author = "Thomas Ball and Ella Bounimova and Byron Cook and
Vladimir Levin and Jakob Lichtenberg and Con McGarvey
and Bohus Ondrusek and Sriram K. Rajamani and Abdullah
Ustuner",
title = "Thorough static analysis of device drivers",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "73--85",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217943",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Bugs in kernel-level device drivers cause 85\% of the
system crashes in the Windows XP operating system [44].
One of the sources of these errors is the complexity of
the Windows driver API itself: programmers must master
a complex set of rules about how to use the driver API
in order to create drivers that are good clients of the
kernel. We have built a static analysis engine that
finds API usage errors in C programs. The Static Driver
Verifier tool (SDV) uses this engine to find kernel API
usage errors in a driver. SDV includes models of the OS
and the environment of the device driver, and over
sixty API usage rules. SDV is intended to be used by
driver developers `out of the box.' Thus, it has
stringent requirements: (1) complete automation with no
input from the user; (2) a low rate of false errors. We
discuss the techniques used in SDV to meet these
requirements, and empirical results from running SDV on
over one hundred Windows device drivers.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "formal verification; software model checking",
}
@Article{Soundararajan:2006:DRP,
author = "Gokul Soundararajan and Cristiana Amza and Ashvin
Goel",
title = "Database replication policies for dynamic content
applications",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "89--102",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217945",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The database tier of dynamic content servers at large
Internet sites is typically hosted on centralized and
expensive hardware. Recently, research prototypes have
proposed using database replication on commodity
clusters as a more economical scaling solution. In this
paper, we propose using database replication to support
multiple applications on a shared cluster. Our system
dynamically allocates replicas to applications in order
to maintain application-level performance in response
to either peak loads or failure conditions. This
approach allows unifying load and fault management
functionality. The main challenge in the design of our
system is the lime taken to add database replicas. We
present replica allocation policies that take this time
delay into account and also design an efficient replica
addition method that has minimal impact on other
applications. We evaluate our dynamic replication
system on a commodity cluster with two standard
benchmarks: the TPC-W e-commerce benchmark and the
RUBIS auction benchmark. Our evaluation shows that
dynamic replication requires fewer resources than
static partitioning or full overlap replication
policies and provides over 90\% latency compliance to
each application under a range of load and failure
scenarios.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "adaptation; cluster; database systems;
fault-tolerance",
}
@Article{Lorch:2006:SWM,
author = "Jacob R. Lorch and Atul Adya and William J. Bolosky
and Ronnie Chaiken and John R. Douceur and Jon Howell",
title = "The {SMART} way to migrate replicated stateful
services",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "103--115",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217946",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many stateful services use the replicated state
machine approach for high availability. In this
approach, a service runs on multiple machines to
survive machine failures. This paper describes SMART, a
new technique for changing the set of machines where
such a service runs, i.e., migrating the service. SMART
improves upon existing techniques in three important
ways. First, SMART allows migrations that replace
non-failed machines. Thus, SMART enables load balancing
and lets an automated system replace failed machines.
Such autonomic migration is an important step toward
full autonomic operation, in which administrators play
a minor role and need not be available twenty-four
hours a day, seven days a week. Second, SMART can
pipeline concurrent requests, a useful performance
optimization. Third, prior published migration
techniques are described in insufficient detail to
admit implementation, whereas our description of SMART
is complete. In addition to describing SMART, we also
demonstrate its practicality by implementing it,
evaluating our implementation's performance, and using
it to build a consistent, replicated, migratable file
system. Our experiments demonstrate the performance
advantage of pipelining concurrent requests, and show
that migration has only a minor and temporary effect on
performance.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "migration; paxos; reconfiguration; replicated state
machine; replication",
}
@Article{Elnikety:2006:TUD,
author = "Sameh Elnikety and Steven Dropsho and Fernando
Pedone",
title = "{Tashkent}: uniting durability with transaction
ordering for high-performance scalable database
replication",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "117--130",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217947",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In stand-alone databases, the functions of ordering
the transaction commits and making the effects of
transactions durable are performed in one single
action, namely the writing of the commit record to
disk. For efficiency many of these writes are grouped
into a single disk operation. In replicated databases
in which all replicas agree on the commit order of
update transactions, these two functions are typically
separated. Specifically, the replication middleware
determines the global commit order, while the database
replicas make the transactions durable. The
contribution of this paper is to demonstrate that this
separation causes a significant scalability bottleneck.
It forces some of the commit records to be written to
disk serially, where in a standalone system they could
have been grouped together in a single disk write. Two
solutions are possible: (1) move durability from the
database to the replication middleware, or (2) keep
durability in the database and pass the global commit
order from the replication middleware to the database.
We implement these two solutions. Tashkent-MW is a pure
middleware solution that combines durability and
ordering in the middleware, and treats an unmodified
database as a black box. In Tashkent-API, we modify the
database API so that the middleware can specify the
commit order to the database, thus, combining ordering
and durability inside the database. We compare both
Tashkent systems to an otherwise identical replicated
system, called Base, in which ordering and durability
remain separated. Under high update transaction loads
both Tashkent systems greatly outperform Base in
throughput and response time.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "database replication; generalized snapshot isolation",
}
@Article{Krieger:2006:KBC,
author = "Orran Krieger and Marc Auslander and Bryan Rosenburg
and Robert W. Wisniewski and Jimi Xenidis and Dilma Da
Silva and Michal Ostrowski and Jonathan Appavoo and
Maria Butrico and Mark Mergen and Amos Waterland and
Volkmar Uhlig",
title = "{K42}: building a complete operating system",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "133--145",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217949",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "K42 is one of the few recent research projects that is
examining operating system design structure issues in
the context of new whole-system design. K42 is open
source and was designed from the ground up to perform
well and to be scalable, customizable, and
maintainable. The project was begun in 1996 by a team
at IBM Research. Over the last nine years there has
been a development effort on K42 from between six to
twenty researchers and developers across IBM,
collaborating universities, and national laboratories.
K42 supports the Linux API and ABI, and is able to run
unmodified Linux applications and libraries. The
approach we took in K42 to achieve scalability and
customizability has been successful. The project has
produced positive research results, has resulted in
contributions to Linux and the Xen hypervisor on Power,
and continues to be a rich platform for exploring
system software technology. Today, K42, is one of the
key exploratory platforms in the DOE's FAST-OS program,
is being used as a prototyping vehicle in IBM's PERCS
project, and is being used by universities and national
labs for exploratory research. In this paper, we
provide insight into building an entire system by
discussing the motivation and history of K42,
describing its fundamental technologies, and presenting
an overview of the research directions we have been
pursuing.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "customizable operating systems; operating system
design; scalable operating systems",
}
@Article{Mislove:2006:EBO,
author = "Alan Mislove and Ansley Post and Andreas Haeberlen and
Peter Druschel",
title = "Experiences in building and operating {ePOST}, a
reliable peer-to-peer application",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "147--159",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217950",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Peer-to-peer (p2p) technology can potentially be used
to build highly reliable applications without a single
point of failure. However, most of the existing
applications, such as file sharing or web caching, have
only moderate reliability demands. Without a
challenging proving ground, it remains unclear whether
the full potential of p2p systems can be realized. To
provide such a proving ground, we have designed,
deployed and operated a p2p-based email system. We
chose email because users depend on it for their daily
work and therefore place high demands on the
availability and reliability of the service, as well as
the durability, integrity, authenticity and privacy of
their email. Our system, ePOST, has been actively used
by a small group of participants for over two years. In
this paper, we report the problems and pitfalls we
encountered in this process. We were able to address
some of them by applying known principles of system
design, while others turned out to be novel and
fundamental, requiring us to devise new solutions. Our
findings can be used to guide the design of future
reliable p2p systems and provide interesting new
directions for future research.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "decentralized systems; electronic mail; peer-to-peer;
reliability",
}
@Article{Singaravelu:2006:RTC,
author = "Lenin Singaravelu and Calton Pu and Hermann H{\"a}rtig
and Christian Helmuth",
title = "Reducing {TCB} complexity for security-sensitive
applications: three case studies",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "161--174",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217951",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The large size and high complexity of
security-sensitive applications and systems software is
a primary cause for their poor testability and high
vulnerability. One approach to alleviate this problem
is to extract the security-sensitive parts of
application and systems software, thereby reducing the
size and complexity of software that needs to be
trusted. At the system software level, we use the Nizza
architecture which relies on a kernelized trusted
computing base (TCB) and on the reuse of legacy code
using trusted wrappers to minimize the size of the TCB.
At the application level, we extract the
security-sensitive portions of an already existing
application into an AppCore. The AppCore is executed as
a trusted process in the Nizza architecture while the
rest of the application executes on a virtualized,
untrusted legacy operating system. In three case
studies of real-world applications (e-commerce
transaction client, VPN gateway and digital signatures
in an e-mail client), we achieved a considerable
reduction in code size and complexity. In contrast to
the few hundred thousand lines of current application
software code running on millions of lines of systems
software code, we have AppCores with tens of thousands
of lines of code running on a hundred thousand lines of
systems software code. We also show the performance
penalty of AppCores to be modest (a few percent)
compared to current software.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "application security; trusted computing base",
}
@Article{Fahndrich:2006:LSF,
author = "Manuel F{\"a}hndrich and Mark Aiken and Chris
Hawblitzel and Orion Hodson and Galen Hunt and James
R. Larus and Steven Levi",
title = "Language support for fast and reliable message-based
communication in singularity {OS}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "177--190",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217953",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Message-based communication offers the potential
benefits of providing stronger specification and
cleaner separation between components. Compared with
shared-memory interactions, message passing has the
potential disadvantages of more expensive data exchange
(no direct sharing) and more complicated programming.
In this paper we report on the language, verification,
and run-time system features that make messages
practical as the sole means of communication between
processes in the Singularity operating system. We show
that using advanced programming language and
verification techniques, it is possible to provide and
enforce strong system-wide invariants that enable
efficient communication and low-overhead software-based
process isolation. Furthermore, specifications on
communication channels help in detecting programmer
mistakes early---namely at compile-time---thereby
reducing the difficulty of the message-based
programming model. The paper describes our
communication invariants, the language and verification
features that support them, as well as implementation
details of the infrastructure. A number of benchmarks
show the competitiveness of this approach.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "asynchronous communication; channels; data ownership;
protocols; static checking",
}
@Article{Lohmann:2006:QAA,
author = "Daniel Lohmann and Fabian Scheler and Reinhard Tartler
and Olaf Spinczyk and Wolfgang Schr{\"o}der-Preikschat",
title = "A quantitative analysis of aspects in the {eCos}
kernel",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "191--204",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217954",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Nearly ten years after its first presentation and five
years after its first application to operating systems,
the suitability of Aspect-Oriented Programming (AOP)
for the development of operating system kernels is
still highly in dispute. While the AOP advocacy
emphasizes the benefits of AOP towards better
configurability and maintainability of system software,
most kernel developers express a sound skepticism
regarding the thereby induced runtime and memory costs:
Operating system kernels have to be lean and efficient.
We have analyzed the runtime and memory costs of
aspects in general, on the level of $\mu$-benchmarks,
and by refactoring and extending the eCos operating
system kernel using AspectC++, an AOP extension to the
C++ language. Our results show that most AOP features
do not induce a intrinsic overhead and that the actual
overhead induced by AspectC++ is very low. We have also
analyzed a test case with significant aspect-related
costs. This example shows how the structure of the
underlying kernel can have a negative impact on aspect
implementations and how these costs can be avoided by
an aspect-aware design. Based on this analysis, our
conclusion is that AOP is suitable for the development
of operating system kernels and other kinds of highly
efficient infrastructure software.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "AspectC++; Aspect-Oriented Programming (AOP); eCos;
Footprint",
}
@Article{Krishna:2006:CSM,
author = "Arvind S. Krishna and Aniruddha S. Gokhale and Douglas
C. Schmidt",
title = "Context-specific middleware specialization techniques
for optimizing software product-line architectures",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "205--218",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217955",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Product-line architectures (PLAs) are an emerging
paradigm for developing software families for
distributed real-time and embedded (DRE) systems by
customizing reusable artifacts, rather than
hand-crafting software from scratch. To reduce the
effort of developing software PLAs and product variants
for DRE systems, developers are applying
general-purpose -- ideally standard -- middleware
platforms whose reusable services and mechanisms
support a range of application quality of service (QoS)
requirements, such as low latency and jitter. The
generality and flexibility of standard middleware,
however, often results in excessive time/space overhead
for DRE systems, due to lack of optimizations tailored
to meet the specific QoS requirements of different
product variants in a PLA.This paper provides the
following contributions to the study of middleware
specialization techniques for PLA-based DRE systems.
First, we identify key dimensions of generality in
standard middleware stemming from framework
implementations, deployment platforms, and middleware
standards. Second, we illustrate how context-specific
specialization techniques can be automated and used to
tailor standard middleware to better meet the QoS needs
of different PLA product variants. Third, we quantify
the benefits of applying automated tools to specialize
a standard Realtime CORBA middleware implementation.
When applied together, these middleware specializations
improved our application product variant throughput by
~65\%, average- and worst-case end-to-end latency
measures by ~43\% and ~45\%, respectively, and
predictability by a factor of two over an already
optimized middleware implementation, with little or no
effect on portability, standard middleware APIs, or
application software implementations, and
interoperability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "middleware; product lines; specializations",
}
@Article{Baker:2006:FLR,
author = "Mary Baker and Mehul Shah and David S. H. Rosenthal
and Mema Roussopoulos and Petros Maniatis and TJ Giuli
and Prashanth Bungale",
title = "A fresh look at the reliability of long-term digital
storage",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "221--234",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217957",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Emerging Web services, such as email, photo sharing,
and web site archives, must preserve large volumes of
quickly accessible data indefinitely into the future.
The costs of doing so often determine whether the
service is economically viable. We make the case that
these applications' demands on large scale storage
systems over long time horizons require us to
reevaluate traditional system designs. We examine
threats to long-lived data from an end-to-end
perspective, taking into account not just hardware and
software faults but also faults due to humans and
organizations. We present a simple model of long-term
storage failures that helps us reason about various
strategies for addressing some of these threats. Using
this model we show that the most important strategies
for increasing the reliability of long-term storage are
detecting latent faults quickly, automating fault
repair to make it cheaper and faster, and increasing
the independence of data replicas.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "digital preservation; storage systems",
}
@Article{Keeton:2006:RRR,
author = "Kimberly Keeton and Dirk Beyer and Ernesto Brau and
Arif Merchant and Cipriano Santos and Alex Zhang",
title = "On the road to recovery: restoring data after
disasters",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "235--248",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217958",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Restoring data operations after a disaster is a
daunting task: how should recovery be performed to
minimize data loss and application downtime?
Administrators are under considerable pressure to
recover quickly, so they lack time to make good
scheduling decisions. They schedule recovery based on
rules of thumb, or on pre-determined orders that might
not be best for the failure occurrence. With multiple
workloads and recovery techniques, the number of
possibilities is large, so the decision process is not
trivial. This paper makes several contributions to the
area of data recovery scheduling. First, we formalize
the description of potential recovery processes by
defining recovery graphs. Recovery graphs explicitly
capture alternative approaches for recovering
workloads, including their recovery tasks, operational
states, timing information and precedence
relationships. Second, we formulate the data recovery
scheduling problem as an optimization problem, where
the goal is to find the schedule that minimizes the
financial penalties due to downtime, data loss and
vulnerability to subsequent failures. Third, we present
several methods for finding optimal or near-optimal
solutions, including priority-based, randomized and
genetic algorithm-guided ad hoc heuristics. We
quantitatively evaluate these methods using realistic
storage system designs and workloads, and compare the
quality of the algorithms' solutions to optimal
solutions provided by a math programming formulation
and to the solutions from a simple heuristic that
emulates the choices made by human administrators. We
find that our heuristics' solutions improve on the
administrator heuristic's solutions, often approaching
or achieving optimality.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "backup/restore; data storage; disaster recovery;
genetic algorithms; management; math programming;
optimization; scheduling",
}
@Article{Yao:2006:RNR,
author = "Xiaoyu Yao and Jun Wang",
title = "{RIMAC}: a novel redundancy-based hierarchical cache
architecture for energy efficient, high performance
storage systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "249--262",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217959",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Energy efficiency becomes increasingly important in
today's high-performance storage systems. It can be
challenging to save energy and improve performance at
the same time in conventional (i.e.
single-rotation-rate) disk-based storage systems. Most
existing solutions compromise performance for energy
conservation. In this paper, we propose a
redundancy-based, two-level I/O cache architecture
called RIMAC to address this problem. The idea of RIMAC
is to enable data on the standby disk to be recovered
by accessing data in the two-level I/O cache or on
currently active/idle disks. At both cache and disk
levels, RIMAC dynamically transforms accesses toward
standby disks by exploiting parity redundancy in
parity-based redundant disk arrays. Because I/O
requests that require physical accesses on standby
disks involve long waiting time and high power
consumption for disk spin-up (tens of seconds for SCSI
disks), transforming those requests to accesses in a
two-level, collaborative I/O cache or on active disks
can significantly improve both energy efficiency and
performance. In RIMAC, we developed (i) two power-aware
read request transformation schemes called
Transformable Read in Cache (TRC) and Transformable
Read on Disk (TRD), (ii) a power-aware write request
transformation policy for parity update and (iii) a
second-chance parity cache replacement algorithm to
improve request transformation rate. We evaluated RIMAC
by augmenting a validated storage system simulator,
disksim. For several real-life server traces including
HP's cello 99, TPC-D and SPC's search engine, RIMAC is
shown to reduce energy consumption by up to 33\% and
simultaneously improve the average response time by up
to 30\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cache management; disk storage; power management",
}
@Article{Brecht:2006:ENP,
author = "Tim Brecht and G. (John) Janakiraman and Brian Lynn
and Vikram Saletore and Yoshio Turner",
title = "Evaluating network processing efficiency with
processor partitioning and asynchronous {I/O}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "265--278",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217961",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Applications requiring high-speed TCP/IP processing
can easily saturate a modern server. We and others have
previously suggested alleviating this problem in
multiprocessor environments by dedicating a subset of
the processors to perform network packet processing.
The remaining processors perform only application
computation, thus eliminating contention between these
functions for processor resources. Applications
interact with packet processing engines (PPEs) using an
asynchronous I/O (AIO) programming interface which
bypasses the operating system. A key attraction of this
overall approach is that it exploits the architectural
trend toward greater thread-level parallelism in future
systems based on multi-core processors. In this paper,
we conduct a detailed experimental performance analysis
comparing this approach to a best-practice configured
Linux baseline system. We have built a prototype system
implementing this architecture, ETA+AIO (Embedded
Transport Acceleration with Asynchronous I/O), and
ported a high-performance web-server to the AIO
interface. Although the prototype uses modern
single-core CPUs instead of future multi-core CPUs, an
analysis of its performance can reveal important
properties of this approach. Our experiments show that
the ETA+AIO prototype has a modest advantage over the
baseline Linux system in packet processing efficiency,
consuming fewer CPU cycles to sustain the same
throughput. This efficiency advantage enables the
ETA+AIO prototype to achieve higher peak throughput
than the baseline system, but only for workloads where
the mix of packet processing and application processing
approximately matches the allocation of CPUs in the
ETA+AIO system thereby enabling high utilization of all
the CPUs. Detailed analysis shows that the efficiency
advantage of the ETA+AIO prototype, which uses one PPE
CPU, comes from avoiding multiprocessing overheads in
packet processing, lower overhead of our AIO interface
compared to standard sockets, and reduced cache misses
due to processor partitioning.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "asynchronous I/O; network processing; TCP/IP",
}
@Article{Kim:2006:TOT,
author = "Hyong-youb Kim and Scott Rixner",
title = "{TCP} offload through connection handoff",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "279--290",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217962",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents a connection handoff interface
between the operating system and the network interface.
Using this interface, the operating system can offload
a subset of TCP connections in the system to the
network interface, while the remaining connections are
processed on the host CPU. Offloading can reduce
computation and memory bandwidth requirements for
packet processing on the host CPU. However, full TCP
offloading may degrade system performance because
finite processing and memory resources on the network
interface limit the amount of packet processing and the
number of connections. Using handoff, the operating
system controls the number of offloaded connections in
order to fully utilize the network interface without
overloading it. Handoff is transparent to the
application, and the operating system may choose to
offload connections to the network interface or reclaim
them from the interface at any time. A prototype system
based on the modified FreeBSD operating system shows
that handoff reduces the number of instructions and
cache misses on the host CPU. As a result, the number
of CPU cycles spent processing each packet decreases by
16--84\%. Simulation results show handoff can improve
web server throughput (SEPCweb99) by 15\%, despite
short-lived connections.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "connection handoff; operating system; programmable
network interface; TCP offload",
}
@Article{Mogul:2006:EMB,
author = "Jeffrey C. Mogul",
title = "Emergent (mis)behavior vs. complex software systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "293--304",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217964",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Complex systems often behave in unexpected ways that
are not easily predictable from the behavior of their
components; this is known as emergent behavior. As
software systems grow in complexity,
interconnectedness, and geographic distribution, we
will increasingly face unwanted emergent behavior.
Unpredictable software systems are hard to debug and
hard to manage. We need better tools and methods for
anticipating, detecting, diagnosing, and ameliorating
emergent misbehavior. These tools and methods will
require research into the causes and nature of emergent
misbehavior in software systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "complex systems; emergent behavior; emergent
misbehavior",
}
@Article{Shalev:2006:PLS,
author = "Ori Shalev and Nir Shavit",
title = "Predictive log-synchronization",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "305--315",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217965",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper proposes predictive log-synchronization, an
alternative paradigm to the software transactional
memory approach for simplifying the design of
concurrent data structures. Predictive
log-synchronization simplifies concurrent programming
and program verification by requiring programmers to
write only specialized sequential code. This sequential
code is then automatically transformed into a
non-blocking concurrent program in which threads
coordinate all data structure operations via a shared
lock-controlled log. The non-blocking progress property
is achieved by having threads that fail to acquire the
lock predict the outcome of their operations by reading
the log and state and computing the effect of these
operations without modifying the actual data structure.
Log-synchronization is founded on the belief (at this
point unsubstantiated by statistical data) that in many
concurrent data structures used in real-world
applications, the ratio of high level operations that
modify the structure to ones that simply read it,
greatly favors read-only operations, and what's more,
that many natural data structures have inherent
sequential bottlenecks limiting the concurrency among
operations that modify the structure. It follows that
delegating all data structure modifications to a single
lock-controlled thread at a time will not significantly
harm the throughput of modifying operations. Moreover,
as we show, it can boost read-only throughput by
significantly reducing the overhead of coordination
among concurrent operations, and provides a way to
simplify concurrent data structures. Initial
experimental testing using a Java-based implementation
of predictive log-synchronization showed that a
log-synchronized concurrent red-black tree is up to
five times faster than a simple lock-based one. This
paper presents our current understanding of the
advantages, drawbacks, and scope of predictive
log-synchronization.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "concurrent; monitor; prediction; synchronization",
}
@Article{Lv:2006:FTC,
author = "Qin Lv and William Josephson and Zhe Wang and Moses
Charikar and Kai Li",
title = "{Ferret}: a toolkit for content-based similarity
search of feature-rich data",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "317--330",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217966",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Building content-based search tools for feature-rich
data has been a challenging problem because
feature-rich data such as audio recordings, digital
images, and sensor data are inherently noisy and high
dimensional. Comparing noisy data requires comparisons
based on similarity instead of exact matches, and thus
searching for noisy data requires similarity search
instead of exact search. The Ferret toolkit is designed
to help system builders quickly construct content-based
similarity search systems for feature-rich data types.
The key component of the toolkit is a content-based
similarity search engine for generic, multi-feature
object representations. To solve the similarity search
problem in high-dimensional spaces, we have developed
approximation methods inspired by recent theoretical
results on dimension reduction. The search engine
constructs sketches from feature vectors as highly
compact data structures for matching, filtering and
ranking data objects. The toolkit also includes several
other components to help system builders address search
system infrastructure issues. We have implemented the
toolkit and used it to successfully construct
content-based similarity search systems for four data
types: audio recordings, digital photos, 3D shape
models and genomic microarray data.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "feature-rich data; similarity search; sketch;
toolkit",
}
@Article{Yu:2006:UUB,
author = "Hongliang Yu and Dongdong Zheng and Ben Y. Zhao and
Weimin Zheng",
title = "Understanding user behavior in large-scale
video-on-demand systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "333--344",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217968",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Video-on-demand over IP (VOD) is one of the best-known
examples of `next-generation' Internet applications
cited as a goal by networking and multimedia
researchers. Without empirical data, researchers have
generally relied on simulated models to drive their
design and developmental efforts. In this paper, we
present one of the first measurement studies of a large
VOD system, using data covering 219 days and more than
150,000 users in a VOD system deployed by China
Telecom. Our study focuses on user behavior, content
access patterns, and their implications on the design
of multimedia streaming systems. Our results also show
that when used to model the user-arrival rate, the
traditional Poisson model is conservative and
overestimates the probability of large arrival groups.
We introduce a modified Poisson distribution that more
accurately models our observations. We also observe a
surprising result, that video session lengths has a
weak inverse correlation with the video's popularity.
Finally, we gain better understanding of the sources of
video popularity through analysis of a number of
internal and external factors.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "modeling; Poisson distribution; user behavior;
video-on-demand",
}
@Article{Mohomed:2006:UUA,
author = "Iqbal Mohomed and Jim Chengming Cai and Eyal de
Lara",
title = "{URICA}: {Usage-awaRe Interactive Content Adaptation}
for mobile devices",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "345--358",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217969",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Usage-awaRe Interactive Content Adaptation (URICA) is
an automatic technique that adapts content for display
on mobile devices based on usage semantics. URICA
allows users who are unsatisfied with the system's
adaptation decision to take control of the adaptation
process and make changes until the content is suitably
adapted for their purposes. The successful adaptation
is recorded and used in making future adaptation
decisions. To validate URICA, we implemented a
prototype system called Chameleon that performs
fidelity adaptation on web images. We conducted a user
study in which participants used Chameleon to browse
image-rich web pages on bandwidth-limited cellular
links and used the collected traces to evaluate our
system. We show that Chameleon reduces the latency for
browsing web content by up to 65\% and reduces
bandwidth consumption by up to 80\%. Chameleon also
allows users to exchange bandwidth consumption for user
interaction based on their personal preferences.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "content adaptation; customization; learning; mobile
devices",
}
@Article{Handurukande:2006:PSB,
author = "S. B. Handurukande and A.-M. Kermarrec and F. {Le
Fessant} and L. Massouli{\'e} and S. Patarin",
title = "Peer sharing behaviour in the {eDonkey} network, and
implications for the design of server-less file sharing
systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "359--371",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217970",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we present an empirical study of a
workload gathered by crawling the eDonkey network --- a
dominant peer-to-peer file sharing system --- for over
50 days. We first confirm the presence of some known
features, in particular the prevalence of free-riding
and the Zipf-like distribution of file popularity. We
also analyze the evolution of document popularity. We
then provide an in-depth analysis of several clustering
properties of such workloads. We measure the
geographical clustering of peers offering a given file.
We find that most files are offered mostly by peers of
a single country, although popular files don't have
such a clear home country .We then analyze the overlap
between contents offered by different peers. We find
that peer contents are highly clustered according to
several metrics of interest. We propose to leverage
this property by allowing peers to search for content
without server support, by querying suitably identified
semantic neighbours. We find via trace-driven
simulations that this approach is generally effective,
and is even more effective for rare files. If we
further allow peers to query both their semantic
neighbours, and in turn their neighbours' neighbours,
we attain hit rates as high as over 55\% for neighbour
lists of size 20.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "file sharing; peer-to-peer; simulation; trace",
}
@Article{Yuan:2006:AKP,
author = "Chun Yuan and Ni Lao and Ji-Rong Wen and Jiwei Li and
Zheng Zhang and Yi-Min Wang and Wei-Ying Ma",
title = "Automated known problem diagnosis with event traces",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "375--388",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217972",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Computer problem diagnosis remains a serious challenge
to users and support professionals. Traditional
troubleshooting methods relying heavily on human
intervention make the process inefficient and the
results inaccurate even for solved problems, which
contribute significantly to user's dissatisfaction. We
propose to use system behavior information such as
system event traces to build correlations with solved
problems, instead of using only vague text descriptions
as in existing practices. The goal is to enable
automatic identification of the root cause of a problem
if it is a known one, which would further lead to its
resolution. By applying statistical learning techniques
to classifying system call sequences, we show our
approach can achieve considerable accuracy of root
cause recognition by studying four case examples.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "root cause analysis; support vector machine; system
call sequences",
}
@Article{Singh:2006:UQD,
author = "Atul Singh and Petros Maniatis and Timothy Roscoe and
Peter Druschel",
title = "Using queries for distributed monitoring and
forensics",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "389--402",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217973",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Distributed systems are hard to build, profile, debug,
and test. Monitoring a distributed system --- to detect
and analyze bugs, test for regressions, identify
fault-tolerance problems or security compromises --- can
be difficult and error-prone. In this paper we argue
that declarative development of distributed systems is
well suited to tackle these tasks. We present an
application logging, monitoring, and debugging facility
that we have built on top of the P2 system, comprising
an introspection model, an execution tracing component,
and a distributed query processor. We use this facility
to demonstrate a range of on-line distributed diagnosis
tools that range from simple, local state assertions to
sophisticated global property detectors on consistent
snapshots. These tools are small, simple, and can be
deployed piecemeal on-line at any point during a
system's life cycle. Our evaluation suggests that the
overhead of our approach to improving and monitoring
running distributed systems continuously is well in
tune with its benefits.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "declarative overlays; distributed debugging;
distributed monitoring; invariant checking",
}
@Article{Merkel:2006:BPC,
author = "Andreas Merkel and Frank Bellosa",
title = "Balancing power consumption in multiprocessor
systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "403--414",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1218063.1217974",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Actions usually taken to prevent processors from
overheating, such as decreasing the frequency or
stopping the execution flow, also degrade performance.
Multiprocessor systems, however, offer the possibility
of moving the task that caused a CPU to overheat away
to some other, cooler CPU, so throttling becomes only a
last resort taken if all of a system's processors are
hot. Additionally, the scheduler can take advantage of
the energy characteristics of individual tasks, and
distribute hot tasks as well as cool tasks evenly among
all CPUs. This work presents a mechanism for
determining the energy characteristics of tasks by
means of event monitoring counters, and an energy-aware
scheduling policy that strives to assign tasks to CPUs
in a way that avoids overheating individual CPUs. Our
evaluations show that the benefit of avoiding
throttling outweighs the overhead of additional task
migrations, and that energy-aware scheduling in many
cases increases the system's throughput.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "energy-aware scheduling; energy estimation; event
counters; task migration; thermal management",
}
@Article{Rosenblum:2006:IVC,
author = "Mendel Rosenblum",
title = "Impact of virtualization on computer architecture and
operating systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "1--1",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Adams:2006:CSH,
author = "Keith Adams and Ole Agesen",
title = "A comparison of software and hardware techniques for
{x86} virtualization",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "2--13",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jones:2006:GMB,
author = "Stephen T. Jones and Andrea C. Arpaci-Dusseau and
Remzi H. Arpaci-Dusseau",
title = "{Geiger}: monitoring the buffer cache in a virtual
machine environment",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "14--24",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Crandall:2006:TSD,
author = "Jedidiah R. Crandall and Gary Wassermann and Daniela
A. S. de Oliveira and Zhendong Su and S. Felix Wu and
Frederic T. Chong",
title = "Temporal search: detecting hidden malware timebombs
with virtual machines",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "25--36",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lu:2006:ADA,
author = "Shan Lu and Joseph Tucek and Feng Qin and Yuanyuan
Zhou",
title = "{AVIO}: detecting atomicity violations via access
interleaving invariants",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "37--48",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xu:2006:RTR,
author = "Min Xu and Mark D. Hill and Rastislav Bodik",
title = "A regulated transitive reduction ({RTR}) for longer
memory race recording",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "49--60",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bond:2006:BBE,
author = "Michael D. Bond and Kathryn S. McKinley",
title = "{Bell}: bit-encoding online memory leak detection",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "61--72",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shyam:2006:ULC,
author = "Smitha Shyam and Kypros Constantinides and Sujay
Phadke and Valeria Bertacco and Todd Austin",
title = "Ultra low-cost defect protection for microprocessor
pipelines",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "73--82",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reddy:2006:UPB,
author = "Vimal K. Reddy and Eric Rotenberg and Sailashri
Parthasarathy",
title = "Understanding prediction-based partial redundant
threading for low-overhead, high-coverage fault
tolerance",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "83--94",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Parashar:2006:SSB,
author = "Angshuman Parashar and Anand Sivasubramaniam and
Sudhanva Gurumurthi",
title = "{SlicK}: slice-based locality exploitation for
efficient redundant multithreading",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "95--105",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heath:2006:MFT,
author = "Taliver Heath and Ana Paula Centeno and Pradeep George
and Luiz Ramos and Yogesh Jaluria",
title = "{Mercury} and {Freon}: temperature emulation and
management for server systems",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "106--116",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kgil:2006:PUS,
author = "Taeho Kgil and Shaun D'Souza and Ali Saidi and Nathan
Binkert and Ronald Dreslinski and Trevor Mudge and
Steven Reinhardt and Krisztian Flautner",
title = "{PicoServer}: using {$3$D} stacking technology to
enable a compact energy efficient chip multiprocessor",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "117--128",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Coons:2006:SPS,
author = "Katherine E. Coons and Xia Chen and Doug Burger and
Kathryn S. McKinley and Sundeep K. Kushwaha",
title = "A spatial path scheduling algorithm for {EDGE}
architectures",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "129--140",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mercaldi:2006:IST,
author = "Martha Mercaldi and Steven Swanson and Andrew Petersen
and Andrew Putnam and Andrew Schwerin and Mark Oskin
and Susan J. Eggers",
title = "Instruction scheduling for a tiled dataflow
architecture",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "141--150",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gordon:2006:ECG,
author = "Michael I. Gordon and William Thies and Saman
Amarasinghe",
title = "Exploiting coarse-grained task, data, and pipeline
parallelism in stream programs",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "151--162",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mishra:2006:TES,
author = "Mahim Mishra and Timothy J. Callahan and Tiberiu
Chelcea and Girish Venkataramani and Seth C. Goldstein
and Mihai Budiu",
title = "{Tartan}: evaluating spatial computation for whole
program execution",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "163--174",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eyerman:2006:PCA,
author = "Stijn Eyerman and Lieven Eeckhout and Tejas Karkhanis
and James E. Smith",
title = "A performance counter architecture for computing
accurate {CPI} components",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "175--184",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lee:2006:AER,
author = "Benjamin C. Lee and David M. Brooks",
title = "Accurate and efficient regression modeling for
microarchitectural performance and power prediction",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "185--194",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ipek:2006:EEA,
author = "Engin {\"I}pek and Sally A. McKee and Rich Caruana and
Bronis R. de Supinski and Martin Schulz",
title = "Efficiently exploring architectural design spaces via
predictive modeling",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "195--206",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kharbutli:2006:CEP,
author = "Mazen Kharbutli and Xiaowei Jiang and Yan Solihin and
Guru Venkataramani and Milos Prvulovic",
title = "Comprehensively and efficiently protecting the heap",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "207--218",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chilimbi:2006:HIH,
author = "Trishul M. Chilimbi and Vinod Ganapathy",
title = "{HeapMD}: identifying heap-based bugs using anomaly
detection",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "219--228",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Narayanasamy:2006:RSM,
author = "Satish Narayanasamy and Cristiano Pereira and Brad
Calder",
title = "Recording shared memory dependencies using strata",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "229--240",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patwardhan:2006:DTS,
author = "Jaidev P. Patwardhan and Vijeta Johri and Chris Dwyer
and Alvin R. Lebeck",
title = "A defect tolerant self-organizing nanoscale {SIMD}
architecture",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "241--251",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schuchman:2006:PTA,
author = "Ethan Schuchman and T. N. Vijaykumar",
title = "A program transformation and architecture support for
quantum uncomputation",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "252--263",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mysore:2006:IC,
author = "Shashidhar Mysore and Banit Agrawal and Navin
Srivastava and Sheng-Chih Lin and Kaustav Banerjee and
Tim Sherwood",
title = "Introspective {$3$D} chips",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "264--273",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cantin:2006:SP,
author = "Jason F. Cantin and Mikko H. Lipasti and James E.
Smith",
title = "Stealth prefetching",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "274--282",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chakraborty:2006:CSE,
author = "Koushik Chakraborty and Philip M. Wells and Gurindar
S. Sohi",
title = "Computation spreading: employing hardware migration to
specialize {CMP} cores on-the-fly",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "283--292",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:2006:SBI,
author = "Jason E. Miller and Anant Agarwal",
title = "Software-based instruction caching for embedded
processors",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "293--302",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2006:MEM,
author = "Xin Li and Marian Boldt and Reinhard von Hanxleden",
title = "Mapping {Esterel} onto a multi-threaded embedded
processor",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "303--314",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Binkert:2006:INI,
author = "Nathan L. Binkert and Ali G. Saidi and Steven K.
Reinhardt",
title = "Integrated network interfaces for high-bandwidth
{TCP\slash IP}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "315--324",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tarditi:2006:AUD,
author = "David Tarditi and Sidd Puri and Jose Oglesby",
title = "{Accelerator}: using data parallelism to program
{GPUs} for general-purpose uses",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "325--335",
month = dec,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1168857.1168898",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "GPUs are difficult to program for general-purpose
uses. Programmers can either learn graphics APIs and
convert their applications to use graphics pipeline
operations or they can use stream programming
abstractions of GPUs. We describe Accelerator, a system
that uses data parallelism to program GPUs for
general-purpose uses instead. Programmers use a
conventional imperative programming language and a
library that provides only high-level data-parallel
operations. No aspects of GPUs are exposed to
programmers. The library implementation compiles the
data-parallel operations on the fly to optimized GPU
pixel shader code and API calls.We describe the
compilation techniques used to do this. We evaluate the
effectiveness of using data parallelism to program GPUs
by providing results for a set of compute-intensive
benchmarks. We compare the performance of Accelerator
versions of the benchmarks against hand-written pixel
shaders. The speeds of the Accelerator versions are
typically within 50\% of the speeds of hand-written
pixel shader code. Some benchmarks significantly
outperform C versions on a CPU: they are up to 18 times
faster than C code running on a CPU.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Damron:2006:HTM,
author = "Peter Damron and Alexandra Fedorova and Yossi Lev",
title = "Hybrid transactional memory",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "336--346",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chuang:2006:UPB,
author = "Weihaw Chuang and Satish Narayanasamy and Ganesh
Venkatesh and Jack Sampson and Michael {Van Biesbrouck}
and Gilles Pokam and Brad Calder and Osvaldo Colavin",
title = "Unbounded page-based transactional memory",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "347--358",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Moravan:2006:SNT,
author = "Michelle J. Moravan and Jayaram Bobba and Kevin E.
Moore and Luke Yen and Mark D. Hill and Ben Liblit and
Michael M. Swift and David A. Wood",
title = "Supporting nested transactional memory in {logTM}",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "359--370",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chung:2006:TTM,
author = "JaeWoong Chung and Chi Cao Minh and Austen McDonald
and Travis Skare and Hassan Chafi and Brian
D. Carlstrom and Christos Kozyrakis and Kunle Olukotun",
title = "Tradeoffs in transactional memory virtualization",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "371--381",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kawahito:2006:NIR,
author = "Motohiro Kawahito and Hideaki Komatsu and Takao
Moriyama and Hiroshi Inoue and Toshio Nakatani",
title = "A new idiom recognition framework for exploiting
hardware-assist instructions",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "382--393",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bansal:2006:AGP,
author = "Sorav Bansal and Alex Aiken",
title = "Automatic generation of peephole superoptimizers",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "394--403",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Solar-Lezama:2006:CSF,
author = "Armando Solar-Lezama and Liviu Tancau and Rastislav
Bodik and Sanjit Seshia and Vijay Saraswat",
title = "Combinatorial sketching for finite programs",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "404--415",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{DaSilva:2006:PPA,
author = "Jeff {Da Silva} and J. Gregory Steffan",
title = "A probabilistic pointer analysis for speculative
optimizations",
journal = j-OPER-SYS-REV,
volume = "40",
number = "5",
pages = "416--425",
month = dec,
year = "2006",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Oct 27 06:18:30 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Matthews:2007:OSR,
author = "Jeanna N. Matthews",
title = "Operating systems review: year in review",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "1--2",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228292",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This issue marks the one-year anniversary of the new
publication policy for Operating Systems Review. I hope
you have enjoyed the new format and would welcome any
comments or suggestions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fleisch:2007:PDC,
author = "Brett D. Fleisch",
title = "Program director's column: can nuggets make a
difference?",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "3--4",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228293",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Jim Cramer's Mad Money program on CNBC points out
rules to invest by which are prudent when managing and
investing in the stock market. Creating a portfolio of
investments is not necessarily an easy thing. Even more
long term, being a manager of a research portfolio
means knowing how and where to make investments, having
a competent set of reviewers to assess those
investments, determining what investments are likely to
be of value to the community, determining the next
generation leading computer scientists and achieving
the best reward for the community by a modest
investment of 9 Million to 10 Million dollars (which is
what I have to work with). NSF invests in people,
ideas, and tools proposed by our community. A Program
Director is in essence a technical manager of a
portfolio of investments; it is hard to gear the
`payoff' to the community when one is a good NSF
portfolio manager because there is no day-to-day stock
price to determine how well the portfolio is doing. In
fact, while I have been at NSF we have about the same
amount of investment funds for the Parallel and
Distributed Operating Systems (PDOS) community. But
yes, there is a yearly report and there are nuggets.
The yearly report provides a nice indication of
research accomplishments, impact, and publication
output; let's focus on nuggets however.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Riedel:2007:I,
author = "Erik Riedel",
title = "Introduction",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "5--6",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228295",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The topic area of file systems has traditionally been
a part of the larger research area of operating
systems. Research work in storage systems, often
focusing more on the hardware aspects, has appeared in
research areas including computer architecture and
computer systems. As outlined below, there are also
many related research areas that impact the technology
for stored data, including databases, computer
security, ubiquitous computing, human-computer
interaction, knowledge management, performance
evaluation, high-performance computing and even
computer networking.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Deng:2007:HSG,
author = "Yuhui Deng and Frank Wang",
title = "A heterogeneous storage grid enabled by grid service",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "7--13",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228296",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Due to the explosive increase of data, storage Grid is
a new model for deploying and managing storage
resources distributed across multiple systems and
networks, making efficient use of available storage
capacity. Building a storage Grid demands corresponding
protocols and standards to provide interoperability
among the large number of heterogeneous storage
systems. Service is becoming a basic application
pattern of Grid because the service offers a standard
means of interoperating between different applications
running on a variety of platforms. This paper proposes
a storage Grid architecture that wraps all distributed
and heterogeneous storage resources into Grid services
to provide transparent, remote, and on demand data
access. The storage oriented Grid service can be
considered as a basic building block of an infinite
storage pool which provides good scalability through
its inherent parallelism, and facilitates simple
incremental resource expansion (to add storage
resources, one just adds storage services). Grid users
can stack simple modular storage service piece by piece
as demand grows instead of buying monolithic storage
systems. An implemented proof-of-concept prototype
validates that the storage Grid architecture trade 5\%
(at most) performance degradation for an infinite and
heterogeneous storage pool.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "architecture; grid service; heterogeneous storage
system; interoperability; storage grid; web service",
}
@Article{Vazhkudai:2007:RTD,
author = "Sudharshan Vazhkudai and Xiaosong Ma",
title = "Recovering transient data: automated on-demand data
reconstruction and offloading for supercomputers",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "14--18",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228297",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "It has become a national priority to build and use
PetaFlop supercomputers. The dependability of such
large systems has been recognized as a key issue that
can impact their usability. Even with smaller, existing
machines, failures are the norm rather than an
exception. Research has shown that storage systems are
the primary source of faults leading to supercomputer
unavailability. In this paper, we envision two
mechanisms, namely on-demand data reconstruction and
eager data offloading, to address the availability of
job input/output data. These two techniques aim to
allow parallel jobs and post-job processing tools to
continue execution despite storage system failures in
supercomputers. Fundamental to both approaches is the
definition and acquisition of recovery-related parallel
file system metadata, which is then coupled with
transparent remote data accesses. Our approach attempts
to maximize the utilization of precious supercomputer
resources by improving the accessibility of transient
job data. Further, the proposed methods are best-effort
in nature and complement existing file system recovery
schemes, which are designed for persistent data.
Several of our previous studies help in demonstrating
the feasibility of the proposed approaches.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "data reconstruction; file system recovery;
supercomputer availability",
}
@Article{Factor:2007:NPA,
author = "Michael Factor and Dalit Naor and Simona
Rabinovici-Cohen and Leeat Ramati and Petra Reshef and
Julian Satran",
title = "The need for preservation aware storage: a position
paper",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "19--23",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228298",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Digital Preservation deals with ensuring that digital
data stored today can be read and interpreted tens or
hundreds of years from now. At the heart of any
solution to the preservation problem lies a storage
component. This paper characterizes the requirements
for such a component, defines its desirable properties
and presents the need for preservation-aware storage
systems. Our research is conducted as part of CASPAR, a
new European Union (EU) integrated project on the
preservation of data for very long periods of time. The
position presented was developed while designing the
storage foundation for the CASPAR software framework.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jambor:2007:ILL,
author = "Martin Jambor and Tomas Hruby and Jan Taus and Kuba
Krchak and Viliam Holub",
title = "Implementation of a {Linux} log-structured file system
with a garbage collector",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "24--32",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228299",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In many workloads, most write operations performed on
a file system modify only a small number of blocks. The
log-structured file system was designed for such a
workload, additionally with the aim of fast crash
recovery and system snapshots. Surprisingly, although
implemented for Berkeley Sprite and BSD systems, there
was no complete implementation for the current Linux
kernel. In this paper, we present a complete
implementation of the log-structured file system for
the Linux kernel, which includes a user-space garbage
collector and additional tools. We evaluate the
measurements obtained in several test cases and compare
the results with widely-used ext3.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "garbage collection; Linux file systems; log-structured
file systems",
}
@Article{Gurumurthi:2007:SDS,
author = "Sudhanva Gurumurthi",
title = "Should disks be speed demons or brainiacs?",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "33--36",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228300",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Disk drives play a critical role on the performance of
I/O intensive applications. Over the years, disk drive
performance has grown as a result of advances in
magnetic recording density and faster rotational
speeds. In essence, the performance driver in disks has
been the data rate. In this paper, we show that data
rate is going to be increasingly difficult to optimize,
due to power/thermal constraints. We argue that disk
drive designers should instead focus their efforts on
providing more computational capabilities that data
intensive applications could leverage in order to boost
performance. We also discuss the scope for provisioning
powerful processors inside disk drives to provide these
computational capabilities.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chandy:2007:RTP,
author = "John A. Chandy and Sumit Narayan",
title = "Reliability tradeoffs in personal storage systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "37--41",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228301",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "RAID has long been established as an effective way to
provide highly reliable disk subsystems. However,
reliability in RAID systems comes at the cost of extra
disks and somewhat lower performance. In this paper, we
examine some mechanisms to reduce this cost in the
context of integration with backup processes. These
methods are most useful in storage systems where
complete data protection or availability is not
necessary such as in desktop personal computers,
laptops, and other mobile storage devices. We will in
particular investigate strategies with disk and flash
that trade off between availability and reliability,
snapshotting tradeoffs of reliability between time and
space, and user directed redundancy.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Garfinkel:2007:CDV,
author = "Simson L. Garfinkel",
title = "Complete delete vs. time machine computing",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "42--44",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228302",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Users are increasingly demanding two contradictory
system properties --- the ability to absolutely,
positively erase information so that it cannot be
recovered, and the ability to recover information that
was inadvertently or intentionally altered or deleted.
Storage system designers now need to resolve the
tension between complete delete and time machine
computing.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "complete delete; file vault; MacOS; secure empty
trash; time machine computing",
}
@Article{Robinson:2007:HAM,
author = "Jeffrey Choi Robinson and Jim Alves-Foss",
title = "A high assurance {MLS} file server",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "45--53",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228303",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we present the design of a high
assurance file server model developed to operate within
the Multiple Independent Levels of Security framework.
The file server model is a multilevel application that
utilizes separation to mediate information flow by
adhering to a security policy formulated from a
modified version of the Bell and LaPadula Model and the
GWVr2 policy, which is a separation kernel based policy
developed for high assurance architectures. This paper
focuses on the design aspects of the file server model
and the underlying architecture. The purpose of this
file server design is to develop a formal model to meet
the formal methods requirement of Common Criteria,
which is a system design and specification guideline
for high assurance systems. The model is also an
example application for the Multiple Independent Levels
of Security architecture.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Arpaci-Dusseau:2007:CPH,
author = "Remzi H. Arpaci-Dusseau",
title = "{CS 736} project highlights from {U. Wisconsin}: how
students spend their days and nights in a winter
wonderland",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "54--55",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228305",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Welcome! I found myself quite excited at this
opportunity to wax poetic (i.e., drone on and on) about
class projects here at the University of Wisconsin,
Madison. Why, you ask? Or perhaps you have already
stopped reading. For the simple reason that while one
so often gets a chance to describe research (in papers,
grants, talks, and late-night discussions with one's
spouse), there are seemingly so few times where one can
present pedagogical material.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Apte:2007:APL,
author = "Himani Apte and Meenali Rungta",
title = "Adding parity to the {Linux} {\tt ext3} file system",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "56--65",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228306",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modern disks no longer operate in a simple `fail-stop'
manner, yet commodity operating systems assume they do.
We design and implement a parity based approach to
improve the robustness of journaling file systems. We
modify the existing {\tt ext3} file system for data and
ordered journaling modes to incorporate parity and call
it the `Parity File System'. Using PFS, we are able to
recover from a single latent sector error or silent
block corruption within a given file. We show that the
performance overhead for PFS compared to {\tt ext3} is
minimal while the robustness is significantly
improved.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ramamurthy:2007:PDE,
author = "Pratap Ramamurthy and Ramanathan Palaniappan",
title = "Performance-directed energy management using {{\em
BOS\/}}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "66--77",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228307",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "One of the major challenges in today's computing world
is energy management in portable devices and servers.
Power management is essential to increase battery life.
High end server systems use large clusters of machines
that consume enormous amount of power. Past research
has devised both software and hardware techniques to
memory energy management but has overlooked the
performance of applications in such environments. The
result is that some of these techniques slowed down an
application by 835\%. In this paper, we look at
software techniques for memory energy management
without compromising on performance. The paper
conceives of a new approach called BOS --- Ballooning in
the OS inspired from the VMware ESX server. The BOS
approach consists of a kernel daemon which continuously
monitors the accesses to memory chips and disk I/O.
Based on the profiled information, the BOS daemon
decides about powering down/up chips. Powering down is
emulated within the kernel using mechanisms such as
page migration and invisible buddy. Results indicate
that chips with more allocated pages may not always be
the most frequently accessed ones. A study has been
done analyzing the effect of decreased memory size on
disk activity and based on the study, a threshold based
policy is proposed which is found to settle in the
operating point for a simple application. A single page
migration incurs a cost of approximately 134$\mu$s and
is one of the bottlenecks in the BOS approach.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Miller:2007:ESR,
author = "Barton P. Miller and Gregory Cooksey and Fredrick
Moore",
title = "An empirical study of the robustness of {MacOS}
applications using random testing",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "78--86",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228308",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We report on the fourth in a series of studies on the
reliability of application programs in the face of
random input. Over the previous 15 years, we have
studied the reliability of UNIX command line and
X-Window based (GUI) applications and Windows
applications. In this study, we apply our fuzz testing
techniques to applications running on the Mac OS X
operating system. We continue to use a simple, or even
simplistic technique: unstructured black-box random
testing, considering a failure to be a crash or hang.
As in the previous three studies, the technique is
crude but seems to be effective in locating bugs in
real programs. We tested the reliability of 135
command-line UNIX utilities and thirty graphical
applications on Mac OS X by feeding random input to
each. We report on application failures --- crashes
(dumps core) or hangs (loops indefinitely) --- and, where
source code is available, we identify the causes of
these failures and categorize them. Our testing crashed
only 7\% of the command-line utilities, a considerably
lower rate of failure than observed in almost all cases
of previous studies. We found the GUI-based
applications to be less reliable: of the thirty that we
tested, only eight did not crash or hang. Twenty others
crashed, and two hung. These GUI results were
noticeably worse than either of the previous Windows
(Win32) or UNIX (X-Windows) studies.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "fuzz; random testing",
}
@Article{Emmerich:2007:IRM,
author = "Wolfgang Emmerich and Mikio Aoyama and Joe Sventek",
title = "The impact of research on middleware technology",
journal = j-OPER-SYS-REV,
volume = "41",
number = "1",
pages = "89--112",
month = jan,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1228291.1228310",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:15:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The middleware market represents a sizable segment of
the overall Information and Communication Technology
market. In 2005, the annual middleware license revenue
was reported by Gartner to be in the region of 8.5
billion US Dollars. In this article we address the
question whether research had any involvement in the
creation of the technology that is being sold in this
market? We attempt a scholarly discourse. We present
the research method that we have applied to answer this
question. We then present a brief introduction into the
key middleware concepts that provide the foundation for
this market. It would not be feasible to investigate
any possible impact that research might have had.
Instead we select a few very successful technologies
that are representative for the middleware market as a
whole and show the existence of impact of research
results in the creation of these technologies. We
investigate the origins of web services middleware,
distributed transaction processing middleware, message
oriented middleware, distributed object middleware and
remote procedure call systems. For each of these
technologies we are able to show ample influence of
research and conclude that without the research
conducted by PhD students and researchers in university
computer science labs at Brown, CMU, Cambridge,
Newcastle, MIT, Vrije, and University of Washington as
well as research in industrial labs at APM, AT\&T Bell
Labs, DEC Systems Research, HP Labs, IBM Research and
Xerox PARC we would not have middleware technology in
its current form. We summarise the article by
distilling lessons that can be learnt from this
evidenced impact for future technology transfer
undertakings.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schroeder:2007:SWM,
author = "Michael D. Schroeder",
title = "Systems work at {Microsoft Research}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "1--2",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243419",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Operating Systems Review presents a special issue on
systems work at Microsoft Research. This introduction
sets the context for the papers.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Levin:2007:PCR,
author = "Roy Levin",
title = "A perspective on computing research management",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "3--9",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243420",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper offers a perspective on a particular set of
principles that have guided the development and enabled
the success of several noteworthy corporate research
labs in computer science. The paper examines the
differences between the corporate computing research
environment and academia, then describes the model for
managing research that Microsoft Research employs,
illustrating how it reflects those differences and what
the consequences are.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "computing research management; technology transfer",
}
@Article{Herbert:2007:WHP,
author = "Andrew Herbert",
title = "What happened to {Pastry}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "10--16",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243421",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes how Microsoft Research goes about
the process of technology transfer, using the
experience of transferring the MS Pastry Distributed
Hash Table and its applications as an example.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "technology transfer",
}
@Article{Bolosky:2007:FPR,
author = "William J. Bolosky and John R. Douceur and Jon
Howell",
title = "The {Farsite} project: a retrospective",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "17--26",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243422",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Farsite file system is a storage service that runs
on the desktop computers of a large organization and
provides the semantics of a central NTFS file server.
The motivation behind the Farsite project was to
harness the unused storage and network resources of
desktop computers to provide a service that is
reliable, available, and secure despite the fact that
it runs on machines that are unreliable, often
unavailable, and of limited security. A main premise of
the project has been that building a scalable system
requires more than scalable algorithms: To be scalable
in a practical sense, a distributed system targeting
10$^5$ nodes must tolerate a significant (and
never-zero) rate of machine failure, a small number of
malicious participants, and a substantial number of
opportunistic participants. It also must automatically
adapt to the arrival and departure of machines and
changes in machine availability, and it must be able to
autonomically repartition its data and metadata as
necessary to balance load and alleviate hotspots. We
describe the history of the project, including its
multiple versions of major system components, the
unique programming style and software-engineering
environment we created to facilitate development, our
distributed debugging framework, and our experiences
with formal system specification. We also report on the
lessons we learned during this development.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distributed debugging; formal system specification;
project management; serverless distributed file system;
software engineering; system design iteration; tech
transfer",
}
@Article{Zhang:2007:BHR,
author = "Zheng Zhang and Qiao Lian and Shiding Lin and Wei Chen
and Yu Chen and Chao Jin",
title = "{BitVault}: a highly reliable distributed data
retention platform",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "27--36",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243423",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper summarizes our experience designing and
implementing BitVault: a content-addressable retention
platform for large volumes of reference data --
seldom-changing information that needs to be retained
for a long time. BitVault uses `smart bricks' as the
building block to lower the hardware cost. The
challenges are to keep management costs low in a system
that scales from one brick to tens of thousands, to
ensure reliability, and to deliver a simple design. Our
design incorporates peer-to-peer (P2P) technologies for
self-managing and self-healing and uses massively
parallel repair to reduce system vulnerability to data
loss. The simplicity of the architecture relies on an
eventually reliable membership service provided by a
perfect one-hop distributed hash table (DHT). Its
object-driven repair model yields last-replica recall
guarantee independent of the failure scenario. So long
as the last copy of a data object remains in the
system, that data can be retrieved and its replication
degree can be restored. A prototype has been
implemented. Theoretical analysis, simulations and
experiments have been conducted to validate the design
of BitVault.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hunt:2007:SRS,
author = "Galen C. Hunt and James R. Larus",
title = "{Singularity}: rethinking the software stack",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "37--49",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243424",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Every operating system embodies a collection of design
decisions. Many of the decisions behind today's most
popular operating systems have remained unchanged, even
as hardware and software have evolved. Operating
systems form the foundation of almost every software
stack, so inadequacies in present systems have a
pervasive impact. This paper describes the efforts of
the Singularity project to re-examine these design
choices in light of advances in programming languages
and verification tools. Singularity systems incorporate
three key architectural features: software-isolated
processes for protection of programs and system
services, contract-based channels for communication,
and manifest-based programs for verification of system
properties. We describe this foundation in detail and
sketch the ongoing research in experimental systems
that build upon it.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "hardware protection domains; manifest-based programs
(MBPs); operating systems; program specification;
program verification; safe programming languages;
sealed kernel; sealed process architecture;
software-isolated processes (SIPs); unsafe code tax",
}
@Article{Elson:2007:MIW,
author = "Jeremy Elson and Jon Howell and John R. Douceur",
title = "{MapCruncher}: integrating the world's geographic
information",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "50--59",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243425",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Current large-scale interactive web mapping services
such as Virtual Earth and Google Maps use large
distributed systems for delivering data. However,
creation and editorial control of their content is
still largely centralized. The Composable Virtual Earth
project's goal is to allow seamless interoperability of
geographic data from arbitrary, distributed
sources.\par
MapCruncher is a first step in this direction. It lets
users easily create new interactive map data that can
be layered on top of existing imagery such as road maps
and aerial photography. MapCruncher geographically
registers and reprojects the user's map into a standard
coordinate system. It then emits metadata that makes it
easy for anyone on the Internet to find the published
map data and import it. Interactive maps them become
distributed, seamlessly composable building blocks --
similar to images in the early days of the Web.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "approximate reprojection; composition; decentralized
publishing; geographic coordinate systems; graphical
interactive georeferencing; image tiling; interactive
maps; map projections; mashups",
}
@Article{Isard:2007:AAD,
author = "Michael Isard",
title = "{Autopilot}: automatic data center management",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "60--67",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243426",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Microsoft is rapidly increasing the number of
large-scale web services that it operates. Services
such as Windows Live Search and Windows Live Mail
operate from data centers that contain tens or hundreds
of thousands of computers, and it is essential that
these data centers function reliably with minimal human
intervention. This paper describes the first version of
Autopilot, the automatic data center management
infrastructure developed within Microsoft over the last
few years. Autopilot is responsible for automating
software provisioning and deployment; system
monitoring; and carrying out repair actions to deal
with faulty software and hardware. A key assumption
underlying Autopilot is that the services built on it
must be designed to be manageable. We also therefore
outline the best practices adopted by applications that
run on Autopilot.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "automatic management; cluster computing",
}
@Article{Malkhi:2007:PRS,
author = "Dahlia Malkhi and Lev Novik and Chris Purcell",
title = "{P2P} replica synchronization with vector sets",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "68--74",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243427",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes an enhanced replica
synchronization mechanism built in Microsoft's WinFS
replica management system.\par
The system reconciles autonomously-operating replicas
in a completely peer-to-peer manner, without employing
a central master or locking. The main challenge is for
two replicas to exchange meta-information efficiently
about (potentially numerous) data objects in order to
discover what updates they are missing, and detect
conflicts.\par
The paper introduces a novel bundling mechanisms called
VS, that groups together multiple objects and
represents their state in a single version-vector. VS
provides improved storage and communication overheads
over previously known optimistic replication schemes,
in the following sense. Under normal, low-fault
situations, it maintains and communicates as little as
a single version vector in order to represent
precedence ordering of the entire set of data objects.
Moreover, under settings of severe communication
disruptions, VS degenerates to no worse than a single
vector per object. This dramatically improves the
complexities described in a preliminary write-up of the
WinFS replication scheme.\par
The VS mechanism has potentially wide applicability as
a mechanism for compactly handling synchronization of
arbitrarily overlapping groups of objects.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sheth:2007:SDL,
author = "Anmol Sheth and Chandramohan A. Thekkath and Prakshep
Mehta and Kalyan Tejaswi and Chandresh Parekh and
Trilok N. Singh and Uday B. Desai",
title = "{Senslide}: a distributed landslide prediction
system",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "75--87",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243428",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We describe the design, implementation, and current
status of Senslide, a distributed sensor system aimed
at predicting landslides in the hilly regions of
western India. Landslides in this region occur during
the monsoon rains and cause significant damage to
property and lives. Unlike existing solutions that
detect landslides in this region, our goal is to
predict them before they occur. Also, unlike previous
efforts that use a few but expensive sensors to measure
slope stability, our solution uses a large number of
inexpensive sensor nodes inter-connected by a wireless
network. Our system software is designed to tolerate
the increased failures such inexpensive components may
entail.\par
We have implemented our design in the small on a
laboratory testbed of 65 sensor nodes, and present
results from that testbed as well as simulation results
for larger systems up to 400 sensor nodes. Our results
are sufficiently encouraging that we intend to do a
field test of the system during the monsoon season in
India.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "fault tolerant; landslide prediction; sensor network
application",
}
@Article{Birrell:2007:DHP,
author = "Andrew Birrell and Michael Isard and Chuck Thacker and
Ted Wobber",
title = "A design for high-performance flash disks",
journal = j-OPER-SYS-REV,
volume = "41",
number = "2",
pages = "88--93",
month = apr,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1243418.1243429",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Most commodity flash disks exhibit very poor
performance when presented with writes that are not
sequentially ordered. We argue that performance can be
significantly improved through the addition of
sufficient RAM to hold data structures describing a
fine-grain mapping between disk logical blocks and
physical flash addresses. We present a design that
accomplishes this.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Olszewski:2007:JIN,
author = "Marek Olszewski and Keir Mierle and Adam Czajkowski
and Angela Demke Brown",
title = "{JIT} instrumentation: a novel approach to dynamically
instrument operating systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "3--16",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273000",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As modern operating systems become more complex,
understanding their inner workings is increasingly
difficult. Dynamic kernel instrumentation is a well
established method of obtaining insight into the
workings of an OS, with applications including
debugging, profiling and monitoring, and security
auditing. To date, all dynamic instrumentation systems
for operating systems follow the probe-based
instrumentation paradigm. While efficient on
fixed-length instruction set architectures, probes are
extremely expensive on variable-length ISAs such as the
popular Intel x86 and AMD x86-64. We propose using
just-in-time (JIT) instrumentation to overcome this
problem. While common in user space, JIT
instrumentation has not until now been attempted in
kernel space. In this work, we show the feasibility and
desirability of kernel-based JIT instrumentation for
operating systems with our novel prototype, implemented
as a Linux kernel module. The prototype is fully SMP
capable. We evaluate our prototype against the popular
Kprobes Linux instrumentation tool. Our prototype
outperforms Kprobes, at both micro and macro levels, by
orders of magnitude when applying medium- and
fine-grained instrumentation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "binary rewriting; dynamic instrumentation; JIT
compiler; kernel analysis tools",
}
@Article{Chanda:2007:WTP,
author = "Anupam Chanda and Alan L. Cox and Willy Zwaenepoel",
title = "{Whodunit}: transactional profiling for multi-tier
applications",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "17--30",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273001",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper is concerned with performance debugging of
multi-tier applications, such as commonly found in
servers and dynamic-content web sites. Existing tools
and techniques for profiling such applications are not
general enough to track and profile transactions in a
generic multi-tier application. We propose
transactional profiling that provides a general
solution to this problem. We provide novel algorithms
and techniques to track and profile transactions that
flow through shared memory, events, stages or via
interprocess communication using messages. We also
measure interference among concurrent
transactions.\par
We describe the design and implementation of Whodunit,
our prototype transactional profiler. We demonstrate
the correctness of our proposed algorithm for tracking
transaction flow through shared memory using Apache and
MySQL. Using Whodunit we are able to track and profile
transactions that flow through shared memory, events,
stages or via message passing, and measure the
interference among concurrent transactions. We
illustrate the use of Whodunit in obtaining the
transactional profile of web servers, a web proxy cache
and a bookstore application.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distribution; profiling",
}
@Article{Stewart:2007:ENP,
author = "Christopher Stewart and Terence Kelly and Alex
Zhang",
title = "Exploiting nonstationarity for performance
prediction",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "31--44",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273002",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Real production applications ranging from enterprise
applications to large e-commerce sites share a crucial
but seldom-noted characteristic: The relative
frequencies of transaction types in their workloads are
nonstationary, i.e., the transaction mix changes over
time. Accurately predicting application-level
performance in business-critical production
applications is an increasingly important problem.
However, transaction mix nonstationarity casts doubt on
the practical usefulness of prediction methods that
ignore this phenomenon.\par
This paper demonstrates that transaction mix
nonstationarity enables a new approach to predicting
application-level performance as a function of
transaction mix. We exploit nonstationarity to
circumvent the need for invasive instrumentation and
controlled benchmarking during model calibration; our
approach relies solely on lightweight passive
measurements that are routinely collected in today's
production environments. We evaluate predictive
accuracy on two real business-critical production
applications. The accuracy of our response time
predictions ranges from 10\% to 16\% on these
applications, and our models generalize well to
workloads very different from those used for
calibration.\par
We apply our technique to the challenging problem of
predicting the impact of application consolidation on
transaction response times. We calibrate models of two
testbed applications running on dedicated machines,
then use the models to predict their performance when
they run together on a shared machine and serve very
different workloads. Our predictions are accurate to
within 4\% to 14\%. Existing approaches to
consolidation decision support predict
post-consolidation resource utilizations. Our method
allows application-level performance to guide
consolidation decisions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "enterprise; internet services; LAR regression;
mutli-tier; noninvasive; nonstationarity; performance
prediction; realistic workloads",
}
@Article{Tam:2007:TCS,
author = "David Tam and Reza Azimi and Michael Stumm",
title = "Thread clustering: sharing-aware scheduling on
{SMP--CMP--SMT} multiprocessors",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "47--58",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273004",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The major chip manufacturers have all introduced chip
multiprocessing (CMP) and simultaneous multithreading
(SMT) technology into their processing units. As a
result, even low-end computing systems and game
consoles have become shared memory multiprocessors with
L1 and L2 cache sharing within a chip. Mid- and
large-scale systems will have multiple processing chips
and hence consist of an SMP-CMP-SMT configuration with
non-uniform data sharing overheads. Current operating
system schedulers are not aware of these new cache
organizations, and as a result, distribute threads
across processors in a way that causes many
unnecessary, long-latency cross-chip cache
accesses.\par
In this paper we describe the design and implementation
of a scheme to schedule threads based on sharing
patterns detected online using features of standard
performance monitoring units (PMUs) available in
today's processing units. The primary advantage of
using the PMU infrastructure is that it is fine-grained
(down to the cache line) and has relatively low
overhead. We have implemented our scheme in Linux
running on an 8- way Power5 SMP-CMP-SMT
multi-processor. For commercial multithreaded server
workloads (VolanoMark, SPECjbb, and RUBiS), we are able
to demonstrate reductions in cross-chip cache accesses
of up to 70\%. These reductions lead to
application-reported performance improvements of up to
7\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "affinity scheduling; cache behavior; cache locality;
CMP; detecting sharing; hardware performance counters;
hardware performance monitors; multithreading;
performance monitoring unit; resource allocation;
shared caches; sharing; simultaneous multithreading;
single-chip multiprocessors; SMP; SMT; thread
migration; thread placement; thread scheduling",
}
@Article{Isard:2007:DDD,
author = "Michael Isard and Mihai Budiu and Yuan Yu and Andrew
Birrell and Dennis Fetterly",
title = "{Dryad}: distributed data-parallel programs from
sequential building blocks",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "59--72",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273005",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Dryad is a general-purpose distributed execution
engine for coarse-grain data-parallel applications. A
Dryad application combines computational `vertices'
with communication `channels' to form a dataflow graph.
Dryad runs the application by executing the vertices of
this graph on a set of available computers,
communicating as appropriate through flies, TCP pipes,
and shared-memory FIFOs.\par
The vertices provided by the application developer are
quite simple and are usually written as sequential
programs with no thread creation or locking.
Concurrency arises from Dryad scheduling vertices to
run simultaneously on multiple computers, or on
multiple CPU cores within a computer. The application
can discover the size and placement of data at run
time, and modify the graph as the computation
progresses to make efficient use of the available
resources.\par
Dryad is designed to scale from powerful multi-core
single computers, through small clusters of computers,
to data centers with thousands of computers. The Dryad
execution engine handles all the difficult problems of
creating a large distributed, concurrent application:
scheduling the use of computers and their CPUs,
recovering from communication or computer failures, and
transporting data between vertices.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cluster computing; concurrency; dataflow; distributed
programming",
}
@Article{Saha:2007:ESP,
author = "Bratin Saha and Ali-Reza Adl-Tabatabai and Anwar
Ghuloum and Mohan Rajagopalan and Richard L. Hudson and
Leaf Petersen and Vijay Menon and Brian Murphy and
Tatiana Shpeisman and Eric Sprangle and Anwar Rohillah
and Doug Carmean and Jesse Fang",
title = "Enabling scalability and performance in a large scale
{CMP} environment",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "73--86",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273006",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Hardware trends suggest that large-scale CMP
architectures, with tens to hundreds of processing
cores on a single piece of silicon, are imminent within
the next decade. While existing CMP machines have
traditionally been handled in the same way as SMPs,
this magnitude of parallelism introduces several
fundamental challenges at the architectural level and
this, in turn, translates to novel challenges in the
design of the software stack for these platforms. This
paper presents the `Many Core Run Time' (McRT), a
software prototype of an integrated language runtime
that was designed to explore configurations of the
software stack for enabling performance and scalability
on large scale CMP platforms. This paper presents the
architecture of McRT and discusses our experiences with
the system, including experimental evaluation that lead
to several interesting, non-intuitive findings,
providing key insights about the structure of the
system stack at this scale. A key contribution of this
paper is to demonstrate how McRT enables near linear
improvements in performance and scalability for desktop
workloads such as the popular XviD encoder and a set of
RMS (recognition, mining, and synthesis) applications.
Another key contribution of this work is its use of
McRT to explore non-traditional system configurations
such as a light-weight executive in which McRT runs on
`bare metal' and replaces the traditional OS. Such
configurations are becoming an increasingly attractive
alternative to leverage heterogeneous computing uints
as seen in today's CPU-GPU configurations.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "memory management; multi-core processors; parallel
programming; runtime design; scheduler design;
sequestered mode; synchronization primitives;
transactional memory",
}
@Article{So:2007:LBM,
author = "Kelvin C. W. So and Emin G{\"u}n Sirer",
title = "Latency and bandwidth-minimizing failure detectors",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "89--99",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273008",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Failure detectors are fundamental building blocks in
distributed systems. Multi-node failure detectors,
where the detector is tasked with monitoring N other
nodes, play a critical role in overlay networks and
peer-to-peer systems. In such networks, failures need
to be detected quickly and with low overhead. Achieving
these properties simultaneously poses a difficult
tradeoff between detection latency and resource
consumption.\par
In this paper, we examine this central tradeoff,
formalize it as an optimization problem and
analytically derive the optimal closed form formulas
for multi-node failure detectors. We provide two
variants of the optimal solution for optimality metrics
appropriate for two different deployment scenarios.
$\sqrt{s}$-LM is a latency-minimizing optimal failure
detector that achieves the lowest average failure
detection latency given a fixed bandwidth constraint
for system maintenance. $\sqrt{s}$-BM is a
bandwidth-minimizing optimal failure detector that
meets a desired detection latency target with the least
amount of bandwidth consumed. We evaluate our optimal
results with node lifetimes chosen from bimodal and
Pareto distributions, as well as real-world trace data
from PlanetLab hosts, web sites and Microsoft PCs.
Compared to standard failure detectors in wide use,
$\sqrt{s}$ failure detectors reduce failure detection
latencies by 40\% on average for the same bandwidth
consumption, or conversely, reduce the amount of
bandwidth consumed by 30\% for the same failure
detection latency.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "failure detection; overlays; wide-area networks",
}
@Article{Madhavapeddy:2007:MCF,
author = "Anil Madhavapeddy and Alex Ho and Tim Deegan and David
Scott and Ripduman Sohan",
title = "{Melange}: creating a `functional' {Internet}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "101--114",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273009",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Most implementations of critical Internet protocols
are written in type-unsafe languages such as C or C++
and are regularly vulnerable to serious security and
reliability problems. Type-safe languages eliminate
many errors but are not used to due to the perceived
performance overheads.\par
We combine two techniques to eliminate this performance
penalty in a practical fashion: strong static typing
and generative meta-programming. Static typing
eliminates run-time type information by checking safety
at compile-time and minimises dynamic checks.
Meta-programming uses a single specification to
abstract the low-level code required to transmit and
receive packets.\par
Our domain-specific language, MPL, describes Internet
packet protocols and compiles into fast, zero-copy code
for both parsing and creating these packets. MPL is
designed for implementing quirky Internet protocols
ranging from the low-level: Ethernet, IPv4, ICMP and
TCP; to the complex application-level: SSH, DNS and
BGP; and even file-system protocols such as 9P.\par
We report on fully-featured SSH and DNS servers
constructed using MPL and our OCaml framework Melange,
and measure greater throughput, lower latency, better
flexibility and more succinct source code than their C
equivalents OpenSSH and BIND. Our quantitative analysis
shows that the benefits of MPL-generated code overcomes
the additional overheads of automatic garbage
collection and dynamic bounds checking. Qualitatively,
the flexibility of our approach shows that dramatic
optimisations are easily possible.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tucek:2007:SLE,
author = "Joseph Tucek and James Newsome and Shan Lu and Chengdu
Huang and Spiros Xanthos and David Brumley and Yuanyuan
Zhou and Dawn Song",
title = "{Sweeper}: a lightweight end-to-end system for
defending against fast worms",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "115--128",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273010",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The vulnerabilities that plague computers cause
endless grief to users. Slammer compromised millions of
hosts in minutes; a hit-list worm would take under a
second. Recently proposed techniques respond better
than manual approaches, but require expensive
instrumentation, which limits deployment. Although
spreading `antibodies' (e.g. signatures) ameliorates
this limitation, hosts depending on antibodies are
defenseless until inoculation; to the fastest hit-list
worms this delay is crucial. Additionally, most
recently proposed techniques cannot provide recovery to
provide continuous service after an attack.\par
We propose a novel solution called Sweeper that
provides both fast and accurate post-attack analysis
and efficient recovery with low normal execution
overhead. Sweeper innovatively combines several
techniques: (1) Sweeper uses lightweight monitoring
techniques to detect a wide array of suspicious
requests, providing a first level of defense. (2) By
cleverly leveraging lightweight checkpointing, Sweeper
postpones heavyweight monitoring until absolutely
necessary --- after an attack is detected. Sweeper
rolls back and re-executes multiple times to
dynamically apply heavyweight analysis techniques via
dynamic binary instrumentation. Since only the
execution involved in the attack is analyzed, the
analysis is efficient, yet thorough. (3) Based on the
analysis results, Sweeper automatically generates
low-overhead antibodies to prevent future attacks of
the same vulnerability. (4) Finally, Sweeper again
re-executes to perform fast recovery for continuous
service.\par
We implement Sweeper in a real system. Our experimental
results with three real-world servers and four real
security vulnerabilities show that Sweeper can detect
an attack and generate antibodies in under 60
milliseconds. Our results also show that Sweeper
imposes under 1\% overhead during normal execution,
clearly suitable for widespread production deployment
(especially since Sweeper also allows partial
deployment). Finally, we analytically show that, for a
fast hit-list worm otherwise capable of infecting all
vulnerable hosts in under a second, Sweeper contains
the extent of infection to under 5\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "antibody; dynamic instrumentation; flash worm; VSEF",
}
@Article{Lachenmann:2007:RML,
author = "Andreas Lachenmann and Pedro Jos{\'e} Marr{\'o}n and
Matthias Gauger and Daniel Minder and Olga Saukh and
Kurt Rothermel",
title = "Removing the memory limitations of sensor networks
with flash-based virtual memory",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "131--144",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273012",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtual memory has been successfully used in different
domains to extend the amount of memory available to
applications. We have adapted this mechanism to sensor
networks, where, traditionally, RAM is a severely
constrained resource. In this paper we show that the
overhead of virtual memory can be significantly reduced
with compile-time optimizations to make it usable in
practice, even with the resource limitations present in
sensor networks.\par
Our approach, ViMem, creates an efficient memory layout
based on variable access traces obtained from
simulation tools. This layout is optimized to the
memory access patterns of the application and to the
specific properties of the sensor network
hardware.\par
Our implementation is based on TinyOS. It includes a
pre-compiler for nesC code that translates virtual
memory accesses into calls of ViMem's runtime
component. ViMem uses flash memory as secondary
storage. In order to evaluate our system we have
modified nontrivial existing applications to make use
of virtual memory. We show that its runtime overhead is
small even for large data sizes.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "flash memory; memory layout; virtual memory; wireless
sensor networks",
}
@Article{Muller:2007:VMS,
author = "Ren{\'e} M{\"u}ller and Gustavo Alonso and Donald
Kossmann",
title = "A virtual machine for sensor networks",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "145--158",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273013",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Sensor networks are increasingly being deployed for a
wide variety of tasks. Today, in these networks, the
development, deployment, and maintenance of
applications are performed largely ad-hoc. Existing
platforms help somewhat but also introduce implicit
trade-offs. In one extreme, low-level programming
platforms and languages make programming cumbersome and
error-prone. In the other extreme, declarative
approaches greatly facilitate programming but restrict
what can be done. In both cases, additional limitations
include lack of support for concurrency, difficulties
in changing applications, and insufficient abstractions
from low-level details. This paper presents SwissQM, a
virtual machine designed to address all these
limitations. SwissQM offers a platform-independent
programming abstraction that is geared towards data
acquisition and in-network data processing.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "efficient bytecode representation; query processing;
SwissQM; virtual machine; wireless sensor networks",
}
@Article{Awan:2007:MHS,
author = "Asad Awan and Suresh Jagannathan and Ananth Grama",
title = "Macroprogramming heterogeneous sensor networks using
cosmos",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "159--172",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273014",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we present COSMOS, a novel architecture
for macroprogramming heterogeneous sensor network
systems. Macroprogramming specifies aggregate system
behavior, as opposed to device-specific programs that
code distributed behavior using explicit messaging.
COSMOS is comprised of a macroprogramming language,
mPL, and an operating system, mOS. mPL macroprograms
are statically verifiable compositions of reusable
user-specified, or system supported functional
components. The mOS node/network operating system
provides component management and a lean execution
environment for mPL programs in heterogeneous
resource-constrained sensor networks. It provides
runtime application instantiation, with over-the-air
reprogramming of the network. COSMOS facilitates
composition of complex real-world applications that are
robust, scalable and adaptive in dynamic data-driven
sensor network environments. An important and novel
aspect of COSMOS is the ability to easily extend its
component basis library to add rich macroprogramming
abstractions to mPL, tailored to domain and resource
constraints, without modifications to the OS.
Applications built on COSMOS are currently in use at
the Bowen Labs for Structural Engineering, in Purdue
University, for high-fidelity structural monitoring. We
present a detailed description of the COSMOS
architecture, its various components, and a
comprehensive experimental evaluation using macro- and
micro- benchmarks to demonstrate performance
characteristics of COSMOS.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "dataflow; heterogeneous networks; macroprogramming;
wireless sensor networks",
}
@Article{Zhang:2007:HHF,
author = "Zhihui Zhang and Kanad Ghose",
title = "{hFS}: a hybrid file system prototype for improving
small file and metadata performance",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "175--187",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273016",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Two oft-cited file systems, the Fast File System (FFS)
and the Log-Structured File System (LFS), adopt two
sharply different update strategies--- update-in-place
and update-out-of-place. This paper introduces the
design and implementation of a hybrid file system
called hFS, which combines the strengths of FFS and LFS
while avoiding their weaknesses. This is accomplished
by distributing file system data into two partitions
based on their size and type. In hFS, data blocks of
large regular files are stored in a data partition
arranged in a FFS-like fashion, while metadata and
small files are stored in a separate log partition
organized in the spirit of LFS but without incurring
any cleaning overhead. This segregation makes it
possible to use more appropriate layouts for different
data than would otherwise be possible. In particular,
hFS has the ability to perform clustered I/O on all
kinds of data---including small files, metadata, and
large files. We have implemented a prototype of hFS on
FreeBSD and have compared its performance against three
file systems, including FFS with Soft Updates, a port
of NetBSD's LFS, and our lightweight journaling file
system called yFS. Results on a number of benchmarks
show that hFS has excellent small file and metadata
performance. For example, hFS beats FFS with Soft
Updates in the range from 53\% to 63\% in the PostMark
benchmark.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "disk inodes; file systems; metadata journaling; update
strategies",
}
@Article{Li:2007:CPC,
author = "Chuanpeng Li and Kai Shen and Athanasios E.
Papathanasiou",
title = "Competitive prefetching for concurrent sequential
{I/O}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "189--202",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273017",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "During concurrent I/O workloads, sequential access to
one I/O stream can be interrupted by accesses to other
streams in the system. Frequent switching between
multiple sequential I/O streams may severely affect I/O
efficiency due to long disk seek and rotational delays
of disk-based storage devices. Aggressive prefetching
can improve the granularity of sequential data access
in such cases, but it comes with a higher risk of
retrieving unneeded data. This paper proposes a
competitive prefetching strategy that controls the
prefetching depth so that the overhead of disk I/O
switch and unnecessary prefetching are balanced. The
proposed strategy does not require a-priori information
on the data access pattern, and achieves at least half
the performance (in terms of I/O throughput) of the
optimal offline policy. We also provide analysis on the
optimality of our competitiveness result and extend the
competitiveness result to capture prefetching in the
case of random-access workloads.\par
We have implemented the proposed competitive
prefetching policy in Linux 2.6.10 and evaluated its
performance on both standalone disks and a disk array
using a variety of workloads (including two common file
utilities, Linux kernel compilation, the TPC-H
benchmark, the Apache web server, and index searching).
Compared to the original Linux kernel, our competitive
prefetching system improves performance by up to 53\%.
At the same time, it trails the performance of an
oracle prefetching strategy by no more than 42\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "competitive prefetching; I/O; performance evaluation",
}
@Article{Wires:2007:SFS,
author = "Jake Wires and Michael J. Feeley",
title = "Secure file system versioning at the block level",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "203--215",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273018",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In typical file systems, valuable data is vulnerable
to being accidentally or maliciously deleted or
overwritten. Versioning file systems protect data from
accidents by transparently retaining old versions, but
do less well in protecting data from malicious attack.
These systems remain vulnerable to attackers who gain
unauthorized access to prune old file versions, who
bypass the file system to directly manipulate storage,
or who exploit bugs in any part of the operating
system.\par
This paper presents VDisk, a secure, block-level
versioning system that adds file-grain versioning to a
standard, unmodified file system. VDisk consists of a
set of untrusted user-mode tools and a trusted, secure
kernel that is implemented within an isolated Xen
virtual machine domain. The secure kernel is designed
to be simple and thus trustworthy. This kernel logs
file-system updates to a secure log, exports a
read-only view of the log to the rest of the system and
securely removes unwanted versions from the log. Secure
cleaning is implemented in a two-level manner. An
untrusted, user-mode cleaner selects log entries for
reclamation and submits cleaning requests to the
trusted VDisk kernel along with a proof that the
request satisfies the device's version-retention
policy. The secure kernel verifies the proof and
updates the log.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zheng:2007:ACI,
author = "Wei Zheng and Ricardo Bianchini and Thu D. Nguyen",
title = "Automatic configuration of {Internet} services",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "219--229",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273020",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Recent research has found that operators frequently
misconfigure Internet services, causing various
availability and performance problems. In this paper,
we propose a software infrastructure that eliminates
several types of misconfiguration by automating the
generation of configuration files in Internet services,
even as the services evolve. The infrastructure
comprises a custom scripting language, configuration
file templates, communicating runtime monitors, and
heuristic algorithms to detect dependencies between
configuration parameters and select ideal
configurations. To demonstrate our infrastructure
experimentally, we apply it to a realistic online
auction service. Our results show that the
infrastructure can simplify operation significantly
while eliminating 58\% of the misconfigurations found
in a previous study of the same service. Furthermore,
our results show that the infrastructure can
efficiently determine the configuration parameters that
lead to high performance as the service evolves through
a hardware upgrade and the scheduled maintenance of a
few nodes.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "configuration; internet services; manageability;
operator mistakes",
}
@Article{Pariag:2007:CPW,
author = "David Pariag and Tim Brecht and Ashif Harji and Peter
Buhr and Amol Shukla and David R. Cheriton",
title = "Comparing the performance of {Web} server
architectures",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "231--243",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273021",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we extensively tune and then compare
the performance of web servers based on three different
server architectures. The $\mu$server utilizes an
event-driven architecture, Knot uses the
highly-efficient Capriccio thread library to implement
a thread-per-connection model, and WatPipe uses a
hybrid of events and threads to implement a
pipeline-based server that is similar in spirit to a
staged event-driven architecture (SEDA) server like
Haboob.\par
We describe modifications made to the Capriccio thread
library to use Linux's zero-copy sendfile interface. We
then introduce the {SY mmetric Multi-Processor Event
Driven} (SYMPED) architecture in which relatively minor
modifications are made to a single process event-driven
(SPED) server (the $\mu$server) to allow it to continue
processing requests in the presence of blocking due to
disk accesses. Finally, we describe our C++
implementation of WatPipe, which although utilizing a
pipeline-based architecture, excludes the dynamic
controls over event queues and thread pools used in
SEDA. When comparing the performance of these three
server architectures on the workload used in our study,
we arrive at different conclusions than previous
studies. In spite of recent improvements to threading
libraries and our further improvements to Capriccio and
Knot, both the event-based $\mu$server and
pipeline-based Wat-Pipe server provide better
throughput (by about 18\%). We also observe that when
using blocking sockets to send data to clients, the
performance obtained with some architectures is quite
good and in one case is noticeably better than when
using non-blocking sockets.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "events; performance; scalability; threads; web
servers",
}
@Article{Rellermeyer:2007:CSP,
author = "Jan S. Rellermeyer and Gustavo Alonso",
title = "{Concierge}: a service platform for
resource-constrained devices",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "245--258",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273022",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As mobile and embedded devices become widespread, the
management and configuration of the software in the
devices is increasingly turning into a critical issue.
OSGi is a business standard for the life cycle
management of Java software components. It is based on
a service oriented architecture where functional units
are decoupled and components can be managed
independently of each other. However, the focus
continuously shifts from the originally intended area
of small and embedded devices towards large-scaled
enterprise systems. As a result, implementations of the
OSGi framework are increasingly becoming more
heavyweight and less suitable for smaller computing
devices. In this paper, we describe the experience
gathered during the design of Concierge, an
implementation of the OSGi specification tailored to
resource-constrained devices. Comprehensive benchmarks
show that Concierge performs better than existing
implementations and consumes less resources.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "average bundle; concierge; OSGi; resource-constrained
devices; service oriented architecture",
}
@Article{Etsion:2007:FGK,
author = "Yoav Etsion and Dan Tsafrir and Scott Kirkpatrick and
Dror G. Feitelson",
title = "Fine grained kernel logging with {KLogger}: experience
and insights",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "259--272",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273023",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Understanding the detailed behavior of an operating
system is crucial for making informed design decisions.
But such an understanding is very hard to achieve, due
to the increasing complexity of such systems and the
fact that they are implemented and maintained by large
and diverse groups of developers. Tools like KLogger
--- presented in this paper --- can help by enabling
fine-grained logging of system events and the sharing
of a logging infrastructure between multiple developers
and researchers, facilitating a methodology where
design evaluation can be an integral part of kernel
development. We demonstrate the need for such
methodology by a host of case studies, using KLogger to
better understand various subsystems in the Linux
kernel, and pinpointing overheads and problems
therein.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "kernel logging; KLogger; Linux; locking; operating
systems; overheads; performance evaluation;
scheduling",
}
@Article{Soltesz:2007:CBO,
author = "Stephen Soltesz and Herbert P{\"o}tzl and Marc E.
Fiuczynski and Andy Bavier and Larry Peterson",
title = "Container-based operating system virtualization: a
scalable, high-performance alternative to hypervisors",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "275--287",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273025",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Hypervisors, popularized by Xen and VMware, are
quickly becoming commodity. They are appropriate for
many usage scenarios, but there are scenarios that
require system virtualization with high degrees of both
isolation and efficiency. Examples include HPC
clusters, the Grid, hosting centers, and PlanetLab. We
present an alternative to hypervisors that is better
suited to such scenarios. The approach is a synthesis
of prior work on resource containers and security
containers applied to general-purpose, time-shared
operating systems. Examples of such container-based
systems include Solaris 10, Virtuozzo for Linux, and
Linux-VServer. As a representative instance of
container-based systems, this paper describes the
design and implementation of Linux-VServer. In
addition, it contrasts the architecture of
Linux-VServer with current generations of Xen, and
shows how Linux-VServer provides comparable support for
isolation and superior system efficiency.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "alternative; container; hypervisor; Linux-VServer;
operating; system; virtualization; Xen",
}
@Article{Padala:2007:ACV,
author = "Pradeep Padala and Kang G. Shin and Xiaoyun Zhu and
Mustafa Uysal and Zhikui Wang and Sharad Singhal and
Arif Merchant and Kenneth Salem",
title = "Adaptive control of virtualized resources in utility
computing environments",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "289--302",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273026",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Data centers are often under-utilized due to
over-provisioning as well as time-varying resource
demands of typical enterprise applications. One
approach to increase resource utilization is to
consolidate applications in a shared infrastructure
using virtualization. Meeting application-level quality
of service (QoS) goals becomes a challenge in a
consolidated environment as application resource needs
differ. Furthermore, for multi-tier applications, the
amount of resources needed to achieve their QoS goals
might be different at each tier and may also depend on
availability of resources in other tiers. In this
paper, we develop an adaptive resource control system
that dynamically adjusts the resource shares to
individual tiers in order to meet application-level QoS
goals while achieving high resource utilization in the
data center. Our control system is developed using
classical control theory, and we used a black-box
system modeling approach to overcome the absence of
first principle models for complex enterprise
applications and systems. To evaluate our controllers,
we built a testbed simulating a virtual data center
using Xen virtual machines. We experimented with two
multi-tier applications in this virtual data center: a
two-tier implementation of RUBiS, an online auction
site, and a two-tier Java implementation of TPC-W. Our
results indicate that the proposed control system is
able to maintain high resource utilization and meets
QoS goals in spite of varying resource demands from the
applications.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "application QoS; control theory; data center; resource
utilization; server consolidation; virtualization",
}
@Article{Wang:2007:DCS,
author = "Yin Wang and Terence Kelly and St{\'e}phane
Lafortune",
title = "Discrete control for safe execution of {IT} automation
workflows",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "305--314",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273028",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As information technology (IT) administration becomes
increasingly complex, workflow technologies are gaining
popularity for IT automation. Writing correct workflow
programs is notoriously difficult. Although static
analysis tools are available, fixing defects remains
manual and error-prone. This paper applies discrete
control theory to IT automation workflows. Discrete
control detects flaws in workflows just as static
analysis does, and more importantly it also allows safe
execution of flawed workflows by dynamically avoiding
run-time failures. Our approach can guarantee
compliance with certain requirements and can partially
decouple requirements from software, reducing the need
to modify the latter if the former change. We have
implemented a discrete control module for a real IT
automation system. Experiments with workflows from a
real production system and with randomly generated
workflows show that our approach scales to workflows of
practical size.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "deadlock avoidance; discrete control; workflow",
}
@Article{Guerraoui:2007:SBS,
author = "Rachid Guerraoui and Michal Kapalka and Jan Vitek",
title = "{STMBench7}: a benchmark for software transactional
memory",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "315--324",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273029",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Software transactional memory (STM) is a promising
technique for controlling concurrency in modern
multi-processor architectures. STM aims to be more
scalable than explicit coarse-grained locking and
easier to use than fine-grained locking. However, STM
implementations have yet to demonstrate that their
runtime overheads are acceptable. To date, empiric
evaluations of these implementations have suffered from
the lack of realistic benchmarks. Measuring performance
of an STM in an overly simplified setting can be at
best uninformative and at worst misleading as it may
steer researchers to try to optimize irrelevant aspects
of their implementations.\par
This paper presents STMBench7: a candidate benchmark
for evaluating STM implementations. The underlying data
structure consists of a set of graphs and indexes
intended to be suggestive of many complex applications,
e.g., CAD/CAM. A collection of operations is supported
to model a wide range of workloads and concurrency
patterns. Companion locking strategies serve as a
baseline for STM performance comparisons. STMBench7
strives for simplicity. Users may choose a workload,
number of threads, benchmark length, as well as the
possibility of structure modification and the nature of
traversals of shared data structures. We illustrate the
use of STMBench7 with an evaluation of a well-known
software transactional memory implementation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "benchmarks; software transactional memory",
}
@Article{Makris:2007:DAU,
author = "Kristis Makris and Kyung Dong Ryu",
title = "Dynamic and adaptive updates of non-quiescent
subsystems in commodity operating system kernels",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "327--340",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273031",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Continuously running systems require kernel software
updates applied to them without downtime. Facilitating
fast reboots, or delaying an update may not be a
suitable solution in many environments, especially in
pay-per-use high-performance computing clusters and
mission critical systems. Such systems will not reap
the benefits of new kernel features, and will continue
to operate with kernel security holes unpatched, at
least until the next scheduled maintenance downtime. To
address these problems we developed an on-the-fly
kernel updating system that enables commodity operating
systems to gain adaptive and mutative capabilities
without kernel recompilation or reboot. Our system,
DynAMOS, employs a novel and efficient dynamic code
instrumentation technique termed adaptive function
cloning. Execution flow can be switched adaptively
among multiple editions of functions, possibly
concurrently running. This approach becomes the
foundation for dynamic replacement of non-quiescent
kernel subsystems when the timeliness of an update
depends on synchronization of multiple kernel paths. We
illustrate our experience by dynamically updating core
subsystems of the Linux kernel.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "adaptive operating system; dynamic instrumentation;
dynamic software updates; DynAMOS; function cloning",
}
@Article{Hunt:2007:SPI,
author = "Galen Hunt and Mark Aiken and Manuel F{\"a}hndrich and
Chris Hawblitzel and Orion Hodson and James Larus and
Steven Levi and Bjarne Steensgaard and David Tarditi
and Ted Wobber",
title = "Sealing {OS} processes to improve dependability and
safety",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "341--354",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272996.1273032",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In most modern operating systems, a process is a
hardware-protected abstraction for isolating code and
data. This protection, however, is selective. Many
common mechanisms---dynamic code loading, run-time code
generation, shared memory, and intrusive system
APIs---make the barrier between processes very
permeable. This paper argues that this traditional open
process architecture exacerbates the dependability and
security weaknesses of modern systems.\par
As a remedy, this paper proposes a sealed process
architecture, which prohibits dynamic code loading,
self-modifying code, shared memory, and limits the
scope of the process API. This paper describes the
implementation of the sealed process architecture in
the Singularity operating system, discusses its merits
and drawbacks, and evaluates its effectiveness. Some
benefits of this sealed process architecture are:
improved program analysis by tools, stronger security
and safety guarantees, elimination of redundant
overlaps between the OS and language runtimes, and
improved software engineering.\par
Conventional wisdom says open processes are required
for performance; our experience suggests otherwise. We
present the first macrobenchmarks for a sealed-process
operating system and applications. The benchmarks show
that an experimental sealed-process system can achieve
performance competitive with highly-tuned, commercial,
open-process systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "open process architecture; sealed kernel; sealed
process architecture; software isolated process (SIP)",
}
@Article{Wobber:2007:AAS,
author = "Ted Wobber and Aydan Yumerefendi and Mart{\'\i}n Abadi
and Andrew Birrell and Daniel R. Simon",
title = "Authorizing applications in singularity",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "355--368",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273033",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We describe a new design for authorization in
operating systems in which applications are first-class
entities. In this design, principals reflect
application identities. Access control lists are
patterns that recognize principals. We present a
security model that embodies this design in an
experimental operating system, and we describe the
implementation of our design and its performance in the
context of this operating system.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "access control; application identity; capabilities;
channels; delegation; pattern matching; regular
expressions",
}
@Article{Weatherspoon:2007:AES,
author = "Hakim Weatherspoon and Patrick Eaton and Byung-Gon
Chun and John Kubiatowicz",
title = "{Antiquity}: exploiting a secure log for wide-area
distributed storage",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "371--384",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273035",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Antiquity is a wide-area distributed storage system
designed to provide a simple storage service for
applications like file systems and back-up. The design
assumes that all servers eventually fail and attempts
to maintain data despite those failures. Antiquity uses
a secure log to maintain data integrity, replicates
each log on multiple servers for durability, and uses
dynamic Byzantine fault-tolerant quorum protocols to
ensure consistency among replicas. We present
Antiquity's design and an experimental evaluation with
global and local testbeds. Antiquity has been running
for over two months on 400+ PlanetLab servers storing
nearly 20,000 logs totaling more than 84 GB of data.
Despite constant server churn, all logs remain
durable.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "archival storage systems; data durability; data
integrity; distributed storage system; wide-area",
}
@Article{Camargos:2007:SMH,
author = "L{\'a}saro Camargos and Fernando Pedone and Marcin
Wieloch",
title = "{Sprint}: a middleware for high-performance
transaction processing",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "385--398",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273036",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Sprint is a middleware infrastructure for high
performance and high availability data management. It
extends the functionality of a standalone in-memory
database (IMDB) server to a cluster of commodity
shared-nothing servers. Applications accessing an IMDB
are typically limited by the memory capacity of the
machine running the IMDB. Sprint partitions and
replicates the database into segments and stores them
in several data servers. Applications are then limited
by the aggregated memory of the machines in the
cluster. Transaction synchronization and commitment
rely on total-order multicast. Differently from
previous approaches, Sprint does not require accurate
failure detection to ensure strong consistency,
allowing fast reaction to failures. Experiments
conducted on a cluster with 32 data servers using TPC-C
and a micro-benchmark showed that Sprint can provide
very good performance and scalability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "middleware; parallel databases; partitioning;
replication",
}
@Article{Elnikety:2007:TMA,
author = "Sameh Elnikety and Steven Dropsho and Willy
Zwaenepoel",
title = "{Tashkent+}: memory-aware load balancing and update
filtering in replicated databases",
journal = j-OPER-SYS-REV,
volume = "41",
number = "3",
pages = "399--412",
month = jun,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1272998.1273037",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:16:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present a memory-aware load balancing (MALB)
technique to dispatch transactions to replicas in a
replicated database. Our MALB algorithm exploits
knowledge of the working sets of transactions to assign
them to replicas in such a way that they execute in
main memory, thereby reducing disk I/O. In support of
MALB, we introduce a method to estimate the size and
the contents of transaction working sets. We also
present an optimization called update filtering that
reduces the overhead of update propagation between
replicas.\par
We show that MALB greatly improves performance over
other load balancing techniques -- such as round robin,
least connections, and locality-aware request
distribution (LARD) -- that do not use explicit
information on how transactions use memory. In
particular, LARD demonstrates good performance for
read-only static content Web workloads, but it gives
performance inferior to MALB for database workloads as
it does not efficiently handle large requests. MALB
combined with update filtering further boosts
performance over LARD.\par
We build a prototype replicated system, called
Tashkent+, with which we demonstrate that MALB and
update filtering techniques improve performance of the
TPC-W and RUBiS benchmarks. In particular, in a
16-replica cluster and using the ordering mix of TPC-W,
MALB doubles the throughput over least connections and
improves throughput 52\% over LARD. MALB with update
filtering further improves throughput to triple that of
least connections and more than double that of LARD.
Our techniques exhibit super-linear speedup; the
throughput of the 16-replica cluster is 37 times the
peak throughput of a standalone database due to better
use of the cluster's memory.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "database replication; load balancing",
}
@Article{Hohmuth:2007:I,
author = "Michael Hohmuth",
title = "Introduction",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "1--2",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278903",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Since the early microkernel hype of the 1980s and some
spectacular failures in the 1990s, the field of
small-kernel-based systems has enjoyed renewed interest
mostly because of contemporary challenges for computer
security: Modern hypervisors and microkernels allow
removing buggy and untrusted standard operating systems
from a system's trusted computing base. At the same
time, these kernels are small enough to make them (and
indeed all of a system's trusted software) attainable
for security auditing, formal methods, and even formal
verification.\par
In this Special Topic Issue of Operating Systems
Review, we explore this field in many dimensions: In
addition to current research, we present both
retrospective and forward-looking work; we look at both
overall system structure as well as the mechanics of
building small-kernel-based systems; and we present
work from both the hypervisor and the microkernel
factions of the small-kernel community.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heiser:2007:TTC,
author = "Gernot Heiser and Kevin Elphinstone and Ihor Kuz and
Gerwin Klein and Stefan M. Petters",
title = "Towards trustworthy computing systems: taking
microkernels to the next level",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "3--11",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278904",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As computer systems become increasingly
mission-critical, used in life-critical situations, and
relied upon to protect intellectual property,
operating-system reliability is becoming an ever
growing concern. In the past, mission- and
life-critical embedded systems consisted of simple
microcontrollers running a small amount of software
that could be validated using traditional and informal
techniques. However, with the growth of software
complexity, traditional techniques for ensuring
software reliability have not been able to keep up,
leading to an overall degradation of reliability. This
paper argues that microkernels are the best approach
for delivering truly trustworthy computer systems in
the foreseeable future. It presents the NICTA
operating-systems research vision, centered around the
L4 microkernel and based on four core projects. The
seL4 project is designing an improved API for a secure
microkernel, L4, verified will produce a full formal
verification of the microkernel, Potoroo combines
execution-time measurements with static analysis to
determine the worst case execution profiles of the
kernel, and CAmkES provides a component architecture
for building systems that use the microkernel. Through
close collaboration with Open Kernel Labs (a NICTA
spinoff) the research output of these projects will
make its way into products over the next few years.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Payne:2007:LAS,
author = "Bryan D. Payne and Reiner Sailer and Ram{\'o}n
C{\'a}ceres and Ron Perez and Wenke Lee",
title = "A layered approach to simplified access control in
virtualized systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "12--19",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278905",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this work, we show how the abstraction layer
created by a hypervisor, or virtual machine monitor,
can be leveraged to reduce the complexity of mandatory
access control policies throughout the system. Policies
governing access control decisions in today's systems
are complex and monolithic. Achieving strong security
guarantees often means restricting usability across the
entire system, which is a primary reason why mandatory
access controls are rarely deployed. Our architecture
uses a hypervisor and multiple virtual machines to
decompose policies into multiple layers. This
simplifies the policies and their enforcement, while
minimizing the overall impact of security on the
system. We show that the overhead of decomposing system
policies into distinct policies for each layer can be
negligible. Our initial implementation confirms that
such layering leads to simpler security policies and
enforcement mechanisms as well as a more robust layered
trusted computing base. We hope that this work serves
to start a dialog regarding the use of mandatory access
controls within a hypervisor for both increasing
security and improving manageability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "information flow; layering; mandatory access control;
policy; security; virtualization",
}
@Article{Hansen:2007:ETT,
author = "Jacob Gorm Hansen and Eske Christiansen and Eric
Jul",
title = "Evil twins: two models for {TCB} reduction in {HPC}
clusters",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "20--29",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278906",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Traditional high performance computing systems require
extensive management and suffer from security and
configuration problems. This paper presents two
generations of a cluster-management system that aims at
making clusters as secure and self-managing as
possible. The goal of the system is minimality: All
nodes in a cluster are configured with a minimal
software base consisting of a virtual machine monitor
and a remote bootstrapping mechanism, and customers
then buy access using a simple pre-paid token scheme.
All necessary application software, including the
operating system, is provided by the customer as a full
virtual machine, and boot-strapped or migrated into the
cluster.\par
We have explored two different models for cluster
control. The first, a decentralized push model ('Evil
Man'$^1$), requires direct network access to cluster
nodes, each of which is running a truly minimal control
plane implementation consisting of only a few hundred
lines of C code. In the second, a centralized pull
model ('Evil Twin'), nodes may be running behind NATs
or firewalls, and are controlled by a centralized web
service. A specially developed cache invalidation
protocol is used for telling nodes when to reload their
workload description from the centralized service.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Walfield:2007:CGH,
author = "Neal H. Walfield and Marcus Brinkmann",
title = "A critique of the {GNU Hurd} multi-server operating
system",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "30--39",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278907",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The GNU Hurd's design was motivated by a desire to
rectify a number of observed shortcomings in Unix.
Foremost among these is that many policies that limit
users exist simply as remnants of the design of the
system's mechanisms and their implementation. To
increase extensibility and integration, the Hurd adopts
an object-based architecture and defines interfaces, in
particular those for the composition of and access to
name spaces, that are virtualizable.\par
This paper is first a presentation of the Hurd's design
goals and a characterization of its architecture
primarily as it represents a departure from Unix's. We
then critique the architecture and assess it in terms
of the user environment of today focusing on security.
Then follows an evaluation of Mach, the microkernel on
which the Hurd is built, emphasizing the design
constraints which Mach imposes as well as a number of
deficiencies its design presents for multi-server like
systems. Finally, we reflect on the properties such a
system appears to require.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "access controls; multi-server; naming; structure",
}
@Article{Feske:2007:CSC,
author = "Norman Feske",
title = "A case study on the cost and benefit of dynamic {RPC}
marshalling for low-level system components",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "40--48",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278908",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Interface definition languages are omnipresent in
microkernel-based operating systems for providing a
time-tested solution for realizing communication
between user-level components. Driven by advancing
kernels and application demands, IDL compilers and the
generated communication-stub code have become
significant contributors to the tool-chain complexity
and the size of the trusted-computing base of such
systems. This paper examines the performance and the
engineering costs of an alternative technique for RFC
communication between microkernel servers. Initially
intended as an interim solution, the presented approach
turned out to be low complex, yet very flexible and
fast. These overly positive results turned our interim
solution into a proposal for realizing inter-component
communication in future microkernel-based operating
systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Uhlig:2007:MKS,
author = "Volkmar Uhlig",
title = "The mechanics of in-kernel synchronization for a
scalable microkernel",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "49--58",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278909",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Systems with minimal kernels address the problem of
ever-increasing system software complexity by strict
separation of resource permission management and
resource policies into different trust domains. Lately,
such system structure has found wide attention in the
research community and industry in the form of
hypervisors and virtual machines.\par
With an increasing number of processors, these systems
face a scalability problem. The separation eliminates
semantic information about the expected parallelism for
individual resources, such as memory pages or
processors. Hence, the kernel is unable to optimize its
synchronization primitives on a case-by-case basis---a
precondition for a scalable, yet well-performing
system.\par
In this paper we present an adaptive synchronization
scheme, one of the core building block for scalable
microkernels. Herewith, unprivileged components (like
virtual machines) can express the degree of concurrency
at the granularity of individual resources. The kernel
can safely adapt and optimize its internal
synchronization regime on a case-by-case basis as we
show exemplary for inter-process communication and the
memory management subsystem of an L4 microkernel.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stoess:2007:TEU,
author = "Jan Stoess",
title = "Towards effective user-controlled scheduling for
microkernel-based systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "59--68",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278910",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With $\mu$-kernel based systems becoming more and more
prevalent, the demand for extensible resource
management raises --- and with it the demand for flexible
thread scheduling. In this paper, we investigate the
benefits and costs of a $\mu$-kernel that exports
scheduling from the kernel to user level. A key idea of
our approach is to involve the user level whenever the
$\mu$-kernel encounters a situation that is ambiguous
with respect to scheduling, and to permit the kernel to
resolve the ambiguity based on user decisions. A
further key aspect is that we rely on a generic,
protection domain neutral interface between kernel and
applications.\par
For evaluation, we have developed a hierarchical user
level scheduling architecture for the L4 $\mu$-kernel,
and a virtualization environment running on its top.
Our environment supports Linux 2.6.9 guest operating
systems on IA-32 processors. Experiments indicate an
application overhead between 0 and 10 percent compared
to a pure in-kernel scheduler solution, but also
demonstrate that our architecture enables effective and
accurate user-directed scheduling.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2007:LPM,
author = "Dohun Kim and Jugwan Eom and Chanik Park",
title = "{L4oprof}: a performance-monitoring-unit-based
software-profiling framework for the {L4} microkernel",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "69--76",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278911",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "These days, the L4 microkernel is expanding its domain
towards embedded systems since it is showing a
comparable performance with traditional monolithic
kernels. The L4 microkernel shows a greatly different
execution behavior of user applications from that in a
traditional monolithic environment because most
operating-system services are run as user-level
applications. Therefore, we need a profiling framework
to obtain a better understanding of performance
bottlenecks for software optimization. However, current
L4 profiling tools provide only higher-level
information, such as the number of function calls,
IPCs, and context switches. In this paper, we present a
software profiling framework which gathers system-wide
statistical information in the L4 microkernel
environment. In order to support profiling lower-level
information such as clock cycles, cache misses, and TLB
misses, our profiling framework uses the hardware
performance counters of the PMU (Performance Monitoring
Unit) which most CPUs support. In this paper, we show
that our profiling framework incurs less than 3\%
overhead below 15000 interrupts per second compared to
the existing Linux profiling tool. Moreover, as a case
study, we show the main cause of performance loss in
L4Linux applications compared with Linux
applications.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hofri:2007:STC,
author = "Micha Hofri",
title = "Service transparency considered harmful: letter to the
editor",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "77--77",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278913",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Deng:2007:AR,
author = "Yuhui Deng",
title = "Author response",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "78--78",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278914",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Deng:2007:OCS,
author = "Yuhui Deng and Frank Wang",
title = "Opportunities and challenges of storage {Grid} enabled
by {Grid} service",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "79--82",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278915",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The explosive growth of data generated worldwide by
information digitization has been identified as the key
driver of storage system evolution. In this paper, we
discuss the existing storage system architectures and
pose the challenges they are facing. Drawing
inspiration from Grid computing community, we propose
to design a storage Grid enabled by Grid service which
can solve the scalability and heterogeneity problems.
However, the challenging Internet involved in the
storage Grid incurs some emerging problems including
the limited network performance, the unstable network
environment, and etc. The Grid service involved in the
storage Grid introduces much larger overhead which may
result in low performance and inefficient utilization
of storage resources. Because Grid service is designed
for loosely coupled systems, we argue that the storage
Grid can employ Grid service as a glue to manage,
monitor and locate the Internet-scale storage resources
which are transparent to users, while still adopting
binary code to transfer data to maintain the
performance. Some other solutions which may alleviate
the performance pressure of Grid service and increase
the efficiency of storage resource utilization are
discussed as well.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "grid service; heterogeneity; internet-scale;
interoperability; scalability; storage grid; storage
management",
}
@Article{Chien:2007:SUL,
author = "Hung-Yu Chien and Chen-Wei Huang",
title = "Security of ultra-lightweight {RFID} authentication
protocols and its improvements",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "83--86",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278916",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The design of ultra-lightweight authentication
protocols is imperative to the pervasive deployment of
low-cost RFIDs. This paper examines the security of two
well known ultra-lightweight authentication protocols
(LMAP and M2AP) and the improved scheme. We demonstrate
our efficient attacks on the protocols, and highlight
the key weaknesses of the designs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "authentication; desynchronization; privacy; RFID;
security",
}
@Article{Kermarrec:2007:GDS,
author = "Anne-Marie Kermarrec and Maarten van Steen",
title = "Gossiping in distributed systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "2--7",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317381",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Gossip-based algorithms were first introduced for
reliably disseminating data in large-scale distributed
systems. However, their simplicity, robustness, and
flexibility make them attractive for more than just
pure data dissemination alone. In particular, gossiping
has been applied to data aggregation, overlay
maintenance, and resource allocation. Gossiping
applications more or less fit the same framework, with
often subtle differences in algorithmic details
determining divergent emergent behavior. This
divergence is often difficult to understand, as formal
models have yet to be developed that can capture the
full design space of gossiping solutions. In this
paper, we present a brief introduction to the field of
gossiping in distributed systems, by providing a simple
framework and using that framework to describe
solutions for various application domains.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birman:2007:PLG,
author = "Ken Birman",
title = "The promise, and limitations, of gossip protocols",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "8--13",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317382",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Recent years have seen a surge of interest in gossip
protocols, with proposals to apply them for purposes
ranging from autonomic self-management, repair of
inconsistencies, reliable multicast and distributed
search. Yet the field of distributed computing is
littered with technologies that had initial promise,
but were ultimately rejected by the industry.
Researchers who measure their work through its impact
need to ask some tough, basic questions. What are the
uses to which gossip is particularly well-matched, and
what are its limitations? What alternatives are there
to gossip-based solutions, and when would we be
better-off using a non-gossip protocol? When, in
effect, is gossip the technology of choice?",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Alvisi:2007:HRG,
author = "Lorenzo Alvisi and Jeroen Doumen and Rachid Guerraoui
and Boris Koldehofe and Harry Li and Robbert van
Renesse and Gilles Tredan",
title = "How robust are gossip-based communication protocols?",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "14--18",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317383",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Gossip-based communication protocols are often touted
as being robust. Not surprisingly, such a claim relies
on assumptions under which gossip protocols are
supposed to operate. In this paper, we discuss and in
some cases expose some of these assumptions and discuss
how sensitive the robustness of gossip is to these
assumptions. This analysis gives rise to a collection
of new research challenges.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "gossiping; incentives; robustness; security",
}
@Article{Fernandess:2007:GTF,
author = "Yaacov Fernandess and Antonio Fern{\'a}ndez and Maxime
Monod",
title = "A generic theoretical framework for modeling
gossip-based algorithms",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "19--27",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317384",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "During the past 30 years of the Internet revolution,
the Internet has become a major force of change with an
enormous effect on civilization. Consequently, computer
networks have evolved into more complex system and
become virtually ubiquitous. This in turn, has given
raise to a growing demand for scalable and reliable
computer system architectures. Thus far, there has been
enormous effort by the research community to introduce
decentralized, simple, and scalable distributed systems
to solve a wide range of problems. In this paper we
explore one promising solution, which was initially
inspired by mathematical models that investigate two
everyday life phenomena, epidemics and gossip, which we
used interchangeably throughout the paper. During the
last century, mathematicians developed models to
predict the rate of diseases spread, namely epidemics,
using differential equations. In addition, researches
developed discrete mathematics models to predict what
we already know; rumors spread fast, namely gossip. It
was thus natural to harness these models in order to
design distributed systems that mimic the basic
behavior of such fast spreading everyday life
paradigms.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bakhshi:2007:FAT,
author = "Rena Bakhshi and Francois Bonnet and Wan Fokkink and
Boudewijn Haverkort",
title = "Formal analysis techniques for gossiping protocols",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "28--36",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317385",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We give a survey of formal verification techniques
that can be used to corroborate existing experimental
results for gossiping protocols in a rigorous manner.
We present properties of interest for gossiping
protocols and discuss how various formal evaluation
techniques can be employed to predict them.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "gossiping protocols; survey; verification techniques",
}
@Article{Eugster:2007:APG,
author = "Patrick Eugster and Pascal Felber and Fabrice {Le
Fessant}",
title = "The `art' of programming gossip-based systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "37--42",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317386",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "How does one best go about building actual
gossip-based protocols? Trying to answer this question
has brought us to address two preliminary questions,
namely (1) what the intrinsics of such systems or
protocols are, and (2) what kind of applications would
in the end be built on top of such protocols. We
address the first question by arguing that gossip-based
protocols are all built following one and the same
pattern, and describing three building blocks which we
claim are used to support this recurrent pattern---most
notably a source of randomness. We validate these
claims by devising simplified versions of well-known
protocols, in a layered fashion, on top of a conceptual
interface describing these basic services. The second
question is addressed by arguing that gossip-based
protocols exhibit some probabilistic or imperfect
flavor (e.g., probabilistic or partial completion), and
by proposing to take such probabilistic behavior into
account when devising interfaces for applications
building on top of gossip-based protocols. We argue for
inherent support for these probabilities in the
programming model.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Riviere:2007:CGC,
author = "{\'E}tienne Rivi{\`e}re and Roberto Baldoni and Harry
Li and Jos{\'e} Pereira",
title = "Compositional gossip: a conceptual architecture for
designing gossip-based applications",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "43--50",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317387",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Most proposed gossip-based systems use an ad-hoc
design. We observe a low degree of reutilization among
this proposals. We present how this limits both the
systematic development of gossip-based applications and
the number of applications that can benefit from
gossip-based construction. We posit that these
reinvent-the-wheel approaches poses a significant
barrier to the spread and usability of gossip
protocols.\par
This paper advocates a conceptual design framework
based upon aggregating basic and predefined building
blocks (B$^2$). We show how to compose building blocks
within our framework to construct more complex blocks
to be used in gossip-based applications. The concept is
further depicted with two gossip-based applications
described using our building blocks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "design framework; distributed applications;
gossip-based computing",
}
@Article{Costa:2007:EIC,
author = "Paolo Costa and Vincent Gramoli and M{\'a}rk Jelasity
and Gian Paolo Jesi and Erwan Le Merrer and Alberto
Montresor and Leonardo Querzoni",
title = "Exploring the interdisciplinary connections of
gossip-based systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "51--60",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317388",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In recent years the labels `gossip' and `gossip-based'
have been applied to an increasingly general class of
algorithms, including approaches to information
aggregation, overlay network management and clock
synchronization. These algorithms are intuitively
similar, irrespective of their purpose. Their
distinctive features include relying on local
information, being round-based and relatively simple,
and having a bounded information transmission and
processing complexity in each round. Our position is
that this class can and should be significantly
extended to involve algorithms from other disciplines
that share the same or similar distinctive features,
like certain parallel numerical algorithms, routing
protocols, bio-inspired algorithms and cellular
automata, to name but a few. Such a broader perspective
would allow us to import knowledge and tools to design
and understand gossip-based distributed systems, and we
could also export accumulated knowledge to re-interpret
some of the problems in other disciplines, such as
vehicular traffic control. In this position paper we
describe a number of areas that show parallels with
gossip protocols. These example areas will hopefully
serve as inspiration for future research. In addition,
we believe that comparisons with other fields also
helps clarify the definition of gossip protocols and
represents a necessary first step towards an eventual
formal definition.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ghodsi:2007:ESB,
author = "Ali Ghodsi and Seif Haridi and Hakim Weatherspoon",
title = "Exploiting the synergy between gossiping and
structured overlays",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "61--66",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317389",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this position paper we argue for exploiting the
synergy between gossip-based algorithms and structured
overlay networks (SON). These two strands of research
have both aimed at building fault-tolerant, dynamic,
self-managing, and large-scale distributed systems.
Despite the common goals, the two areas have, however,
been relatively isolated. We focus on three problem
domains where there is an untapped potential of using
gossiping combined with SONs. We argue for applying
gossip-based membership for ring-based SONs---such as
Chord and Bamboo---to make them handle partition
mergers and loopy networks. We argue that small world
SONs---such as Accordion and Mercury---are specifically
well-suited for gossip-based membership management. The
benefits would be better graph-theoretic properties.
Finally, we argue that gossip-based algorithms could
use the overlay constructed by SONs. For example, many
unreliable broadcast algorithms for SONs could be
augmented with anti-entropy protocols. Similarly,
gossip-based aggregation could be used in SONs for
network size estimation and load-balancing purposes.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distributed hash tables; gossip-based algorithms;
structured overlay networks",
}
@Article{Friedman:2007:GMB,
author = "Roy Friedman and Daniela Gavidia and Luis Rodrigues
and Aline Carneiro Viana and Spyros Voulgaris",
title = "Gossiping on {MANETs}: the beauty and the beast",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "67--74",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317390",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Gossip protocols have emerged as a powerful technique
for implementing highly scalable and robust services,
such as information dissemination and aggregation. The
fact that gossip protocols require very little or no
structure to operate makes them particularly appealing
to apply in dynamic systems, where topology changes are
common (for instance, due to frequent faults or high
churn rates). Therefore, gossip protocols seem
particularly well fit to operate in wireless
self-organizing networks. Unfortunately, these networks
have a number of characteristics that impede the
deployment of gossip protocols designed for wired
networks. In this work we identify the inherent
differences in communication between wired and wireless
networks and their impact on the design and
implementation of gossip protocols. In particular, our
comparison includes drawing a distinction between the
gossiping primitives suitable for each of these
environments. In the context of this analysis, we
conclude by presenting a list of open research
questions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Weatherspoon:2007:GSS,
author = "Hakim Weatherspoon and Hugo Miranda and Konrad
Iwanicki and Ali Ghodsi and Yann Busnel",
title = "Gossiping over storage systems is practical",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "75--81",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317391",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Gossip-based mechanisms are touted for their
simplicity, limited resource usage, robustness to
failures, and tunable system behavior. These qualities
make gossiping an ideal mechanism for storage systems
that are responsible for maintaining and updating data
in a mist of failures and limited resources (e.g.,
intermittent network connectivity, limited bandwidth,
constrained communication range, or limited battery
power). We focus on persistent storage systems that,
unlike mere caches, are responsible for both the
durability and the consistency of data. Examples of
such systems may be encountered in many different
environments, in particular: wide-area networks
(constrained by limited bandwidth), wireless sensor
networks (characterized by limited resources), and
mobile ad hoc networks (suffering from intermittent
connectivity). In this paper, we demonstrate the
qualities of gossiping in these three respective
environments.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distributed storage; durability; gossip-based storage;
gossiping; mobile ad hoc networks; persistent storage;
update propagation; wide-area networks; wireless sensor
networks",
}
@Article{Liang:2007:RDM,
author = "Jin Liang and Indranil Gupta and Klara Nahrstedt",
title = "Reliable on-demand management operations for
large-scale distributed applications",
journal = j-OPER-SYS-REV,
volume = "41",
number = "5",
pages = "82--88",
month = oct,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1317379.1317392",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper argues for attention to, and proposes a
novel direction to solving, instant monitoring and
management tasks for large-scale distributed
applications running across hundreds of hosts. We
present the MON (Management Overlay Networks)
approach$^1$, which uses a novel concept called
on-demand overlays, in order to support instant
commands such as queries and software pushes. On-demand
overlays are built on-the-fly and probabilistically, by
leveraging weakly-consistent gossip-style membership
information underneath. Thus, they are lightweight in
terms of memory, computation, and bandwidth. We augment
on-demand overlays with several notions of
application-specified reliability, and show how MON
detects and adheres to these. MON is available atop
PlanetLab, and we present experimental results. We
conclude with a series of promising open problems in
this direction.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "instant commands; monitoring; on-demand overlays;
reliability",
}
@Article{Wang:2007:PCA,
author = "Helen J. Wang and Xiaofeng Fan and Jon Howell and
Collin Jackson",
title = "Protection and communication abstractions for {Web}
browsers in {MashupOS}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "1--16",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294263",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Web browsers have evolved from a single-principal
platform on which one site is browsed at a time into a
multi-principal platform on which data and code from
mutually distrusting sites interact programmatically in
a single page at the browser. Today's `Web 2.0'
applications (or mashups) offer rich services, rivaling
those of desktop PCs. However, the protection and
communication abstractions offered by today's browsers
remain suitable only for a single-principal
system--either no trust through complete isolation
between principals (sites) or full trust by
incorporating third party code as libraries. In this
paper, we address this deficiency by identifying and
designing the missing abstractions needed for a
browser-based multi-principal platform. We have
designed our abstractions to be backward compatible and
easily adoptable. We have built a prototype system that
realizes almost all of our abstractions and their
associated properties. Our evaluation shows that our
abstractions make it easy to build more secure and
robust client-side Web mashups and can be easily
implemented with negligible performance overhead.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "abstractions; browser; communications; multi-principal
OS; protection; same-origin policy; security; web",
}
@Article{Kiciman:2007:APR,
author = "Emre Kiciman and Benjamin Livshits",
title = "{AjaxScope}: a platform for remotely monitoring the
client-side behavior of {Web 2.0} applications",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "17--30",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294264",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The rise of the software-as-a-service paradigm has led
to the development of a new breed of sophisticated,
interactive applications often called Web 2.0. While
web applications have become larger and more complex,
web application developers today have little visibility
into the end-to-end behavior of their systems. This
paper presents AjaxScope, a dynamic instrumentation
platform that enables cross-user monitoring and
just-in-time control of web application behavior on
end-user desktops. AjaxScope is a proxy that performs
on-the-fly parsing and instrumentation of JavaScript
code as it is sent to users' browsers. AjaxScope
provides facilities for distributed and adaptive
instrumentation in order to reduce the client-side
overhead, while giving fine-grained visibility into the
code-level behavior of web applications. We present a
variety of policies demonstrating the power of
AjaxScope, ranging from simple error reporting and
performance profiling to more complex memory leak
detection and optimization analyses. We also apply our
prototype to analyze the behavior of over 90 Web 2.0
applications and sites that use large amounts of
JavaScript.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "software instrumentation; software monitoring; web
applications",
}
@Article{Chong:2007:SWA,
author = "Stephen Chong and Jed Liu and Andrew C. Myers and Xin
Qi and K. Vikram and Lantian Zheng and Xin Zheng",
title = "Secure {Web} application via automatic partitioning",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "31--44",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294265",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Swift is a new, principled approach to building web
applications that are secure by construction. In modern
web applications, some application functionality is
usually implemented as client-side code written in
JavaScript. Moving code and data to the client can
create security vulnerabilities, but currently there
are no good methods for deciding when it is secure to
do so. Swift automatically partitions application code
while providing assurance that the resulting placement
is secure and efficient. Application code is written as
Java-like code annotated with information flow policies
that specify the confidentiality and integrity of web
application information. The compiler uses these
policies to automatically partition the program into
JavaScript code running in the browser, and Java code
running on the server. To improve interactive
performance, code and data are placed on the client
side. However, security-critical code and data are
always placed on the server. Code and data can also be
replicated across the client and server, to obtain both
security and performance. A max-flow algorithm is used
to place code and data in a way that minimizes
client-server communication.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "compilers; information flow; security policies",
}
@Article{Kotla:2007:ZSB,
author = "Ramakrishna Kotla and Lorenzo Alvisi and Mike Dahlin
and Allen Clement and Edmund Wong",
title = "{Zyzzyva}: speculative {Byzantine} fault tolerance",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "45--58",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294267",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present Zyzzyva, a protocol that uses speculation
to reduce the cost and simplify the design of Byzantine
fault tolerant state machine replication. In Zyzzyva,
replicas respond to a client's request without first
running an expensive three-phase commit protocol to
reach agreement on the order in which the request must
be processed. Instead, they optimistically adopt the
order proposed by the primary and respond immediately
to the client. Replicas can thus become temporarily
inconsistent with one another, but clients detect
inconsistencies, help correct replicas converge on a
single total ordering of requests, and only rely on
responses that are consistent with this total order.
This approach allows Zyzzyva to reduce replication
overheads to near their theoretical minimal.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Byzantine fault tolerance; output commit; replication;
speculative execution",
}
@Article{Vandiver:2007:TBF,
author = "Ben Vandiver and Hari Balakrishnan and Barbara Liskov
and Sam Madden",
title = "Tolerating {Byzantine} faults in transaction
processing systems using commit barrier scheduling",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "59--72",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294268",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes the design, implementation, and
evaluation of a replication scheme to handle Byzantine
faults in transaction processing database systems. The
scheme compares answers from queries and updates on
multiple replicas which are unmodified, off-the-shelf
systems, to provide a single database that is Byzantine
fault tolerant. The scheme works when the replicas are
homogeneous, but it also allows heterogeneous
replication in which replicas come from different
vendors. Heterogeneous replicas reduce the impact of
bugs and security compromises because they are
implemented independently and are thus less likely to
suffer correlated failures.\par
The main challenge in designing a replication scheme
for transaction-processing systems is ensuring that the
different replicas execute transactions in equivalent
serial orders while allowing a high degree of
concurrency. Our scheme meets this goal using a novel
concurrency control protocol, commit barrier scheduling
(CBS). We have implemented CBS in the context of a
replicated SQL database, HRDB(Heterogeneous Replicated
DB), which has been tested with unmodified production
versions of several commercial and open source
databases as replicas. Our experiments show an HRDB
configuration that can tolerate one faulty replica has
only a modest performance overhead(about 17\% for the
TPC-C benchmark). HRDB successfully masks several
Byzantine faults observed in practice and we have used
it to find a new bug in MySQL.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Byzantine fault tolerance; databases; state machine
replication",
}
@Article{Hendricks:2007:LOB,
author = "James Hendricks and Gregory R. Ganger and Michael K.
Reiter",
title = "Low-overhead {Byzantine} fault-tolerant storage",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "73--86",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294269",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents an erasure-coded Byzantine
fault-tolerant block storage protocol that is nearly as
efficient as protocols that tolerate only crashes.
Previous Byzantine fault-tolerant block storage
protocols have either relied upon replication, which is
inefficient for large blocks of data when tolerating
multiple faults, or a combination of additional
servers, extra computation, and versioned storage. To
avoid these expensive techniques, our protocol employs
novel mechanisms to optimize for the common case when
faults and concurrency are rare. In the common case, a
write operation completes in two rounds of
communication and a read completes in one round. The
protocol requires a short checksum comprised of
cryptographic hashes and homomorphic fingerprints. It
achieves throughput within 10\% of the crash-tolerant
protocol for writes and reads in failure-free runs when
configured to tolerate up to 6 faulty servers and any
number of faulty clients.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Byzantine fault-tolerant storage",
}
@Article{Rossbach:2007:TUM,
author = "Christopher J. Rossbach and Owen S. Hofmann and Donald
E. Porter and Hany E. Ramadan and Bhandari Aditya and
Emmett Witchel",
title = "{TxLinux}: using and managing hardware transactional
memory in an operating system",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "87--102",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294271",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "TxLinux is a variant of Linux that is the first
operating system to use hardware transactional memory
(HTM) as a synchronization primitive, and the first to
manage HTM in the scheduler. This paper describes and
measures TxLinux and discusses two innovations in
detail: cooperation between locks and transactions, and
the integration of transactions with the OS scheduler.
Mixing locks and transactions requires a new primitive,
cooperative transactional spinlocks (cxspinlocks) that
allow locks and transactions to protect the same data
while maintaining the advantages of both
synchronization primitives. Cxspinlocks allow the
system to attempt execution of critical regions with
transactions and automatically roll back to use locking
if the region performs I/O. Integrating the scheduler
with HTM eliminates priority inversion. On a series of
real-world benchmarks TxLinux has similar performance
to Linux, exposing concurrency with as many as 32
concurrent threads on 32 CPUs in the same critical
region.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "MetaTM; operating systems; optimistic concurrency;
synchronization; transactional memory; TxLinux",
}
@Article{Lu:2007:MAI,
author = "Shan Lu and Soyeon Park and Chongfeng Hu and Xiao Ma
and Weihang Jiang and Zhenmin Li and Raluca A. Popa and
Yuanyuan Zhou",
title = "{MUVI}: automatically inferring multi-variable access
correlations and detecting related semantic and
concurrency bugs",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "103--116",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294272",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Software defects significantly reduce system
dependability. Among various types of software bugs,
semantic and concurrency bugs are two of the most
difficult to detect. This paper proposes a novel
method, called MUVI, that detects an important class of
semantic and concurrency bugs. MUVI automatically
infers commonly existing multi-variable access
correlations through code analysis and then detects two
types of related bugs: (1) inconsistent
updates--correlated variables are not updated in a
consistent way, and (2) multi-variable concurrency
bugs--correlated accesses are not protected in the same
atomic sections in concurrent programs. We evaluate
MUVI on four large applications: Linux, Mozilla,MySQL,
and PostgreSQL. MUVI automatically infers more than
6000 variable access correlations with high accuracy
(83\%).Based on the inferred correlations, MUVI detects
39 new inconsistent update semantic bugs from the
latest versions of these applications, with 17 of them
recently confirmed by the developers based on our
reports. We also implemented MUVI multi-variable
extensions to two representative data race bug
detection methods (lock-set and happens-before). Our
evaluation on five real-world multi-variable
concurrency bugs from Mozilla and MySQL shows that the
MUVI-extension correctly identifies the root causes of
four out of the five multi-variable concurrency bugs
with 14\% additional overhead on average.
Interestingly, MUVI also helps detect four new
multi-variable concurrency bugs in Mozilla that have
never been reported before. None of the nine bugs can
be identified correctly by the original race detectors
without our MUVI extensions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "bug detection; concurrency bug; variable correlation",
}
@Article{Costa:2007:BSS,
author = "Manuel Costa and Miguel Castro and Lidong Zhou and
Lintao Zhang and Marcus Peinado",
title = "{Bouncer}: securing software by blocking bad input",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "117--130",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294274",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Attackers exploit software vulnerabilities to control
or crash programs. Bouncer uses existing software
instrumentation techniques to detect attacks and it
generates filters automatically to block exploits of
the target vulnerabilities. The filters are deployed
automatically by instrumenting system calls to drop
exploit messages. These filters introduce low overhead
and they allow programs to keep running correctly under
attack. Previous work computes filters using symbolic
execution along the path taken by a sample exploit, but
attackers can bypass these filters by generating
exploits that follow a different execution path.
Bouncer introduces three techniques to generalize
filters so that they are harder to bypass: a new form
of program slicing that uses a combination of static
and dynamic analysis to remove unnecessary conditions
from the filter; symbolic summaries for common library
functions that characterize their behavior succinctly
as a set of conditions on the input; and generation of
alternative exploits guided by symbolic execution.
Bouncer filters have low overhead, they do not have
false positives by design, and our results show that
Bouncer can generate filters that block all exploits of
some real-world vulnerabilities.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "precondition slicing; symbolic execution",
}
@Article{Tucek:2007:TDP,
author = "Joseph Tucek and Shan Lu and Chengdu Huang and Spiros
Xanthos and Yuanyuan Zhou",
title = "{Triage}: diagnosing production run failures at the
user's site",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "131--144",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294275",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Diagnosing production run failures is a challenging
yet important task. Most previous work focuses on
offsite diagnosis, i.e.development site diagnosis with
the programmers present. This is insufficient for
production-run failures as: (1) it is difficult to
reproduce failures offsite for diagnosis; (2) offsite
diagnosis cannot provide timely guidance for recovery
or security purposes; (3)it is infeasible to provide a
programmer to diagnose every production run failure;
and (4) privacy concerns limit the release of
information(e.g. coredumps) to programmers.\par
To address production-run failures, we propose a
system, called Triage, that automatically performs
onsite software failure diagnosis at the very moment of
failure. It provides a detailed diagnosis report,
including the failure nature, triggering conditions,
related code and variables, the fault propagation
chain, and potential fixes. Triage achieves this by
leveraging lightweight reexecution support to
efficiently capture the failure environment and
repeatedly replay the moment of failure, and
dynamically--using different diagnosis
techniques--analyze an occurring failure. Triage
employs a failure diagnosis protocol that mimics the
steps a human takes in debugging. This extensible
protocol provides a framework to enable the use of
various existing and new diagnosis techniques. We also
propose a new failure diagnosis technique, delta
analysis, to identify failure related conditions, code,
and variables.\par
We evaluate these ideas in real system experiments with
10 real software failures from 9 open source
applications including four servers. Triage accurately
diagnoses the evaluated failures, providing likely root
causes and even the fault propagation chain, while
keeping normal-run overhead to under 5\%. Finally, our
user study of the diagnosis and repair of real bugs
shows that Triage saves time (99.99\% confidence),
reducing the total time to fix by almost half.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "debugging; diagnosis; onsite",
}
@Article{Tan:2007:IBB,
author = "Lin Tan and Ding Yuan and Gopal Krishna and Yuanyuan
Zhou",
title = "{\tt /*icomment: bugs or bad comments?*/}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "145--158",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294276",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Commenting source code has long been a common practice
in software development. Compared to source code,
comments are more direct, descriptive and
easy-to-understand. Comments and source code provide
relatively redundant and independent information
regarding a program's semantic behavior. As software
evolves, they can easily grow out-of-sync, indicating
two problems: (1) bugs --- the source code does not
follow the assumptions and requirements specified by
correct program comments; (2) bad comments --- comments
that are inconsistent with correct code, which can
confuse and mislead programmers to introduce bugs in
subsequent versions. Unfortunately, as most comments
are written in natural language, no solution has been
proposed to automatically analyze comments and detect
inconsistencies between comments and source code. This
paper takes the first step in automatically analyzing
comments written in natural language to extract
implicit program rules and use these rules to
automatically detect inconsistencies between comments
and source code, indicating either bugs or bad
comments. Our solution, iComment, combines Natural
Language Processing(NLP), Machine Learning, Statistics
and Program Analysis techniques to achieve these goals.
We evaluate iComment on four large code bases: Linux,
Mozilla, Wine and Apache. Our experimental results show
that iComment automatically extracts 1832 rules from
comments with 90.8-100\% accuracy and detects 60
comment-code inconsistencies, 33 new bugs and 27 bad
comments, in the latest versions of the four programs.
Nineteen of them (12 bugs and 7 bad comments) have
already been confirmed by the corresponding developers
while the others are currently being analyzed by the
developers.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "comment analysis; natural language processing for
software engineering; programming rules and static
analysis",
}
@Article{Aguilera:2007:SNP,
author = "Marcos K. Aguilera and Arif Merchant and Mehul Shah
and Alistair Veitch and Christos Karamanolis",
title = "{Sinfonia}: a new paradigm for building scalable
distributed systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "159--174",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294278",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We propose a new paradigm for building scalable
distributed systems. Our approach does not require
dealing with message-passing protocols --- a major
complication in existing distributed systems. Instead,
developers just design and manipulate data structures
within our service called Sinfonia. Sinfonia keeps data
for applications on a set of memory nodes, each
exporting a linear address space. At the core of
Sinfonia is a novel minitransaction primitive that
enables efficient and consistent access to data, while
hiding the complexities that arise from concurrency and
failures. Using Sinfonia, we implemented two very
different and complex applications in a few months: a
cluster file system and a group communication service.
Our implementations perform well and scale to hundreds
of machines.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distributed systems; fault tolerance; scalability;
shared memory; transactions; two-phase commit",
}
@Article{Haeberlen:2007:PPA,
author = "Andreas Haeberlen and Petr Kouznetsov and Peter
Druschel",
title = "{PeerReview}: practical accountability for distributed
systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "175--188",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294279",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We describe PeerReview, a system that provides
accountability in distributed systems. PeerReview
ensures that Byzantine faults whose effects are
observed by a correct node are eventually detected and
irrefutably linked to a faulty node. At the same time,
PeerReview ensures that a correct node can always
defend itself against false accusations. These
guarantees are particularly important for systems that
span multiple administrative domains, which may not
trust each other. PeerReview works by maintaining a
secure record of the messages sent and received by each
node. The record is used to automatically detect when a
node's behavior deviates from that of a given reference
implementation, thus exposing faulty nodes. PeerReview
is widely applicable: it only requires that a correct
node's actions are deterministic, that nodes can sign
messages, and that each node is periodically checked by
a correct node. We demonstrate that PeerReview is
practical by applying it to three different types of
distributed systems: a network filesystem, a
peer-to-peer system, and an overlay multicast system.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "accountability; Byzantine faults; distributed systems;
fault detection",
}
@Article{Chun:2007:AAO,
author = "Byung-Gon Chun and Petros Maniatis and Scott Shenker
and John Kubiatowicz",
title = "Attested append-only memory: making adversaries stick
to their word",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "189--204",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294280",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Researchers have made great strides in improving the
fault tolerance of both centralized and replicated
systems against arbitrary (Byzantine) faults. However,
there are hard limits to how much can be done with
entirely untrusted components; for example, replicated
state machines cannot tolerate more than a third of
their replica population being Byzantine. In this
paper, we investigate how minimal trusted abstractions
can push through these hard limits in practical ways.
We propose Attested Append-Only Memory (A2M), a trusted
system facility that is small, easy to implement and
easy to verify formally. A2M provides the programming
abstraction of a trusted log, which leads to protocol
designs immune to equivocation -- the ability of a
faulty host to lie in different ways to different
clients or servers -- which is a common source of
Byzantine headaches. Using A2M, we improve upon the
state of the art in Byzantine-fault tolerant replicated
state machines, producing A2M-enabled protocols
(variants of Castro and Liskov's PBFT) that remain
correct (linearizable) and keep making progress (live)
even when half the replicas are faulty, in contrast to
the previous upper bound. We also present an
A2M-enabled single-server shared storage protocol that
guarantees linearizability despite server faults. We
implement A2M and our protocols, evaluate them
experimentally through micro- and macro-benchmarks, and
argue that the improved fault tolerance is
cost-effective for a broad range of uses, opening up
new avenues for practical, more reliable services.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "attested append-only memory; Byzantine-fault
tolerance; equivocation; replicated state machines;
shared storage",
}
@Article{DeCandia:2007:DAH,
author = "Giuseppe DeCandia and Deniz Hastorun and Madan Jampani
and Gunavardhan Kakulapati and Avinash Lakshman and
Alex Pilchin and Swaminathan Sivasubramanian and Peter
Vosshall and Werner Vogels",
title = "{Dynamo}: {Amazon}'s highly available key-value
store",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "205--220",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294281",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Reliability at massive scale is one of the biggest
challenges we face at Amazon.com, one of the largest
e-commerce operations in the world; even the slightest
outage has significant financial consequences and
impacts customer trust. The Amazon.com platform, which
provides services for many web sites worldwide, is
implemented on top of an infrastructure of tens of
thousands of servers and network components located in
many datacenters around the world. At this scale, small
and large components fail continuously and the way
persistent state is managed in the face of these
failures drives the reliability and scalability of the
software systems.\par
This paper presents the design and implementation of
Dynamo, a highly available key-value storage system
that some of Amazon's core services use to provide an
`always-on' experience. To achieve this level of
availability, Dynamo sacrifices consistency under
certain failure scenarios. It makes extensive use of
object versioning and application-assisted conflict
resolution in a manner that provides a novel interface
for developers to use.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "performance; reliability; scalability",
}
@Article{Crameri:2007:SDM,
author = "Olivier Crameri and Nikola Knezevic and Dejan Kostic
and Ricardo Bianchini and Willy Zwaenepoel",
title = "Staged deployment in {Mirage}, an integrated software
upgrade testing and distribution system",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "221--236",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294283",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Despite major advances in the engineering of
maintainable and robust software over the years,
upgrading software remains a primitive and error-prone
activity. In this paper, we argue that several problems
with upgrading software are caused by a poor
integration between upgrade deployment, user-machine
testing, and problem reporting. To support this
argument, we present a characterization of software
upgrades resulting from a survey we conducted of 50
system administrators. Motivated by the survey results,
we present Mirage, a distributed framework for
integrating upgrade deployment, user-machine testing,
and problem reporting into the overall upgrade
development process. Our evaluation focuses on the most
novel aspect of Mirage, namely its staged upgrade
deployment based on the clustering of user machines
according to their environments and configurations. Our
results suggest that Mirage's staged deployment is
effective for real upgrade problems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "clustering of machines; staged software upgrade
deployment; upgrade testing",
}
@Article{Su:2007:AIC,
author = "Ya-Yunn Su and Mona Attariyan and Jason Flinn",
title = "{AutoBash}: improving configuration management with
operating system causality analysis",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "237--250",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294284",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "AutoBash is a set of interactive tools that helps
users and system administrators manage configurations.
AutoBash leverages causal tracking support implemented
within our modified Linux kernel to understand the
inputs (causal dependencies) and outputs (causal
effects) of configuration actions. It uses OS-level
speculative execution to try possible actions, examine
their effects, and roll them back when necessary.
AutoBash automates many of the tedious parts of trying
to fix a misconfiguration, including searching through
possible solutions, testing whether a particular
solution fixes a problem, and undoing changes to
persistent and transient state when a solution fails.
Our results show that AutoBash correctly identifies the
solution to several CVS, gcc cross-compiler, and Apache
configuration errors. We also show that causal analysis
reduces AutoBash's search time by an average of 35\%
and solution verification time by an average of 70\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "causality; configuration management; speculative
execution",
}
@Article{Klues:2007:ICC,
author = "Kevin Klues and Vlado Handziski and Chenyang Lu and
Adam Wolisz and David Culler and David Gay and Philip
Levis",
title = "Integrating concurrency control and energy management
in device drivers",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "251--264",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294286",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Energy management is a critical concern in wireless
sensornets. Despite its importance, sensor network
operating systems today provide minimal energy
management support, requiring applications to
explicitly manage system power states. To address this
problem, we present ICEM, a device driver architecture
that enables simple, energy efficient wireless
sensornet applications. The key insight behind ICEMis
that the most valuable information an application can
give the OS for energy management is its concurrency.
Using ICEM, a low-rate sensing application requires
only a single line of energy management code and has an
efficiency within 1.6\% of a hand-tuned implementation.
ICEM's effectiveness questions the assumption that
sensornet applications must be responsible for all
power management and sensornets cannot have a
standardized OS with a simple API.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "concurrency; device driver architecture; energy;
tinyOS",
}
@Article{Nathuji:2007:VCP,
author = "Ripal Nathuji and Karsten Schwan",
title = "{VirtualPower}: coordinated power management in
virtualized enterprise systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "265--278",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294287",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Power management has become increasingly necessary in
large-scale datacenters to address costs and
limitations in cooling or power delivery. This paper
explores how to integrate power management mechanisms
and policies with the virtualization technologies being
actively deployed in these environments. The goals of
the proposed VirtualPower approach to online power
management are (i) to support the isolated and
independent operation assumed by guest virtual machines
(VMs) running on virtualized platforms and (ii) to make
it possible to control and globally coordinate the
effects of the diverse power management policies
applied by these VMs to virtualized resources. To
attain these goals, VirtualPower extends to guest VMs
`soft' versions of the hardware power states for which
their policies are designed. The resulting technical
challenge is to appropriately map VM-level updates made
to soft power states to actual changes in the states or
in the allocation of underlying virtualized hardware.
An implementation of VirtualPower Management (VPM) for
the Xen hypervisor addresses this challenge by
provision of multiple system-level abstractions
including VPM states, channels, mechanisms, and rules.
Experimental evaluations on modern multicore platforms
highlight resulting improvements in online power
management capabilities, including minimization of
power consumption with little or no performance
penalties and the ability to throttle power consumption
while still meeting application requirements. Finally,
coordination of online methods for server consolidation
with VPM management techniques in heterogeneous server
systems is shown to provide up to 34\% improvements in
power consumption.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "power management; virtualization",
}
@Article{Laadan:2007:DPV,
author = "Oren Laadan and Ricardo A. Baratto and Dan B. Phung
and Shaya Potter and Jason Nieh",
title = "{DejaView}: a personal virtual computer recorder",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "279--292",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294289",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As users interact with the world and their peers
through their computers, it is becoming important to
archive and later search the information that they have
viewed. We present DejaView, a personal virtual
computer recorder that provides a complete record of a
desktop computing experience that a user can playback,
browse, search, and revive seamlessly. DejaView records
visual output, checkpoints corresponding application
and file system state, and captures displayed text with
contextual information to index the record. A user can
then browse and search the record for any visual
information that has been displayed on the desktop, and
revive and interact with the desktop computing state
corresponding to any point in the record. DejaView
combines display, operating system, and file system
virtualization to provide its functionality
transparently without any modifications to
applications, window systems, or operating system
kernels. We have implemented DejaView and evaluated its
performance on real-world desktop applications. Our
results demonstrate that DejaView can provide
continuous low-overhead recording without any user
noticeable performance degradation, and allows
browsing, search and playback of records fast enough
for interactive use.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "desktop search; virtualization",
}
@Article{Gunawi:2007:IFS,
author = "Haryadi S. Gunawi and Vijayan Prabhakaran and Swetha
Krishnan and Andrea C. Arpaci-Dusseau and Remzi
H. Arpaci-Dusseau",
title = "Improving file system reliability with {I/O}
shepherding",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "293--306",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294290",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We introduce a new reliability infrastructure for file
systems called I/O shepherding. I/O shepherding allows
a file system developer to craft nuanced reliability
policies to detect and recover from a wide range of
storage system failures. We incorporate shepherding
into the Linux ext3 file system through a set of
changes to the consistency management subsystem, layout
engine, disk scheduler, and buffer cache. The resulting
file system, CrookFS, enables a broad class of policies
to be easily and correctly specified. We implement
numerous policies, incorporating data protection
techniques such as retry, parity, mirrors, checksums,
sanity checks, and data structure repairs; even complex
policies can be implemented in less than 100 lines of
code, confirming the power and simplicity of the
shepherding framework. We also demonstrate that
shepherding is properly integrated, adding less than
5\% overhead to the I/O path.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "fault tolerance; I/O shepherding; reliability;
storage",
}
@Article{Frost:2007:GFS,
author = "Christopher Frost and Mike Mammarella and Eddie Kohler
and Andrew de los Reyes and Shant Hovsepian and Andrew
Matsuoka and Lei Zhang",
title = "Generalized file system dependencies",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "307--320",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1323293.1294291",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Reliable storage systems depend in part on
`write-before' relationships where some changes to
stable storage are delayed until other changes commit.
A journaled file system, for example, must commit a
journal transaction before applying that transaction's
changes, and soft updates and other consistency
enforcement mechanisms have similar constraints,
implemented in each case in system-dependent ways. We
present a general abstraction, the patch, that makes
write-before relationships explicit and file system
agnostic. A patch-based file system implementation
expresses dependencies among writes, leaving lower
system layers to determine write orders that satisfy
those dependencies. Storage system modules can examine
and modify the dependency structure, and generalized
file system dependencies are naturally exportable to
user level. Our patch-based storage system, Feather
stitch, includes several important optimizations that
reduce patch overheads by orders of magnitude. Our ext2
prototype runs in the Linux kernel and supports a
synchronous writes, soft updates-like dependencies, and
journaling. It outperforms similarly reliable ext2 and
ext3 configurations on some, but not all, benchmarks.
It also supports unusual configurations, such as
correct dependency enforcement within a loopback file
system, and lets applications define consistency
requirements without micromanaging how those
requirements are satisfied.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "dependencies; file systems; journaling; soft updates",
}
@Article{Krohn:2007:IFC,
author = "Maxwell Krohn and Alexander Yip and Micah Brodsky and
Natan Cliffer and M. Frans Kaashoek and Eddie Kohler
and Robert Morris",
title = "Information flow control for standard {OS}
abstractions",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "321--334",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294293",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Decentralized Information Flow Control (DIFC) is an
approach to security that allows application writers to
control how data flows between the pieces of an
application and the outside world. As applied to
privacy, DIFC allows untrusted software to compute with
private data while trusted security code controls the
release of that data. As applied to integrity, DIFC
allows trusted code to protect untrusted software from
unexpected malicious inputs. In either case, only bugs
in the trusted code, which tends to be small and
isolated, can lead to security violations.\par
We present Flume, a new DIFC model that applies at the
granularity of operating system processes and standard
OS abstractions (e.g., pipes and file descriptors).
Flume was designed for simplicity of mechanism, to ease
DIFC's use in existing applications, and to allow safe
interaction between conventional and DIFC-aware
processes. Flume runs as a user-level reference monitor
on Linux. A process confined by Flume cannot perform
most system calls directly; instead, an interposition
layer replaces system calls with IPCto the reference
monitor, which enforces data flow policies and performs
safe operations on the process's behalf. We ported a
complex web application (MoinMoin Wiki) to Flume,
changing only 2\% of the original code. Performance
measurements show a 43\% slowdown on read workloads and
a 34\% slowdown on write workloads, which are mostly
due to Flume's user-level implementation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "decentralized information flow control; DIFC;
endpoints; reference monitor; system call
interposition; web services",
}
@Article{Seshadri:2007:STH,
author = "Arvind Seshadri and Mark Luk and Ning Qu and Adrian
Perrig",
title = "{SecVisor}: a tiny hypervisor to provide lifetime
kernel code integrity for commodity {OSes}",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "335--350",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294294",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We propose SecVisor, a tiny hypervisor that ensures
code integrity for commodity OS kernels. In particular,
SecVisor ensures that only user-approved code can
execute in kernel mode over the entire system lifetime.
This protects the kernel against code injection
attacks, such as kernel rootkits. SecVisor can achieve
this property even against an attacker who controls
everything but the CPU, the memory controller, and
system memory chips. Further, SecVisor can even defend
against attackers with knowledge of zero-day kernel
exploits.\par
Our goal is to make SecVisor amenable to formal
verification and manual audit, thereby making it
possible to rule out known classes of vulnerabilities.
To this end, SecVisor offers small code size and small
external interface. We rely on memory virtualization to
build SecVisor and implement two versions, one using
software memory virtualization and the other using
CPU-supported memory virtualization. The code sizes of
the runtime portions of these versions are 1739 and
1112 lines, respectively. The size of the external
interface for both versions of SecVisor is 2
hypercalls. It is easy to port OS kernels to SecVisor.
We port the Linux kernel version 2.6.20 by adding 12
lines and deleting 81 lines, out of a total of
approximately 4.3 million lines of code in the
kernel.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "code attestation; code injection attacks; code
integrity; hypervisor; memory virtualization;
preventing",
}
@Article{Criswell:2007:SVA,
author = "John Criswell and Andrew Lenharth and Dinakar Dhurjati
and Vikram Adve",
title = "Secure virtual architecture: a safe execution
environment for commodity operating systems",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "351--366",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294295",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes an efficient and robust approach
to provide a safe execution environment for an entire
operating system, such as Linux, and all its
applications. The approach, which we call Secure
Virtual Architecture (SVA), defines a virtual,
low-level, typed instruction set suitable for executing
all code on a system, including kernel and application
code. SVA code is translated for execution by a virtual
machine transparently, offline or online. SVA aims to
enforce fine-grained (object level) memory safety,
control-flow integrity, type safety for a subset of
objects, and sound analysis. A virtual machine
implementing SVA achieves these goals by using a novel
approach that exploits properties of existing memory
pools in the kernel and by preserving the kernel's
explicit control over memory, including custom
allocators and explicit deallocation. Furthermore, the
safety properties can be encoded compactly as
extensions to the SVA type system, allowing the
(complex) safety checking compiler to be outside the
trusted computing base. SVA also defines a set of OS
interface operations that abstract all privileged
hardware instructions, allowing the virtual machine to
monitor all privileged operations and control the
physical resources on a given hardware platform. We
have ported the Linux kernel to SVA, treating it as a
new architecture, and made only minimal code changes
(less than 300 lines of code) to the
machine-independent parts of the kernel and device
drivers. SVA is able to prevent 4 out of 5 memory
safety exploits previously reported for the Linux
2.4.22 kernel for which exploit code is available, and
would prevent the fifth one simply by compiling an
additional kernel library.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "compiler; memory safety; operating systems; security;
typed assembly language; type safety; virtual machine",
}
@Article{DaSilva:2008:I,
author = "Dilma {Da Silva} and Robert W. Wisniewski",
title = "Introduction",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "1--1",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341314",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "IBM researchers work at the frontiers of a wide range
of areas. Many have very distinguished careers. IBM
Research has had five Nobel Laureates and six Turing
Award winners, including the latest (and first woman
ever), Fran Allen. IBM has eight inductees into the
National Inventors Hall of Fame and has led the world
in patents for the past 14 years. Seminal innovations
include Fortran, DRAM, RISC, and relational databases,
to name a few. The research agenda is diverse, spanning
behavioral science, chemistry, computer science,
electrical engineering, materials science, mathematical
sciences, biological sciences, physics, and service
science. This diversity is organized into four main
areas: Services, Software, Systems, and Technology.
Three thousand researchers world wide are employed at
labs located near Austin (Texas), Beijing, Delhi,
Haifa, San Jose (California), Tokyo, Yorktown Heights
(New York), and Zurich. The labs also host many
visiting professors and post-doctoral researchers. IBM
Research benefits from the energy and enthusiasm of a
large number of student interns (more than 400 this
past summer in the US labs) who bring a fresh
perspective to our initiatives and strengthen our ties
with academia.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ben-Yehuda:2008:OSF,
author = "Muli Ben-Yehuda and Eric {Van Hensbergen}",
title = "Open source as a foundation for systems research",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "2--4",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341315",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "You are a systems researcher at a corporate research
lab. The corporation you work for deals with both
proprietary and open source software. You have an
exciting new idea that will undoubtedly revolutionize
the field, but first you need to build a working system
to validate it. Before embarking on your exploratory
research project, you must decide: Do you start from
scratch, or do you build upon a mature system? And if
the latter---should the system be proprietary or open
source?",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wisniewski:2008:KLC,
author = "Robert W. Wisniewski and Dilma da Silva and Marc
Auslander and Orran Krieger and Michal Ostrowski and
Bryan Rosenburg",
title = "{K42}: lessons for the {OS} community",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "5--12",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341316",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We started the K42 project more than ten years ago
with the ambitious goal of developing an operating
system for next-generation hardware that would be
widely valued and thus widely used. Based on the
premise that current operating systems were not
designed to be scalable, customizable, or maintainable,
we set forth to rectify that by applying proven
techniques from other disciplines to operating systems
and by developing additional innovative
mechanisms.\par
Now, ten year later, K42 is used by ten or so
universities and national labs for research purposes,
not ten million information technology departments
desiring better everyday computing platforms. As a
presentation to the primary operating systems community
we provide an examination from two different
perspectives as to what went right and what went wrong.
First, we concentrate on what technology worked well
and why, and what technology failed or caused undue
difficulties, and why. Second, based on that
experience, we provide our thoughts on the state and
direction of the OS community at large.\par
To be clear, this paper is neither a results paper nor
an overview paper; we refer to other papers for
background material. Rather, it is an exploration by
researchers with experience with at least six different
previous operating systems of the merit of technologies
investigated in K42, and an extrapolation of the
implications of that experience to the wider operating
system community.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jann:2008:EEP,
author = "Joefon Jann and R. Sarma Burugula and Niteesh Dubey
and Pratap Pattnaik",
title = "End-to-end performance of commercial applications in
the face of changing hardware",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "13--20",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341317",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper investigates the changes in AIX behavior,
or the lack of them, and the resulting performance
impact from a generational change in servers in a
typical large scale eCommerce application environment
without extensive tuning of the OS and the application
stack for the changing hardware. We have investigated
the performance and impediments to performance at the
microprocessor level and at the OS level. This paper
dissects the performance data as observed from the OS
and from hardware performance counters, and suggests
areas for further improvements.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "AIX; POWER5+; POWER6; WebSphere",
}
@Article{Ruan:2008:DCS,
author = "Yaoping Ruan and Vivek S. Pai and Erich Nahum and John
M. Tracey",
title = "Do commodity {SMT} processors need more {OS}
research?",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "21--25",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341318",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The availability of Simultaneous Multithreading (SMT)
in commodity processors such as the Pentium 4 (P4) has
raised interest among OS researchers. While earlier
simulation studies of SMT suggested exciting
performance potential, observed improvement on the P4
has been much more restrained, raising the hope that OS
research can help bridge the gap. We argue that OS
research for current commodity Simultaneous
Multithreading (SMT) processors is unlikely to yield
significant benefits. In general, we find that SMT
processor simulations were optimistic about cache and
memory performance characteristics, while overlooking
the OS overheads of SMT kernels versus uniprocessor
kernels. Using measurement and analysis on actual
hardware, we find that little opportunity exists for
realistic performance gains on commodity SMT beyond
what is currently achieved.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pelleg:2008:VBD,
author = "Dan Pelleg and Muli Ben-Yehuda and Rick Harper and
Lisa Spainhower and Tokunbo Adeshiyan",
title = "{Vigilant}: out-of-band detection of failures in
virtual machines",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "26--31",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341319",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "What do our computer systems do all day? How do we
make sure they continue doing it when failures occur?
Traditional approaches to answering these questions
often involve in-band monitoring agents. However
in-band agents suffer from several drawbacks: they need
to be written or customized for every workload
(operating system and possibly also application), they
comprise potential security liabilities, and are
themselves affected by adverse conditions in the
monitored systems.\par
Virtualization technology makes it possible to
encapsulate an entire operating system or application
instance within a virtual object that can then be
easily monitored and manipulated without any knowledge
of the contents or behavior of that object. This can be
done out-of-band, using general purpose agents that do
not reside inside the object, and hence are not
affected by the behavior of the object.\par
This paper describes Vigilant, a novel way of
monitoring virtual machines for problems. Vigilant
requires no specialized agents inside a virtual object
it is monitoring. Instead, it uses the hypervisor to
directly monitor the resource requests and utilization
of an object. Machine learning methods are then used to
analyze the readings. Our experimental results show
that problems can be detected out-of-band with high
accuracy. Using Vigilant we demonstrate that
out-of-band monitoring using virtualization and machine
learning can accurately identify faults in the guest
OS, while avoiding the many pitfalls associated with
in-band monitoring.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Toll:2008:CSE,
author = "David C. Toll and Paul A. Karger and Elaine R. Palmer
and Suzanne K. McIntosh and Sam Weber",
title = "The {Caernarvon} secure embedded operating system",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "32--39",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341320",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Caernarvon operating system was developed to
demonstrate that a high assurance system for smart
cards was technically feasible and commercially viable.
The entire system has been designed to be evaluated
under the Common Criteria at EAL7, the highest defined
level of assurance.\par
Historically, smart card processors have not supported
the hardware protection features necessary to separate
the OS from the applications, and one application from
another. The Caernarvon OS has taken advantage of the
first smart card processors with such features to be
the first smart card OS to provide this kind of
protection. Even when compared with conventional
systems where the hardware protection is routine, the
Caernarvon OS is noteworthy, because of the EAL7
assurance.\par
This approach facilitated implementation of a formally
specified, mandatory security policy providing
multi-level security (MLS) suitable for both government
agencies and commercial users. The mandatory security
policy requires effective authentication of its users
that is independent of applications. For this reason,
the Caernarvon OS also contains a privacy-preserving,
two-way authentication protocol integrated with the
Mandatory Security Policy.\par
The Caernarvon OS includes a strong cryptographic
library that has been separately certified under the
Common Criteria at EAL5+ for use with other systems.
The Caernarvon OS implements a secure method for
downloading trusted and untrusted application software
and data in the field, with the assumption that all
applications are potentially hostile. While the initial
platform for the operating system was smart cards, the
design could also be used in other embedded devices,
such as USB tokens, PDAs, cell phones, etc.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "common criteria evaluation; embedded systems;
mandatory access controls; mobile phones; operating
systems; PDAs; smart cards",
}
@Article{Berger:2008:TMS,
author = "Stefan Berger and Ram{\'o}n C{\'a}ceres and Dimitrios
Pendarakis and Reiner Sailer and Enriquillo Valdez and
Ronald Perez and Wayne Schildhauer and Deepa Srinivasan",
title = "{TVDc}: managing security in the trusted virtual
datacenter",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "40--47",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341321",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualization technology is becoming increasingly
common in datacenters, since it allows for collocation
of multiple workloads, consisting of operating systems,
middleware and applications, in different virtual
machines (VMs) on shared physical hardware platforms.
However, when coupled with the ease of VM migration,
this trend increases the potential surface for security
attacks. Further, the simplified management of VMs,
including creation, cloning and migration, makes it
imperative to monitor and guarantee the integrity of
software components running within VMs.\par
This paper presents the IBM Trusted Virtual Datacenter
(TVDc) technology developed to address the need for
strong isolation and integrity guarantees, thus
significantly enhancing security and systems management
capabilities, in virtualized environments. It signifies
the first effort to incorporate trusted computing
technologies directly into virtualization and systems
management software. We present and discuss various
components that constitute TVDc: the Trusted Platform
Module (TPM), the virtual TPM, the IBM hypervisor
security architecture (sHype) and the associated
systems management software.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "integrity; isolation; mandatory access control;
security; virtualization; virtual trusted platform
module",
}
@Article{Ananthanarayanan:2008:PPW,
author = "R. Ananthanarayanan and M. Eshel and R. Haskin and M.
Naik and F. Schmuck and R. Tewari",
title = "{Panache}: a parallel {WAN} cache for clustered
filesystems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "48--53",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341322",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Panache is a scalable, high-performance, remote file
data caching solution integrated with the GPFS cluster
file system. It leverages the inherent scalability of
GPFS to provide a multi-node, consistent cache of data
exported by a remote file system cluster. Panache
exploits the soon-to-be standard pNFS protocol to move
data in parallel from the remote file cluster.
Furthermore, it provides a POSIX compliant file system
interface making the cache completely transparent to
applications. Panache can mask the fluctuating
wide-area-network latencies and outages by supporting
asynchronous and disconnected-mode operations. It
allows concurrent updates to be made at the cache and
at the remote cluster and synchronizes them by using
conflict detection techniques to flag and handle
conflicts. To maintain commercial viability, Panache
relies on open standards for high-performance file
serving and does not require any proprietary hardware
or software to be deployed at the remote cluster. In
this paper we present the overall architecture of
Panache and its key features.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "caching; cluster filesystem; pNFS; wide-area network",
}
@Article{Banikazemi:2008:FMS,
author = "Mohammad Banikazemi and Jim Hafner and Wendy
Belluomini and KK Rao and Dan Poff and Bulent Abali",
title = "{Flipstone}: managing storage with fail-in-place and
deferred maintenance service models",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "54--62",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341323",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The cost of managing storage systems has become one of
the significant expense items in data centers. In this
paper, we discuss the design and implementation of
Flipstone, a new storage system with reduced storage
management cost. Flipstone provides fail-in-place and
deferred maintenance by aggregating large number of
off-the-shelf, inexpensive storage systems. We show a
significant improvement in total cost of ownership of
storage systems by reducing the number of service calls
when Flipstone is used.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "capacity; data migration; deferred maintenance service
model; fail-in-place service model; performance; RAID;
reliability; storage system management;
virtualization",
}
@Article{Bobroff:2008:DJS,
author = "Norman Bobroff and Gargi Dasgupta and Liana Fong and
Yanbin Liu and Balaji Viswanathan and Fabio Benedetti
and Jonathan Wagner",
title = "A distributed job scheduling and flow management
system",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "63--70",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341324",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Grid computing, as a specific model of distributed
systems, has sparked recent interest in managing job
execution among distributed resource domains.
Introduction of the meta-scheduler is a key feature in
grid evolution, and the next step is to achieve
collaborative interactions between meta-schedulers
within and external to organizational boundaries to
achieve scalability, balanced resource utilization, and
location transparency to job submitters. This paper
details a distributed system design that consists of a
collaborative meta-scheduling framework, and an
expanded resource model with schedulers and data as
resources. With this framework, we also explore job
scheduling and data management issues, and investigate
job flow and meta-scheduling interactions for new
applications that require job execution beyond simple
sequential and conditional control.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distributed systems; grid; job; job flow;
orchestration; resource management; scheduling",
}
@Article{Wang:2008:PIM,
author = "Kun Wang and Yu Zhang and Huayong Wang and Xiaowei
Shen",
title = "Parallelization of {IBM Mambo} system simulator in
functional modes",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "71--76",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341325",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Mambo [4] is IBM's full-system simulator which models
PowerPC systems, and provides a complete set of
simulation tools to help IBM and its partners in
pre-hardware development and performance evaluation for
future systems. Currently Mambo simulates target
systems on a single host thread. When the number of
cores increases in a target system, Mambo's simulation
performance for each core goes down. As the so-called
`multi-core era' approaches, both target and host
systems will have more and more cores. It is very
important for Mambo to efficiently simulate a
multi-core target system on a multi-core host system.
Parallelization is a natural method to speed up Mambo
under this situation.\par
Parallel Mambo (P-Mambo) is a multi-threaded
implementation of Mambo. Mambo's simulation engine is
implemented as a user-level thread-scheduler. We
propose a multi-scheduler method to adapt Mambo's
simulation engine to multi-threaded execution. Based on
this method a core-based module partition is proposed
to achieve both high inter-scheduler parallelism and
low inter-scheduler dependency. Protection of shared
resources is crucial to both correctness and
performance of P-Mambo. Since there are two tiers of
threads in P-Mambo, protecting shared resources by only
OS-level locks possibly introduces deadlocks due to
user-level context switch. We propose a new lock
mechanism to handle this problem. Since Mambo is an
on-going project with many modules currently under
development, co-existence with new modules is also
important to P-Mambo. We propose a global-lock-based
method to guarantee compatibility of P-Mambo with
future Mambo modules.\par
We have implemented the first version of P-Mambo in
functional modes. The performance of P-Mambo has been
evaluated on the OpenMP implementation of NAS Parallel
Benchmark (NPB) 3.2 [12]. Preliminary experimental
results show that P-Mambo achieves an average speedup
of 3.4 on a 4-core host machine.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "architectural simulation; dynamic binary translation;
parallel simulation",
}
@Article{Appavoo:2008:PKB,
author = "Jonathan Appavoo and Volkmar Uhlig and Amos
Waterland",
title = "{Project Kittyhawk}: building a global-scale computer:
{Blue Gene/P} as a generic computing platform",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "77--84",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341326",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes Project Kittyhawk, an undertaking
at IBM Research to explore the construction of a
next-generation platform capable of hosting many
simultaneous web-scale workloads. We hypothesize that
for a large class of web-scale workloads the Blue
Gene/P platform is an order of magnitude more efficient
to purchase and operate than the commodity clusters in
use today. Driven by scientific computing demands the
Blue Gene designers pursued an aggressive
system-on-a-chip methodology that led to a scalable
platform composed of air-cooled racks. Each rack
contains more than a thousand independent computers
with high-speed interconnects inside and between
racks.\par
We postulate that the same demands of efficiency and
density apply to web-scale platforms. This project aims
to develop the system software to enable Blue Gene/P as
a generic platform capable of being used by
heterogeneous workloads. We describe our firmware and
operating system work to provide Blue Gene/P with
generic system software, one of the results of which is
the ability to run thousands of heterogeneous Linux
instances connected by TCP/IP networks over the
high-speed internal interconnects.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{VanHensbergen:2008:HAR,
author = "Eric {Van Hensbergen} and Charles Forsyth and Jim
McKie and Ron Minnich",
title = "Holistic aggregate resource environment",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "85--91",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341327",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Within a few short years, we can expect to be dealing
with multi-million-thread programs running on
million-core systems [16]. This will no doubt stress
the contemporary HPC software model which was developed
in a time when 512 cores was a large number. Historical
approaches have been further challenged by the
increased desire of developers and end users for
supercomputer light weight kernels (LWKs) to support
the same environment, libraries, and tools as their
desktops. As a result, the emerging workloads of today
are far more sophisticated than those of the last two
decades when much of the HPC infrastructure was
developed, and feature the use of scripting
environments such as Python, dynamic libraries, and
complex multi-scale physics frameworks. Complicating
this picture is the overwhelming management, monitoring
and reliability problem created by the huge number of
nodes in a system of that magnitude.\par
We believe that a re-evaluation and exploration of
distributed system principals is called for in order to
address the challenges of ultrascale. To that end we
will be evaluating and extending the Plan 9 [21]
distributed system on the largest machines available to
us, namely the BG/L [28] and BG/P [10] supercomputers.
We have chosen Plan 9 based on our previous experiences
with it in combination with previous research [17]
which determined Plan 9 was a `right weight kernel',
balancing trade offs between LWKs and more general
purpose operating systems such as Linux. To deal with
issues of scale, we plan on leveraging the use of the
high-performance interconnects by system services as
well as exploring aggregation as more of a first-class
system construct -- providing dynamic hierarchical
organization and management of all resources. Our plan
is to evaluate the viability of these concepts at scale
as well as create an alternative development and
execution environment which compliments the features
and capabilities of the existing system software and
run time options. Our intent is to broaden the
application base as well as make the system as a whole
more approachable to a larger class of developers and
end-users.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Choffnes:2008:MPM,
author = "David Choffnes and Mark Astley and Michael J. Ward",
title = "Migration policies for multi-core fair-share
scheduling",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "92--93",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341328",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we describe an extension of the Linux
kernel scheduler called the Practical Fair-Share
Scheduler (PFS). PFS is a fair-share process scheduler
designed to support real-time workloads with soft (
i.e., elastic) timeliness requirements. Fair-share
scheduling is a common choice for soft real-time
systems since it is work conserving and ensures a
minimum CPU allocation for each process. A novel aspect
of PFS is its treatment of placement and migration in
SMP or multi-core settings. Other fair-share schedulers
have used ad hoc policies for handling these issues,
often leading to underutilization and increased system
lag. In contrast, PFS uses a strategy that maintains
utilization without unfairly penalizing processes. We
spend the remainder of this paper discussing placement
and migration. A more extensive description of PFS,
including source code, can be found at the download
site listed in the citations.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Steinder:2008:SVA,
author = "Ma{\l}gorzata Steinder and Ian Whalley and David
Chess",
title = "Server virtualization in autonomic management of
heterogeneous workloads",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "94--95",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341329",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Server virtualization opens up a range of new
possibilities for autonomic datacenter management,
through the availability of new automation mechanisms
that can be exploited to control and monitor tasks
running within virtual machines. This facilitates more
powerful and flexible autonomic controls, through
management software that maintains the system in a
desired state in the face of changing workload and
demand. This paper explores in particular the use of
server virtualization technology in the autonomic
management of data centers running a heterogeneous mix
of workloads. We present a system that manages
heterogeneous workloads to their performance goals and
demonstrate its effectiveness via real-system
experiments and simulation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fong:2008:DVS,
author = "Liana Fong and Ma{\l}gorzata Steinder",
title = "Duality of virtualization: simplification and
complexity",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "96--97",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341330",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In recent years, virtualization has gained much in
visibility and importance in the information technology
(IT) industry. Many analyst reports, including IDC [1]
and EMA [2], indicated ever increasing number of
companies deployed virtualization to their production
environments. There is also tremendous momentum from
industrial vendors in creating new virtualization
enablers along with their management functions. Some
vendors engage in activities of standardizing common
abstractions for various virtual entities at different
virtualization layers.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liu:2008:PBH,
author = "Tiancheng Liu and Ying Li and Andrew Schofield and
Matt Hogstrom and Kewei Sun and Ying Chen",
title = "Partition-based heap memory management in an
application server",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "98--98",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341331",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Heap is an important shared resource in Java virtual
machine. A problem with memory management in one
component can affect the whole system and even result
in crashing the virtual machine. In this paper, we
propose a partition-based approach to manage heap in
an application server. In our approach, the shared heap
is divided into logical partitions, in which instances
of application components and server components are
allocated separately.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "application server; Java; memory management;
reliability",
}
@Article{Acharya:2008:SMC,
author = "Arup Acharya and Xiping Wang and Charles Wright",
title = "{SIP} message classification: design and performance",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "100--101",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341332",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present a design sketch of a programmable
classification engine for SIP (Session Initiation
Protocol) messages and an outline of its implementation
in the Linux kernel. In addition to classifying
messages, it can extract and maintain state information
across multiple messages. We apply the classifier for
overload control using operator-specified rules.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "overload control; programmable classification; SIP",
}
@Article{Ge:2008:DSS,
author = "Yi Ge and Chen Wang and Xiaowei Shen and Honesty
Young",
title = "A database scale-out solution for emerging
write-intensive commercial workloads",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "102--103",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341333",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Among the increasing number of online businesses, a
series of write-intensive commercial workloads are
emerging recently on the Internet. These workloads
generate many more write transactions on the backend
database than read transactions. Most of such workloads
require the database to handle high-volume write
transactions in real-time. Based on the observation on
the workloads, this paper proposes a multi-tier
database scale-out architecture with the write caching
technology. Our preliminary result shows that the
database scale-out architecture can handle extremely
high-volume write transactions with excellent
scalability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gupta:2008:MSP,
author = "Karan Gupta and Prasenjit Sarkar and Lesley Mbogo",
title = "{MIRAGE}: storage provisioning in large data centers
using balanced component utilizations",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "104--105",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341334",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents MIRAGE, an architecture for data
center storage provisioning that takes the approach of
maintaining storage services for applications by
ensuring well-balanced utilizations in all internal
components of the storage infrastructure. We
implemented MIRAGE on our local storage infrastructure
and observed the sensitivity of the MIRAGE
load-balancing algorithm to a combination of
performance and heterogeneity skews. We also evaluated
MIRAGE by deploying it on a financial data center. We
reduced the service times of resource-constrained
storage pools by an average of 68\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "algorithm; data center; storage optimization",
}
@Article{Butrico:2008:SEE,
author = "Maria Butrico and Dilma {Da Silva} and Orran Krieger
and Michal Ostrowski and Bryan Rosenburg and Dan
Tsafrir and Eric {Van Hensbergen} and Robert
W. Wisniewski and Jimi Xenidis",
title = "Specialized execution environments",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "106--107",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341335",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualization has become popular (again) as a means
of consolidating multiple operating systems (OSes) onto
a smaller set of hardware resources. The roles of OSes
in such environments have changed. Whereas normally an
OS provides balance between the demands of application
and hardware support, in the world of virtualization it
can be beneficial to split these roles. One OS may
support a particular application set and use other OSes
to interact with physical hardware. The hypervisor, or
virtualization layer, provides communication facilities
for the inter-OS communication needed to support such a
deployment model.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Agarwal:2008:PMI,
author = "Sheetal Agarwal and Dipanjan Chakraborty and Swati
Challa and Nandakishore Kambhatla and Arun Kumar and
Sougata Mukherjea and Amit Anil Nanavati and Nitendra
Rajput",
title = "{{\em Pyr.mea.IT\/}}: permeating {IT} towards the base
of the pyramid",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "108--109",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341336",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Most of the existing IT applications are designed to
cater to a small fraction of the human population. The
precluded set consists of more than a billion people
who either cannot afford a PC and Internet or are not
skilled enough to be able to use them. However, the IT
needs of this segment is similar in nature and perhaps
more crucial than that of the current user segment.
Designing systems for these underprivileged people
poses several technological challenges: Due to low
literacy levels the user interface has to be radically
simplified, and the user devices have to be affordable.
These and other requirements motivate a shift of
complexity and computation from end-user devices to the
network, tremendously increasing the expectations from
the infrastructure. In this paper, we present an
overview of technology developed and solutions built
under Pyr.mea. IT project towards enabling IT for the
masses.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "digital divide; emerging economies; ICT4D; scalable
infrastructure; telecom network; underprivileged;
voice",
}
@Article{Ben-Yehuda:2008:AHS,
author = "Muli Ben-Yehuda",
title = "{1st Annual Haifa Systems and Storage Conference
(SYSTOR 2007)}: a message from the organizers",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "110--110",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341338",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "On October 29--30, 2007, the 1st Annual Haifa Systems
and Storage Conference took place at Haifa, Israel. The
conference, affectionately known as SYSTOR 2007, was
hosted by IBM's Haifa Labs and the Technion---Israel
Institute of Technology. It was the first high-quality
refereed systems and storage conference organized by
IBM Haifa Labs, drawing upon the successful foundation
of previous systems and storage seminars. The purpose
of this conference was to forge and nourish research
and working relations within the academic and
industrial community in Israel and in the world,
targeting researchers and practitioners alike.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Karmon:2008:GPE,
author = "Kfir Karmon and Liran Liss and Assaf Schuster",
title = "{GWiQ-P}: an efficient decentralized {Grid}-wide quota
enforcement protocol",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "111--118",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341339",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Mega grids span several continents and may consist of
millions of nodes and billions of tasks executing at
any point in time. This setup calls for scalable and
highly available resource utilization control that
adapts itself to dynamic changes in the grid
environment as they occur. In this paper, we address
the problem of enforcing upper bounds on the
consumption of grid resources. We propose a grid-wide
quota enforcement system, called GWiQ-P. GWiQ-P is
light-weight, and in practice is infinitely scalable,
satisfying concurrently any number of resource demands,
all within the limits of a global quota assigned to
each user. GWiQ-P adapts to dynamic changes in the grid
as they occur, improving future performance by means of
improved locality. This improved performance does not
impair the system's ability to respond to current
requests, tolerate failures, or maintain the allotted
quota levels.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Faibish:2008:SVU,
author = "Sorin Faibish and Stephen Fridella and Peter Bixby and
Uday Gupta",
title = "Storage virtualization using a block-device file
system",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "119--126",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341340",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The design and organization of modern file systems has
been traditionally driven by practical considerations
related to the physical properties of computer disks
Storage virtualization makes such considerations
largely irrelevant, and file-system designs based on
them perform sub-optimally in a virtual storage
environment. One important example of this phenomenon
is the relationship between disk seek times and the
placement and organization of file system meta-data. In
this paper we show that traditional approaches to
organizing meta-data in file systems are closely
related to assumptions about the physical properties of
disks and that for this reason traditional file systems
fail to materialize the full benefits of storage
virtualization. We go on to propose a different file
system organization of data and meta-data designed to
exploit the power of virtualized storage.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ta-Shma:2008:VMT,
author = "Paula Ta-Shma and Guy Laden and Muli Ben-Yehuda and
Michael Factor",
title = "Virtual machine time travel using continuous data
protection and checkpointing",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "127--134",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341341",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtual machine (VM) time travel enables reverting a
virtual machine's state, both transient and persistent,
to past points in time. This capability can be used to
improve virtual machine availability, to enable
forensics on past VM states, and to recover from
operator errors. We present an approach to virtual
machine time travel which combines Continuous Data
Protection (CDP) storage support with
live-migration-based virtual machine checkpointing. In
particular, we present a novel approach for CDP which
enables efficient reverts of the storage state to past
points in time and makes it possible to undo a revert,
and this is achieved using a simple branched-temporal
data structure. We also present a design and
implementation of a simple live-migration-based
checkpointing mechanism in Xen.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Winfree:2008:TMP,
author = "Erik Winfree",
title = "Toward molecular programming with {DNA}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "1--1",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346282",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Biological organisms are beautiful examples of
programming. The program and data are stored in
biological molecules such as DNA, RNA, and proteins;
the algorithms are carried out by molecular and
biochemical processes; and the end result is the
creation and function of an organism. If we understood
how to program molecular systems, what could we create?
Lifelike technologies whose basic operations are
chemical reactions? The fields of chemistry, physics,
biology, and computer science are converging as we
begin to synthesize molecules, molecular machines, and
molecular systems of ever increasing complexity,
leading to subdisciplines such as DNA nanotechnology,
DNA computing, and synthetic biology. Having
demonstrated simple devices and systems --
self-assembled structures, molecular motors, chemical
logic gates -- researchers are now turning to the
question of how to create large-scale integrated
systems. To do so, we must learn how to manage
complexity: how to efficiently specify the structure
and behavior of intricate molecular systems, how to
compile such specifications down to the design of
molecules to be synthesized in the lab, and how to
ensure that such systems function robustly. These
issues will be illustrated for chemical logic circuits
based on cascades of DNA hybridization reactions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "DNA; molecular programming",
}
@Article{Chen:2008:OVB,
author = "Xiaoxin Chen and Tal Garfinkel and E. Christopher
Lewis and Pratap Subrahmanyam and Carl A. Waldspurger
and Dan Boneh and Jeffrey Dwoskin and Dan R. K. Ports",
title = "{Overshadow}: a virtualization-based approach to
retrofitting protection in commodity operating
systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "2--13",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346284",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Commodity operating systems entrusted with securing
sensitive data are remarkably large and complex, and
consequently, frequently prone to compromise. To
address this limitation, we introduce a
virtual-machine-based system called Overshadow that
protects the privacy and integrity of application data,
even in the event of a total OS compromise. Overshadow
presents an application with a normal view of its
resources, but the OS with an encrypted view. This
allows the operating system to carry out the complex
task of managing an application's resources, without
allowing it to read or modify them. Thus, Overshadow
offers a last line of defense for application
data.\par
Overshadow builds on multi-shadowing, a novel mechanism
that presents different views of `physical' memory,
depending on the context performing the access. This
primitive offers an additional dimension of protection
beyond the hierarchical protection domains implemented
by traditional operating systems and processor
architectures.\par
We present the design and implementation of Overshadow
and show how its new protection semantics can be
integrated with existing systems. Our design has been
fully implemented and used to protect a wide range of
unmodified legacy applications running on an unmodified
Linux operating system. We evaluate the performance of
our implementation, demonstrating that this approach is
practical.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cloaking; hypervisors; memory protection;
multi-shadowing; operating systems; virtual machine
monitors; VMM",
}
@Article{McCune:2008:HLC,
author = "Jonathan M. McCune and Bryan Parno and Adrian Perrig
and Michael K. Reiter and Arvind Seshadri",
title = "How low can you go?: recommendations for
hardware-supported minimal {TCB} code execution",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "14--25",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346285",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We explore the extent to which newly available
CPU-based security technology can reduce the Trusted
Computing Base (TCB) for security-sensitive
applications. We find that although this new technology
represents a step in the right direction, significant
performance issues remain. We offer several suggestions
that leverage existing processor technology, retain
security, and improve performance. Implementing these
recommendations will finally allow application
developers to focus exclusively on the security of
their own code, enabling it to execute in isolation
from the numerous vulnerabilities in the underlying
layers of legacy code.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "late launch; secure execution; trusted computing",
}
@Article{Bhargava:2008:ATD,
author = "Ravi Bhargava and Benjamin Serebrin and Francesco
Spadini and Srilatha Manne",
title = "Accelerating two-dimensional page walks for
virtualized systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "26--35",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346286",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Nested paging is a hardware solution for alleviating
the software memory management overhead imposed by
system virtualization. Nested paging complements
existing page walk hardware to form a two-dimensional
(2D) page walk, which reduces the need for hypervisor
intervention in guest page table management. However,
the extra dimension also increases the maximum number
of architecturally-required page table
references.\par
This paper presents an in-depth examination of the 2D
page table walk overhead and options for decreasing it.
These options include using the AMD Opteron processor's
page walk cache to exploit the strong reuse of page
entry references. For a mix of server and SPEC
benchmarks, the presented results show a 15\%-38\%
improvement in guest performance by extending the
existing page walk cache to also store the nested
dimension of the 2D page walk. Caching nested page
table translations and skipping multiple page entry
references produce an additional 3\%-7\%
improvement.\par
Much of the remaining 2D page walk overhead is due to
low-locality nested page entry references, which result
in additional memory hierarchy misses. By using large
pages, the hypervisor can eliminate many of these
long-latency accesses and further improve the guest
performance by 3\%-22\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "AMD; hypervisor; memory management; nested paging;
page walk caching; TLB; virtualization; virtual machine
monitor",
}
@Article{Lee:2008:ETL,
author = "Benjamin C. Lee and David Brooks",
title = "Efficiency trends and limits from comprehensive
microarchitectural adaptivity",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "36--47",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346288",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Increasing demand for power-efficient,
high-performance computing requires tuning applications
and/or the underlying hardware to improve the mapping
between workload heterogeneity and computational
resources. To assess the potential benefits of hardware
tuning, we propose a framework that leverages
synergistic interactions between recent advances in (a)
sampling, (b) predictive modeling, and (c) optimization
heuristics. This framework enables qualitatively new
capabilities in analyzing the performance and power
characteristics of adaptive microarchitectures. For the
first time, we are able to simultaneously consider high
temporal and comprehensive spatial adaptivity. In
particular, we optimize efficiency for many, short
adaptive intervals and identify the best configuration
of 15 parameters, which define a space of 240B
point.\par
With frequent sub-application reconfiguration and a
fully reconfigurable hardware substrate, adaptive
microarchitectures achieve bips$^3$ /w efficiency gains
of up to 5.3x (median 2.4x) relative to their static
counterparts already optimized for a given application.
This 5.3x efficiency gain is derived from a 1.6x
performance gain and 0.8x power reduction. Although
several applications achieve a significant fraction of
their potential efficiency with as few as three
adaptive parameters, the three most significant
parameters differ across applications. These
differences motivate a hardware substrate capable of
comprehensive adaptivity to meet these diverse
application requirements.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "adaptivity; efficiency; inference; microarchitecture;
performance; power; reconfigurablity; regression;
simulation; statistics",
}
@Article{Raghavendra:2008:NPS,
author = "Ramya Raghavendra and Parthasarathy Ranganathan and
Vanish Talwar and Zhikui Wang and Xiaoyun Zhu",
title = "No `power' struggles: coordinated multi-level power
management for the data center",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "48--59",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346289",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Power delivery, electricity consumption, and heat
management are becoming key challenges in data center
environments. Several past solutions have individually
evaluated different techniques to address separate
aspects of this problem, in hardware and software, and
at local and global levels. Unfortunately, there has
been no corresponding work on coordinating all these
solutions. In the absence of such coordination, these
solutions are likely to interfere with one another, in
unpredictable (and potentially dangerous) ways. This
paper seeks to address this problem. We make two key
contributions. First, we propose and validate a power
management solution that coordinates different
individual approaches. Using simulations based on 180
server traces from nine different real-world
enterprises, we demonstrate the correctness, stability,
and efficiency advantages of our solution. Second,
using our unified architecture as the base, we perform
a detailed quantitative sensitivity analysis and draw
conclusions about the impact of different
architectures, implementations, workloads, and system
design choices.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "capping; control theory; coordination; data center;
efficiency; power management; virtualization",
}
@Article{Ballapuram:2008:EAS,
author = "Chinnakrishnan S. Ballapuram and Ahmad Sharif and
Hsien-Hsin S. Lee",
title = "Exploiting access semantics and program behavior to
reduce snoop power in chip multiprocessors",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "60--69",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346290",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Integrating more processor cores on-die has become the
unanimous trend in the microprocessor industry. Most of
the current research thrusts using chip multiprocessors
(CMPs) as the baseline to analyze problems in various
domains. One of the main design issues facing CMP
systems is the growing number of snoops required to
maintain cache coherency and to support
self/cross-modifying code that leads to power and
performance limitations. In this paper, we analyze the
internal and external snoop behavior in a CMP system
and relax the snoopy cache coherence protocol based on
the program semantics and properties of the shared
variables for saving power. Based on the observations
and analyses, we propose two novel techniques:
Selective Snoop Probe (SSP) and Essential Snoop Probe
(ESP) to reduce power without compromising performance.
Our simulation results show that using the SSP
technique, 5\% to 65\% data cache energy savings per
core for different processor configurations can be
achieved with 1\% to 2\% performance improvement. We
also show that 5\% to 82\% of data cache energy per
core is spent on the non-essential snoop probes that
can be saved using the ESP technique.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "chip multiprocessors; internal and external snoops;
MESI protocol; self-modifying code",
}
@Article{Mallik:2008:PMU,
author = "Arindam Mallik and Jack Cosgrove and Robert P. Dick
and Gokhan Memik and Peter Dinda",
title = "{PICSEL}: measuring user-perceived performance to
control dynamic frequency scaling",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "70--79",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346291",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The ultimate goal of a computer system is to satisfy
its users. The success of architectural or system-level
optimizations depends largely on having accurate
metrics for user satisfaction. We propose to derive
such metrics from information that is `close to flesh'
and apparent to the user rather than from information
that is `close to metal' and hidden from the user. We
describe and evaluate PICSEL, a dynamic voltage and
frequency scaling (DVFS) technique that uses
measurements of variations in the rate of change of a
computer's video output to estimate user-perceived
performance. Our adaptive algorithms, one conservative
and one aggressive, use these estimates to dramatically
reduce operating frequencies and voltages for
graphically-intensive applications while maintaining
performance at a satisfactory level for the user. We
evaluate PICSEL through user studies conducted on a
Pentium M laptop running Windows XP. Experiments
performed with 20 users executing three applications
indicate that the measured laptop power can be reduced
by up to 12.1\%, averaged across all of our users and
applications, compared to the default Windows XP DVFS
policy. User studies revealed that the difference in
overall user satisfaction between the more aggressive
version of PICSEL and Windows DVFS were statistically
insignificant, whereas the conservative version of
PICSEL actually improved user satisfaction when
compared to Windows DVFS.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "dynamic voltage and frequency scaling; power
management; thermal emergency; user-perceived
performance",
}
@Article{Joao:2008:IPO,
author = "Jose A. Joao and Onur Mutlu and Hyesoon Kim and Rishi
Agarwal and Yale N. Patt",
title = "Improving the performance of object-oriented languages
with dynamic predication of indirect jumps",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "80--90",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353535.1346293",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Indirect jump instructions are used to implement
increasingly-common programming constructs such as
virtual function calls, switch-case statements, jump
tables, and interface calls. The performance impact of
indirect jumps is likely to increase because indirect
jumps with multiple targets are difficult to predict
even with specialized hardware.\par
This paper proposes a new way of handling
hard-to-predict indirect jumps: dynamically predicating
them. The compiler (static or dynamic) identifies
indirect jumps that are suitable for predication along
with their control-flow merge (CFM) points. The
hardware predicates the instructions between different
targets of the jump and its CFM point if the jump turns
out to be hard-to-predict at run time. If the jump
would actually have been mispredicted, its dynamic
predication eliminates a pipeline flush, thereby
improving performance.\par
Our evaluations show that Dynamic Indirect jump
Predication (DIP) improves the performance of a set of
object-oriented applications including the Java DaCapo
benchmark suite by 37.8\% compared to a commonly-used
branch target buffer based predictor, while also
reducing energy consumption by 24.8\%. We compare DIP
to three previously proposed indirect jump predictors
and find that it provides the best performance and
energy-efficiency.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "dynamic predication; indirect jumps; object-oriented
languages; predicated execution; virtual functions",
}
@Article{Wegiel:2008:MCV,
author = "Michal Wegiel and Chandra Krintz",
title = "The {Mapping Collector}: virtual memory support for
generational, parallel, and concurrent compaction",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "91--102",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353535.1346294",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Parallel and concurrent garbage collectors are
increasingly employed by managed runtime environments
(MREs) to maintain scalability, as multi-core
architectures and multi-threaded applications become
pervasive. Moreover, state-of-the-art MREs commonly
implement compaction to eliminate heap fragmentation
and enable fast linear object allocation.\par
Our empirical analysis of object demographics reveals
that unreachable objects in the heap tend to form
clusters large enough to be effectively managed at the
granularity of virtual memory pages. Even though
processes can manipulate the mapping of the virtual
address space through the standard operating system
(OS) interface on most platforms, extant
parallel/concurrent compactors do not do so to exploit
this clustering behavior and instead achieve compaction
by performing, relatively expensive, object moving and
pointer adjustment.\par
We introduce the Mapping Collector (MC), which
leverages virtual memory operations to reclaim and
consolidate free space without moving objects and
updating pointers. MC is a nearly-single-phase
compactor that is simpler and more efficient than
previously reported compactors that comprise two to
four phases. Through effective MRE-OS coordination, MC
maintains the simplicity of a non-moving collector
while providing efficient parallel and concurrent
compaction.\par
We implement both stop-the-world and concurrent MC in a
generational garbage collection framework within the
open-source HotSpot Java Virtual Machine. Our
experimental evaluation using a multiprocessor
indicates that MC significantly increases throughput
and scalability as well as reduces pause times,
relative to state-of-the-art, parallel and concurrent
compactors.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "compaction; concurrent; parallel; virtual memory",
}
@Article{Devietti:2008:HAS,
author = "Joe Devietti and Colin Blundell and Milo M. K. Martin
and Steve Zdancewic",
title = "{Hardbound}: architectural support for spatial safety
of the {C} programming language",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "103--114",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346295",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The C programming language is at least as well known
for its absence of spatial memory safety guarantees
(i.e., lack of bounds checking) as it is for its high
performance. C's unchecked pointer arithmetic and array
indexing allow simple programming mistakes to lead to
erroneous executions, silent data corruption, and
security vulnerabilities. Many prior proposals have
tackled enforcing spatial safety in C programs by
checking pointer and array accesses. However, existing
software-only proposals have significant drawbacks that
may prevent wide adoption, including: unacceptably high
run-time overheads, lack of completeness, incompatible
pointer representations, or need for non-trivial
changes to existing C source code and compiler
infrastructure.\par
Inspired by the promise of these software-only
approaches, this paper proposes a hardware bounded
pointer architectural primitive that supports
cooperative hardware/software enforcement of spatial
memory safety for C programs. This bounded pointer is a
new hardware primitive datatype for pointers that
leaves the standard C pointer representation intact,
but augments it with bounds information maintained
separately and invisibly by the hardware. The bounds
are initialized by the software, and they are then
propagated and enforced transparently by the hardware,
which automatically checks a pointer's bounds before it
is dereferenced. One mode of use requires instrumenting
only malloc, which enables enforcement of
per-allocation spatial safety for heap-allocated
objects for existing binaries. When combined with
simple intraprocedural compiler instrumentation,
hardware bounded pointers enable a low-overhead
approach for enforcing complete spatial memory safety
in unmodified C programs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "C programming language; spatial memory safety",
}
@Article{Lvin:2008:ATA,
author = "Vitaliy B. Lvin and Gene Novark and Emery D. Berger
and Benjamin G. Zorn",
title = "{Archipelago}: trading address space for reliability
and security",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "115--124",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353535.1346296",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Memory errors are a notorious source of security
vulnerabilities that can lead to service interruptions,
information leakage and unauthorized access. Because
such errors are also difficult to debug, the absence of
timely patches can leave users vulnerable to attack for
long periods of time. A variety of approaches have been
introduced to combat these errors, but these often
incur large runtime overheads and generally abort on
errors, threatening availability.\par
This paper presents Archipelago, a runtime system that
takes advantage of available address space to
substantially reduce the likelihood that a memory error
will affect program execution. Archipelago randomly
allocates heap objects far apart in virtual address
space, effectively isolating each object from buffer
overflows. Archipelago also protects against dangling
pointer errors by preserving the contents of freed
objects after they are freed. Archipelago thus trades
virtual address space---a plentiful resource on 64-bit
systems---for significantly improved program
reliability and security, while limiting physical
memory consumption by tracking the working set of an
application and compacting cold objects. We show that
Archipelago allows applications to continue to run
correctly in the face of thousands of memory errors.
Across a suite of server applications, Archipelago's
performance overhead is 6\% on average (between -7\%
and 22\%), making it especially suitable to protect
servers that have known security vulnerabilities due to
heap memory errors.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Archipelago; buffer overflow; dynamic memory
allocation; memory errors; probabilistic memory safety;
randomized algorithms; virtual memory",
}
@Article{Choi:2008:ABP,
author = "Bumyong Choi and Leo Porter and Dean M. Tullsen",
title = "Accurate branch prediction for short threads",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "125--134",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346298",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Multi-core processors, with low communication costs
and high availability of execution cores, will increase
the use of execution and compilation models that use
short threads to expose parallelism. Current branch
predictors seek to incorporate large amounts of control
flow history to maximize accuracy. However, when that
history is absent the predictor fails to work as
intended. Thus, modern predictors are almost useless
for threads below a certain length.\par
Using a Speculative Multithreaded (SpMT) architecture
as an example of a system which generates shorter
threads, this work examines techniques to improve
branch prediction accuracy when a new thread begins to
execute on a different core. This paper proposes a
minor change to the branch predictor that gives
virtually the same performance on short threads as an
idealized predictor that incorporates unknowable
pre-history of a spawned speculative thread. At the
same time, strong performance on long threads is
preserved. The proposed technique sets the global
history register of the spawned thread to the initial
value of the program counter. This novel and simple
design reduces branch mispredicts by 29\% and provides
as much as a 13\% IPC improvement on selected SPEC2000
benchmarks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "branch prediction; chip multiprocessors",
}
@Article{Srikantaiah:2008:ASP,
author = "Shekhar Srikantaiah and Mahmut Kandemir and Mary Jane
Irwin",
title = "Adaptive set pinning: managing shared caches in chip
multiprocessors",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "135--144",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346299",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As part of the trend towards Chip Multiprocessors
(CMPs) for the next leap in computing performance, many
architectures have explored sharing the last level of
cache among different processors for better
performance-cost ratio and improved resource
allocation. Shared cache management is a crucial CMP
design aspect for the performance of the system. This
paper first presents a new classification of cache
misses --- CII: Compulsory, Inter-processor and
Intra-processor misses --- for CMPs with shared caches to
provide a better understanding of the interactions
between memory transactions of different processors at
the level of shared cache in a CMP. We then propose a
novel approach, called set pinning, for eliminating
inter-processor misses and reducing intra-processor
misses in a shared cache. Furthermore, we show that an
adaptive set pinning scheme improves over the benefits
obtained by the set pinning scheme by significantly
reducing the number of off-chip accesses. Extensive
analysis of these approaches with SPEComp 2001
benchmarks is performed using a full system simulator.
Our experiments indicate that the set pinning scheme
achieves an average improvement of 22.18\% in the L2
miss rate while the adaptive set pinning scheme reduces
the miss rates by an average of 47.94\% as compared to
the traditional shared cache scheme. They also improve
the performance by 7.24\% and 17.88\% respectively.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "CMP; inter-processor; intra-processor; set pinning;
shared cache",
}
@Article{Tuck:2008:SSE,
author = "James Tuck and Wonsun Ahn and Luis Ceze and Josep
Torrellas",
title = "{SoftSig}: software-exposed hardware signatures for
code analysis and optimization",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "145--156",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346300",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many code analysis techniques for optimization,
debugging, or parallelization need to perform runtime
disambiguation of sets of addresses. Such operations
can be supported efficiently and with low complexity
with hardware signatures.\par
To enable flexible use of signatures, this paper
proposes to expose a Signature Register File to the
software through a rich ISA. The software has great
flexibility to decide, for each signature,which
addresses to collect and which addresses to
disambiguate against. We call this architecture
SoftSig. In addition, as an example of SoftSig use, we
show how to detect redundant function calls efficiently
and eliminate them dynamically. We call this algorithm
MemoiSE. On average for five popular applications,
MemoiSE reduces the number of dynamic instructions by
9.3\%, thereby reducing the execution time of the
applications by 9\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "memory disambiguation; multi-core architectures;
runtime optimization",
}
@Article{Burcea:2008:PV,
author = "Ioana Burcea and Stephen Somogyi and Andreas Moshovos
and Babak Falsafi",
title = "Predictor virtualization",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "157--167",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346301",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many hardware optimizations rely on collecting
information about program behavior at runtime. This
information is stored in lookup tables. To be accurate
and effective, these optimizations usually require
large dedicated on-chip tables. Although technology
advances offer an increased amount of on-chip
resources, these resources are allocated to increase
the size of on-chip conventional cache
hierarchies.\par
This work proposes Predictor Virtualization, a
technique that uses the existing memory hierarchy to
emulate large predictor tables. We demonstrate the
benefits of this technique by virtualizing a
state-of-the-art data prefetcher. Full-system,
cycle-accurate simulations demonstrate that the
virtualized prefetcher preserves the performance
benefits of the original design, while reducing the
on-chip storage dedicated to the predictor table from
60KB down to less than one kilobyte.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "caches; memory hierarchy; metadata; predictor
virtualization",
}
@Article{Ganapathy:2008:DIM,
author = "Vinod Ganapathy and Matthew J. Renzelmann and Arini
Balakrishnan and Michael M. Swift and Somesh Jha",
title = "The design and implementation of microdrivers",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "168--178",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346303",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Device drivers commonly execute in the kernel to
achieve high performance and easy access to kernel
services. However, this comes at the price of decreased
reliability and increased programming difficulty.
Driver programmers are unable to use user-mode
development tools and must instead use cumbersome
kernel tools. Faults in kernel drivers can cause the
entire operating system to crash. User-mode drivers
have long been seen as a solution to this problem, but
suffer from either poor performance or new interfaces
that require a rewrite of existing drivers.\par
This paper introduces the Microdrivers architecture
that achieves high performance and compatibility by
leaving critical path code in the kernel and moving the
rest of the driver code to a user-mode process. This
allows data-handling operations critical to I/O
performance to run at full speed, while management
operations such as initialization and configuration run
at reduced speed in user-level. To achieve
compatibility, we present DriverSlicer, a tool that
splits existing kernel drivers into a kernel-level
component and a user-level component using a small
number of programmer annotations. Experiments show that
as much as 65\% of driver code can be removed from the
kernel without affecting common-case performance, and
that only 1-6 percent of the code requires
annotations.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "device drivers; program partitioning; reliability",
}
@Article{Weinsberg:2008:TFC,
author = "Yaron Weinsberg and Danny Dolev and Tal Anker and Muli
Ben-Yehuda and Pete Wyckoff",
title = "Tapping into the fountain of {CPUs}: on operating
system support for programmable devices",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "179--188",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346304",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The constant race for faster and more powerful CPUs is
drawing to a close. No longer is it feasible to
significantly increase the speed of the CPU without
paying a crushing penalty in power consumption and
production costs. Instead of increasing single thread
performance, the industry is turning to multiple CPU
threads or cores (such as SMT and CMP) and
heterogeneous CPU architectures (such as the Cell
Broadband Engine). While this is a step in the right
direction, in every modern PC there is a wealth of
untapped compute resources. The NIC has a CPU; the disk
controller is programmable; some high-end graphics
adapters are already more powerful than host CPUs. Some
of these CPUs can perform some functions more
efficiently than the host CPUs. Our operating systems
and programming abstractions should be expanded to let
applications tap into these computational resources and
make the best use of them.\par
Therefore, we propose the H\par
YDRA framework, which lets application developers use
the combined power of every compute resource in a
coherent way. HYDRA is a programming model and a
runtime support layer which enables utilization of host
processors as well as various programmable peripheral
devices' processors. We present the framework and its
application for a demonstrative use-case, as well as
provide a thorough evaluation of its capabilities.
Using HYDRA we were able to cut down the development
cost of a system that uses multiple heterogeneous
compute resources significantly.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "offloading; operating systems; programming model",
}
@Article{Shen:2008:HCD,
author = "Kai Shen and Ming Zhong and Sandhya Dwarkadas and
Chuanpeng Li and Christopher Stewart and Xiao Zhang",
title = "Hardware counter driven on-the-fly request
signatures",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "189--200",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346306",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Today's processors provide a rich source of
statistical information on application execution
through hardware counters. In this paper, we explore
the utilization of these statistics as request
signatures in server applications for identifying
requests and inferring high-level request properties
(e.g., CPU and I/O resource needs). Our key finding is
that effective request signatures may be constructed
using a small amount of hardware statistics while the
request is still in an early stage of its execution.
Such on-the-fly request identification and property
inference allow guided operating system adaptation at
request granularity (e.g., resource-aware request
scheduling and on-the-fly request classification). We
address the challenges of selecting hardware counter
metrics for signature construction and providing
necessary operating system support for per-request
statistics management. Our implementation in the Linux
2.6.10 kernel suggests that our approach requires low
overhead suitable for runtime deployment. Our
on-the-fly request resource consumption inference
(averaging 7\%, 3\%, 20\%, and 41\% prediction errors
for four server workloads, TPC-C, TPC-H, J2EE-based
RUBiS, and a trace-driven index search, respectively)
is much more accurate than the online running-average
based prediction (73-82\% errors). Its use for
resource-aware request scheduling results in a 15-70\%
response time reduction for three CPU-bound
applications. Its use for on-the-fly request
classification and anomaly detection exhibits high
accuracy for the TPC-H workload with synthetically
generated anomalous requests following a typical
SQL-injection attack pattern.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "anomaly detection; hardware counter; operating system
adaptation; request classification; server system",
}
@Article{VanErtvelde:2008:DPA,
author = "Luk {Van Ertvelde} and Lieven Eeckhout",
title = "Dispersing proprietary applications as benchmarks
through code mutation",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "201--210",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346307",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Industry vendors hesitate to disseminate proprietary
applications to academia and third party vendors. By
consequence, the benchmarking process is typically
driven by standardized, open-source benchmarks which
may be very different from and likely not
representative of the real-life applications of
interest.\par
This paper proposes code mutation, a novel technique
that mutates a proprietary application to complicate
reverse engineering so that it can be distributed as a
benchmark. The benchmark mutant then serves as a proxy
for the proprietary application. The key idea in the
proposed code mutation approach is to preserve the
proprietary application's dynamic memory access and/or
control flow behavior in the benchmark mutant while
mutating the rest of the application code. To this end,
we compute program slices for memory access operations
and/or control flow operations trimmed through constant
value and branch profiles; and subsequently mutate the
instructions not appearing in these slices through
binary rewriting.\par
Our experimental results using SPEC CPU2000 and MiBench
benchmarks show that code mutation is a promising
technique that mutates up to 90\% of the static binary,
up to 50\% of the dynamically executed instructions,
and up to 35\% of the at run time exposed
inter-operation data dependencies. The performance
characteristics of the mutant are very similar to those
of the proprietary application across a wide range of
microarchitectures and hardware implementations.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "benchmark generation; code mutation",
}
@Article{Mysore:2008:UVF,
author = "Shashidhar Mysore and Bita Mazloom and Banit Agrawal
and Timothy Sherwood",
title = "Understanding and visualizing full systems with data
flow tomography",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "211--221",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346308",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "It is not uncommon for modern systems to be composed
of a variety of interacting services, running across
multiple machines in such a way that most developers do
not really understand the whole system. As abstraction
is layered atop abstraction, developers gain the
ability to compose systems of extraordinary complexity
with relative ease. However, many software properties,
especially those that cut across abstraction layers,
become very difficult to understand in such
compositions. The communication patterns involved, the
privacy of critical data, and the provenance of
information, can be difficult to find and understand,
even with access to all of the source code. The goal of
Data Flow Tomography is to use the inherent information
flow of such systems to help visualize the interactions
between complex and interwoven components across
multiple layers of abstraction. In the same way that
the injection of short-lived radioactive isotopes help
doctors trace problems in the cardiovascular system,
the use of `data tagging' can help developers slice
through the extraneous layers of software and pin-point
those portions of the system interacting with the data
of interest. To demonstrate the feasibility of this
approach we have developed a prototype system in which
tags are tracked both through the machine and in
between machines over the network, and from which novel
visualizations of the whole system can be derived. We
describe the system-level challenges in creating a
working system tomography tool and we qualitatively
evaluate our system by examining several example real
world scenarios.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "data flow tracking; tomography; virtual machine",
}
@Article{Ottoni:2008:COG,
author = "Guilherme Ottoni and David I. August",
title = "Communication optimizations for global multi-threaded
instruction scheduling",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "222--232",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353535.1346310",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The recent shift in the industry towards chip
multiprocessor (CMP) designs has brought the need for
multi-threaded applications to mainstream computing. As
observed in several limit studies, most of the
parallelization opportunities require looking for
parallelism beyond local regions of code. To exploit
these opportunities, especially for sequential
applications, researchers have recently proposed global
multi-threaded instruction scheduling techniques,
including DSWP and GREMIO. These techniques
simultaneously schedule instructions from large regions
of code, such as arbitrary loop nests or whole
procedures, and have been shown to be effective at
extracting threads for many applications. A key enabler
of these global instruction scheduling techniques is
the Multi-Threaded Code Generation (MTCG) algorithm
proposed in [16], which generates multi-threaded code
for any partition of the instructions into threads.
This algorithm inserts communication and
synchronization instructions in order to satisfy all
inter-thread dependences.\par
In this paper, we present a general compiler framework,
COCO, to optimize the communication and synchronization
instructions inserted by the MTCG algorithm. This
framework, based on thread-aware data-flow analyses and
graph min-cut algorithms, appropriately models and
optimizes all kinds of inter-thread dependences,
including register, memory, and control dependences.
Our experiments, using a fully automatic compiler
implementation of these techniques, demonstrate
significant reductions (about 30\% on average) in the
number of dynamic communication instructions in code
parallelized with DSWP and GREMIO. This reduction in
communication translates to performance gains of up to
40\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "communication; data-flow analysis; graph min-cut;
instruction scheduling; multi-threading;
synchronization",
}
@Article{Kulkarni:2008:OPB,
author = "Milind Kulkarni and Keshav Pingali and Ganesh
Ramanarayanan and Bruce Walter and Kavita Bala and
L. Paul Chew",
title = "Optimistic parallelism benefits from data
partitioning",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "233--243",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353534.1346311",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Recent studies of irregular applications such as
finite-element mesh generators and data-clustering
codes have shown that these applications have a
generalized data parallelism arising from the use of
iterative algorithms that perform computations on
elements of worklists. In some irregular applications,
the computations on different elements are independent.
In other applications, there may be complex patterns of
dependences between these computations.\par
The Galois system was designed to exploit this kind of
irregular data parallelism on multicore processors. Its
main features are (i) two kinds of set iterators for
expressing worklist-based data parallelism, and (ii) a
runtime system that performs optimistic parallelization
of these iterators, detecting conflicts and rolling
back computations as needed. Detection of conflicts and
rolling back iterations requires information from class
implementors.\par
In this paper, we introduce mechanisms to improve the
execution efficiency of Galois programs: data
partitioning, data-centric work assignment, lock
coarsening, and over-decomposition. These mechanisms
can be used to exploit locality of reference, reduce
mis-speculation, and lower synchronization overhead. We
also argue that the design of the Galois system permits
these mechanisms to be used with relatively little
modification to the user code. Finally, we present
experimental results that demonstrate the utility of
these mechanisms.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "data partitioning; irregular programs; locality; lock
coarsening; optimistic parallelism;
over-decomposition",
}
@Article{Cox:2008:XEO,
author = "Russ Cox and Tom Bergan and Austin T. Clements and
Frans Kaashoek and Eddie Kohler",
title = "{Xoc}, an extension-oriented compiler for systems
programming",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "244--254",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353535.1346312",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Today's system programmers go to great lengths to
extend the languages in which they program. For
instance, system-specific compilers find errors in
Linux and other systems, and add support for
specialized control flow to Qt and event-based
programs. These compilers are difficult to build and
cannot always understand each other's language changes.
However, they can greatly improve code
understandability and correctness, advantages that
should be accessible to all programmers.\par
We describe an extension-oriented compiler for C called
xoc. An extension-oriented compiler, unlike a
conventional extensible compiler, implements new
features via many small extensions that are loaded
together as needed. Xoc gives extension writers full
control over program syntax and semantics while hiding
many compiler internals. Xoc programmers concisely
define powerful compiler extensions that, by
construction, can be combined; even some parts of the
base compiler, such as GNU C compatibility, are
structured as extensions.\par
Xoc is based on two key interfaces. Syntax patterns
allow extension writers to manipulate language
fragments using concrete syntax. Lazy computation of
attributes allows extension writers to use the results
of analyses by other extensions or the core without
needing to worry about pass scheduling.\par
Extensions built using xoc include xsparse, a 345-line
extension that mimics Sparse, Linux's C front end, and
xlambda, a 170-line extension that adds function
expressions to C. An evaluation of xoc using these and
13 other extensions shows that xoc extensions are
typically more concise than equivalent extensions
written for conventional extensible compilers and that
it is possible to compose extensions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "extension-oriented compilers",
}
@Article{Wells:2008:AIF,
author = "Philip M. Wells and Koushik Chakraborty and Gurindar
S. Sohi",
title = "Adapting to intermittent faults in multicore systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "255--264",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353536.1346314",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Future multicore processors will be more susceptible
to a variety of hardware failures. In particular,
intermittent faults, caused in part by manufacturing,
thermal, and voltage variations, can cause bursts of
frequent faults that last from several cycles to
several seconds or more. Due to practical limitations
of circuit techniques, cost-effective reliability will
likely require the ability to temporarily suspend
execution on a core during periods of intermittent
faults.\par
We investigate three of the most obvious techniques for
adapting to the dynamically changing resource
availability caused by intermittent faults, and
demonstrate their different system-level implications.
We show that system software reconfiguration has very
high overhead, that temporarily pausing execution on a
faulty core can lead to cascading livelock, and that
using spare cores has high fault-free cost. To remedy
these and other drawbacks of the three baseline
techniques, we propose using a thin hardware/firmware
layer to manage an overcommitted system -- one where
the OS is configured to use more virtual processors
than the number of currently available physical cores.
We show that this proposed technique can gracefully
degrade performance during intermittent faults of
various duration with low overhead, without involving
system software, and without requiring spare cores.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "intermittent faults; overcommitted system",
}
@Article{Li:2008:UPH,
author = "Man-Lap Li and Pradeep Ramachandran and Swarup Kumar
Sahoo and Sarita V. Adve and Vikram S. Adve and
Yuanyuan Zhou",
title = "Understanding the propagation of hard errors to
software and implications for resilient system design",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "265--276",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346315",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With continued CMOS scaling, future shipped hardware
will be increasingly vulnerable to in-the-field faults.
To be broadly deployable, the hardware reliability
solution must incur low overheads, precluding use of
expensive redundancy. We explore a cooperative
hardware-software solution that watches for anomalous
software behavior to indicate the presence of hardware
faults. Fundamental to such a solution is a
characterization of how hardware faults indifferent
microarchitectural structures of a modern processor
propagate through the application and OS.\par
This paper aims to provide such a characterization,
resulting in identifying low-cost detection methods and
providing guidelines for implementation of the recovery
and diagnosis components of such a reliability
solution. We focus on hard faults because they are
increasingly important and have different system
implications than the much studied transients. We
achieve our goals through fault injection experiments
with a microarchitecture-level full system timing
simulator. Our main results are: (1) we are able to
detect 95\% of the unmasked faults in 7 out of 8
studied microarchitectural structures with simple
detectors that incur zero to little hardware overhead;
(2) over 86\% of these detections are within latencies
that existing hardware checkpointing schemes can
handle, while others require software checkpointing;
and (3) a surprisingly large fraction of the detected
faults corrupt OS state, but almost all of these are
detected with latencies short enough to use hardware
checkpointing, thereby enabling OS recovery in
virtually all such cases.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "architecture; error detection; fault injection;
permanent fault",
}
@Article{Suleman:2008:FDT,
author = "M. Aater Suleman and Moinuddin K. Qureshi and Yale N.
Patt",
title = "Feedback-driven threading: power-efficient and
high-performance execution of multi-threaded workloads
on {CMPs}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "277--286",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346317",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Extracting high-performance from the emerging Chip
Multiprocessors (CMPs) requires that the application be
divided into multiple threads. Each thread executes on
a separate core thereby increasing concurrency and
improving performance. As the number of cores on a CMP
continues to increase, the performance of some
multi-threaded applications will benefit from the
increased number of threads, whereas, the performance
of other multi-threaded applications will become
limited by data-synchronization and off-chip bandwidth.
For applications that get limited by
data-synchronization, increasing the number of threads
significantly degrades performance and increases
on-chip power. Similarly, for applications that get
limited by off-chip bandwidth, increasing the number of
threads increases on-chip power without providing any
performance improvement. Furthermore, whether an
application gets limited by data-synchronization, or
bandwidth, or neither depends not only on the
application but also on the input set and the machine
configuration. Therefore, controlling the number of
threads based on the run-time behavior of the
application can significantly improve performance and
reduce power.\par
This paper proposes Feedback-Driven Threading (FDT), a
framework to dynamically control the number of threads
using run-time information. FDT can be used to
implement Synchronization-Aware Threading (SAT), which
predicts the optimal number of threads depending on the
amount of data-synchronization. Our evaluation shows
that SAT can reduce both execution time and power by up
to 66\% and 78\% respectively. Similarly, FDT can be
used to implement Bandwidth-Aware Threading (BAT),
which predicts the minimum number of threads required
to saturate the off-chip bus. Our evaluation shows that
BAT reduces on-chip power by up to 78\%. When SAT and
BAT are combined, the average execution time reduces by
17\% and power reduces by 59\%. The proposed techniques
leverage existing performance counters and require
minimal support from the threading library.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "bandwidth; CMP; multi-threaded; synchronization",
}
@Article{Linderman:2008:MPM,
author = "Michael D. Linderman and Jamison D. Collins and Hong
Wang and Teresa H. Meng",
title = "{Merge}: a programming model for heterogeneous
multi-core systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "287--296",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346318",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we propose the Merge framework, a
general purpose programming model for heterogeneous
multi-core systems. The Merge framework replaces
current ad hoc approaches to parallel programming on
heterogeneous platforms with a rigorous, library-based
methodology that can automatically distribute
computation across heterogeneous cores to achieve
increased energy and performance efficiency. The Merge
framework provides (1) a predicate dispatch-based
library system for managing and invoking function
variants for multiple architectures; (2) a high-level,
library-oriented parallel language based on map-reduce;
and (3) a compiler and runtime which implement the
map-reduce language pattern by dynamically selecting
the best available function implementations for a given
input and machine configuration. Using a generic
sequencer architecture interface for heterogeneous
accelerators, the Merge framework can integrate
function variants for specialized accelerators,
offering the potential for to-the-metal performance for
a wide range of heterogeneous architectures, all
transparent to the user. The Merge framework has been
prototyped on a heterogeneous platform consisting of an
Intel Core 2 Duo CPU and an 8-core 32-thread Intel
Graphics and Media Accelerator X3000, and a homogeneous
32-way Unisys SMP system with Intel Xeon processors. We
implemented a set of benchmarks using the Merge
framework and enhanced the library with X3000 specific
implementations, achieving speedups of 3.6x -- 8.5x
using the X3000 and 5.2x -- 22x using the 32-way system
relative to the straight C reference implementation on
a single IA32 core.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "GPGPU; heterogeneous multi-core; predicate dispatch",
}
@Article{Gummaraju:2008:SPG,
author = "Jayanth Gummaraju and Joel Coburn and Yoshio Turner
and Mendel Rosenblum",
title = "{Streamware}: programming general-purpose multicore
processors using streams",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "297--307",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346319",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Recently, the number of cores on general-purpose
processors has been increasing rapidly. Using
conventional programming models, it is challenging to
effectively exploit these cores for maximal
performance. An interesting alternative candidate for
programming multiple cores is the stream programming
model, which provides a framework for writing programs
in a sequential-style while greatly simplifying the
task of automatic parallelization. It has been shown
that not only traditional media/image applications but
also more general-purpose data-intensive applications
can be expressed in the stream programming
style.\par
In this paper, we investigate the potential to use the
stream programming model to efficiently utilize
commodity multicore general-purpose processors (e.g.,
Intel/AMD). Although several stream languages and
stream compilers have recently been developed, they
typically target special-purpose stream processors. In
contrast, we propose a flexible software system,
Streamware, which automatically maps stream programs
onto a wide variety of general-purpose multicore
processor configurations. We leverage existing
compilation framework for stream processors and design
a runtime environment which takes as input the output
of these stream compilers in the form of
machine-independent stream virtual machine code. The
runtime environment assigns work to processor cores
considering processor/cache configurations and adapts
to workload variations. We evaluate this approach for a
few general-purpose scientific applications on real
hardware and a cycle-level simulator set-up to showcase
scaling and contention issues. The results show that
the stream programming model is a good choice for
efficiently exploiting modern and future multicore CPUs
for an important class of applications.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "general-purpose multicore processors; programming;
runtime system; streams",
}
@Article{Nightingale:2008:PSC,
author = "Edmund B. Nightingale and Daniel Peek and Peter M.
Chen and Jason Flinn",
title = "Parallelizing security checks on commodity hardware",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "308--318",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346321",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Speck (Speculative Parallel Check) is a system that
accelerates powerful security checks on commodity
hardware by executing them in parallel on multiple
cores. Speck provides an infrastructure that allows
sequential invocations of a particular security check
to run in parallel without sacrificing the safety of
the system. Speck creates parallelism in two ways.
First, Speck decouples a security check from an
application by continuing the application, using
speculative execution, while the security check
executes in parallel on another core. Second, Speck
creates parallelism between sequential invocations of a
security check by running later checks in parallel with
earlier ones. Speck provides a process-level replay
system to deterministically and efficiently synchronize
state between a security check and the original
process. We use Speck to parallelize three security
checks: sensitive data analysis, on-access virus
scanning, and taint propagation. Running on a 4-core
and an 8-core computer, Speck improves performance 4x
and 7.5x for the sensitive data analysis check, 3.3x
and 2.8x for the on-access virus scanning check, and
1.6x and 2x for the taint propagation check.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "operating systems; parallel; performance; security;
speculative execution",
}
@Article{Castro:2008:BBR,
author = "Miguel Castro and Manuel Costa and Jean-Philippe
Martin",
title = "Better bug reporting with better privacy",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "319--328",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346322",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Software vendors collect bug reports from customers to
improve the quality of their software. These reports
should include the inputs that make the software fail,
to enable vendors to reproduce the bug. However,
vendors rarely include these inputs in reports because
they may contain private user data. We describe a
solution to this problem that provides software vendors
with new input values that satisfy the conditions
required to make the software follow the same execution
path until it fails, but are otherwise unrelated with
the original inputs. These new inputs allow vendors to
reproduce the bug while revealing less private
information than existing approaches. Additionally, we
provide a mechanism to measure the amount of
information revealed in an error report. This mechanism
allows users to perform informed decisions on whether
or not to submit reports. We implemented a prototype of
our solution and evaluated it with real errors in real
programs. The results show that we can produce error
reports that allow software vendors to reproduce bugs
while revealing almost no private information.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "bug reports; constraint solving; privacy; symbolic
execution",
}
@Article{Lu:2008:LMC,
author = "Shan Lu and Soyeon Park and Eunsoo Seo and Yuanyuan
Zhou",
title = "Learning from mistakes: a comprehensive study on real
world concurrency bug characteristics",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "329--339",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1353536.1346323",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The reality of multi-core hardware has made concurrent
programs pervasive. Unfortunately, writing correct
concurrent programs is difficult. Addressing this
challenge requires advances in multiple directions,
including concurrency bug detection, concurrent program
testing, concurrent programming model design, etc.
Designing effective techniques in all these directions
will significantly benefit from a deep understanding of
real world concurrency bug characteristics.\par
This paper provides the first (to the best of our
knowledge) comprehensive real world concurrency bug
characteristic study. Specifically, we have carefully
examined concurrency bug patterns, manifestation, and
fix strategies of 105 randomly selected real world
concurrency bugs from 4 representative server and
client open-source applications (MySQL, Apache, Mozilla
and OpenOffice). Our study reveals several interesting
findings and provides useful guidance for concurrency
bug detection, testing, and concurrent programming
language design.\par
Some of our findings are as follows: (1) Around one
third of the examined non-deadlock concurrency bugs are
caused by violation to programmers' order intentions,
which may not be easily expressed via synchronization
primitives like locks and transactional memories; (2)
Around 34\% of the examined non-deadlock concurrency
bugs involve multiple variables, which are not well
addressed by existing bug detection tools; (3) About
92\% of the examined concurrency bugs can be reliably
triggered by enforcing certain orders among no more
than 4 memory accesses. This indicates that testing
concurrent programs can target at exploring possible
orders among every small groups of memory accesses,
instead of among all memory accesses; (4) About 73\% of
the examined non-deadlock concurrency bugs were not
fixed by simply adding or changing locks, and many of
the fixes were not correct at the first try, indicating
the difficulty of reasoning concurrent execution by
programmers.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "bug characteristics; concurrency bug; concurrent
program",
}
@Article{Huebner:2008:ROS,
author = "Ewa Huebner and Frans Henskens",
title = "The role of operating systems in computer forensics",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "1--3",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368508",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Computer forensics is a multidisciplinary field
concerned with the examination of computer systems
which have been involved in criminal activity, either
as an object or a tool of a crime. The aim of the
investigator is to find information relevant to the
case in question, as well as the chain of events
leading to the creation of this information. In other
words the questions to be answered are `What
incriminating information is present in the system?'
and `How did the incriminating information get
there?'",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xia:2008:PBM,
author = "Ying Xia and Kevin Fairbanks and Henry Owen",
title = "A program behavior matching architecture for
probabilistic file system forensics",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "4--13",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368509",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Even the most secure computing system can be
successfully attacked by a sufficiently motivated
entity. To investigate the means of entry, the victim
machine will come under the scrutiny of forensic
analysis tools. In this era where system compromises
occur on a regular basis, the design and implementation
of operating systems should consider the necessity of
computer forensics. Additionally, forensics techniques
should take advantage of existing system capabilities
such as the journaling feature of the Ext3 file system.
With our forensics enabling architecture, we provide a
means of using the metadata inherent in the Ext3 file
system to reconstruct probable sequences of events that
occurred during the journaling process. The
reconstruction procedure is achieved by generating
program behavior signatures. These signatures allow
forensic investigators to perform probabilistic
analysis by using information theory models to extract
a more significant set of data.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Ext3 journal; file systems; forensics; system
monitoring",
}
@Article{Libster:2008:PIM,
author = "Eugene Libster and Jesse D. Kornblum",
title = "A proposal for an integrated memory acquisition
mechanism",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "14--20",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368510",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Volatile memory forensics has become increasingly
prominent in forensic analysis and incident response.
Unfortunately there is currently no forensically sound
method of acquiring an image of a system's memory
without attaching specialized hardware. This paper
proposes the addition of a memory acquisition mechanism
to the operating system, thereby removing the need to
load an external program. The method minimizes the
acquisition's impact on the system's state, as well as
making it more difficult for malicious programs to
avoid detection or interfere with the memory dump. The
risks of allowing a full memory capture and some
considerations on how this method would interact with
rootkits are also discussed.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "memory acquisition; memory analysis; memory capture;
operating systems",
}
@Article{Goel:2008:RSS,
author = "Ashvin Goel and Kamran Farhadi and Kenneth Po and
Wu-chang Feng",
title = "Reconstructing system state for intrusion analysis",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "21--28",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368511",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The analysis of a compromised system is a
time-consuming and error-prone task today because
commodity operating systems provide limited auditing
facilities. We have been developing an operating-system
level auditing system called Forensix that captures a
high-resolution image of all system activities so that
detailed analysis can be performed after an attack is
detected. The challenge with this approach is that the
large amount of audit data generated can overwhelm
analysis tools. In this paper, we describe a technique
that helps generate a time-line of the state of the
system. This technique, based on preprocessing the
audit log, simplifies the implementation of the
analysis queries and enables running the analysis tools
interactively on large data sets.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McDonald:2008:SID,
author = "J. Todd McDonald and Yong C. Kim and Alec Yasinsac",
title = "Software issues in digital forensics",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "29--40",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368512",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Whether we accept it or not, computer systems and the
operating systems that direct them are at the heart of
major forms of malicious activity. Criminals can use
computers as the actual target of their malicious
activity (stealing funds electronically from a bank) or
use them to support the conduct of criminal activity in
general (using a spreadsheet to track drug shipments).
In either case, law enforcement needs the ability (when
required) to collect evidence from such platforms in a
reliable manner that preserves the fingerprints of
criminal activity. Though such discussion touches on
privacy issues and rules of legal veracity, we focus
purely on technological support in this paper.
Specifically, we examine and set forth principles of
operating system (OS) design that may significantly
increase the success of (future) forensic collection
efforts. We lay out several OS design attributes that
synergistically enhance forensics activities.
Specifically, we pose the use of circuit encryption
techniques to provide an additional layer of protection
above hardware-enforced approaches. We conclude by
providing an overarching framework to incorporate these
enhancements within the context of OS design.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "circuit encryption; digital forensics; evidence
collection; forensic software; obfuscation; operating
system extensions; operating systems; security",
}
@Article{Monteiro:2008:AVM,
author = "Steena D. S. Monteiro and Robert F. Erbacher",
title = "An authentication and validation mechanism for
analyzing syslogs forensically",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "41--50",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368513",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This research proposes a novel technique for
authenticating and validating syslogs for forensic
analysis. This technique uses a modification of the
Needham Schroeder protocol, which uses nonces (numbers
used only once) and public keys. Syslogs, which were
developed from an event-logging perspective and not
from an evidence-sustaining one, are system treasure
maps that chart out and pinpoint attacks and attack
attempts. Over the past few years, research on securing
syslogs has yielded enhanced syslog protocols that
focus on tamper prevention and detection. However, many
of these protocols, though efficient from a security
perspective, are inadequate when forensics comes into
play. From a legal perspective, any kind of evidence
found at a crime scene needs to be validated. In
addition, any digital forensic evidence when presented
in court needs to be admissible, authentic, believable,
and reliable [4]. Currently, a patchy log on the server
side and client side cannot be considered as formal
authentication of a wrong doer [5]. This paper presents
a method that ties together, authenticates, and
validates all the entities involved in the crime
scene---the user using the application, the system that
is being used, and the application being used on the
system by a user. This means that instead of merely
transmitting the header and the message, which is the
standard syslog protocol format, the syslog entry along
with the user fingerprint, application fingerprint, and
system fingerprint are transmitted to the logging
server. The assignment of digital fingerprints and the
addition of a challenge response mechanism to the
underlying syslogging mechanism aim to validate
generated syslogs forensically.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "authentication and validation; forensic validity;
model; system log files",
}
@Article{Maggi:2008:SIF,
author = "Federico Maggi and Stefano Zanero and Vincenzo
Iozzo",
title = "Seeing the invisible: forensic uses of anomaly
detection and machine learning",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "51--58",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368514",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Anti-forensics is the practice of circumventing
classical forensics analysis procedures making them
either unreliable or impossible. In this paper we
propose the use of machine learning algorithms and
anomaly detection to cope with a wide class of
definitive anti-forensics techniques. We test the
proposed system on a dataset we created through the
implementation of an innovative technique of
anti-forensics, and we show that our approach yields
promising results in terms of detection.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "computer forensics; host-based anomaly detection",
}
@Article{Wampler:2008:NBM,
author = "Doug Wampler and James H. Graham",
title = "A normality based method for detecting kernel
rootkits",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "59--64",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368515",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Rootkits are stealthy, malicious software that allow
an attacker to gain and maintain control of a system,
attack other systems, destroy evidence, and decrease
the chance of detection. Existing detection methods
typically rely on a priori knowledge and operate by
either (a) saving the system state before infection and
comparing this information post infection, or (b)
installing a detection program before infection. This
approach focuses on detection using reduced a priori
knowledge in the form of general knowledge of the
statistical properties of broad classes of operating
system/architecture pairs.\par
A modified normality based approach proved effective in
detecting kernel rootkits infecting the kernel via the
system call target modification attack. This approach
capitalizes on the discovery that system calls are
loaded into memory sequentially, with the higher level
calls, which are more likely to be infected by kernel
rootkits loaded first, and the lower level calls loaded
later. In the single case evaluated, the enyelkm
rootkit, neither false positives nor false positives
were indicated. The enyelkm rootkit was selected for
analysis since it infects the Linux kernel via the
system call target modification attack, which is the
subject of this research.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "forensic analysis; intrusion detection; operating
system forensics; outlier analysis; rootkit detection",
}
@Article{Sutherland:2008:AVO,
author = "Iain Sutherland and Jon Evans and Theodore Tryfonas
and Andrew Blyth",
title = "Acquiring volatile operating system data tools and
techniques",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "65--73",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368516",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The current approach to forensic examination during
search and seizure has predominantly been to pull the
plug on the suspect machine and subsequently perform a
post mortem examination on the storage medium. However,
with the advent of larger capacities of memory, drive
encryption and anti-forensics, this procedure may
result in the loss of valuable evidence. Volatile data
may be vital in determining criminal activity; it may
contain passwords used for encryption, indications of
anti-forensic techniques, memory resident malware which
would otherwise go unnoticed by the investigator. This
paper emphasizes the importance of understanding the
potential value of volatile data and how best to
collate forensic artifacts to the benefit of the
investigation, ensuring the preservation and integrity
of the evidence. The paper will review current methods
for volatile data collection, assessing the
capabilities, limitations and liabilities of current
tools and techniques available to the forensic
investigator.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "forensics; live acquisition; volatile data",
}
@Article{Hay:2008:FEV,
author = "Brian Hay and Kara Nance",
title = "Forensics examination of volatile system data using
virtual introspection",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "74--82",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368517",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "While static examination of computer systems is an
important part of many digital forensics
investigations, there are often important system
properties present only in volatile memory that cannot
be effectively recovered using static analysis
techniques, such as offline hard disk acquisition and
analysis. An alternative approach, involving the live
analysis of target systems to uncover this volatile
data, presents significant risks and challenges to
forensic investigators as observation techniques are
generally intrusive and can affect the system being
observed. This paper provides a discussion of live
digital forensics analysis through virtual
introspection and presents a suite of virtual
introspection tools developed for Xen (VIX tools). The
VIX tools suite can be used for unobtrusive digital
forensic examination of volatile system data in virtual
machines, and addresses a key research area identified
in the virtualization in digital forensics research
agenda [22].",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "digital forensics; virtual introspection; virtual
machine monitor; VIX",
}
@Article{Franklin:2008:RDV,
author = "Jason Franklin and Mark Luk and Jonathan M. McCune and
Arvind Seshadri and Adrian Perrig and Leendert van
Doorn",
title = "Remote detection of virtual machine monitors with
fuzzy benchmarking",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "83--92",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368518",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We study the remote detection of virtual machine
monitors (VMMs) across the Internet, and devise fuzzy
benchmarking as an approach that can successfully
detect the presence or absence of a VMM on a remote
system. Fuzzy benchmarking works by making timing
measurements of the execution time of particular code
sequences executing on the remote system. The fuzziness
comes from heuristics which we employ to learn
characteristics of the remote system's hardware and VMM
configuration. Our techniques are successful despite
uncertainty about the remote machine's hardware
configuration.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Casey:2008:IFD,
author = "Eoghan Casey and Gerasimos J. Stellatos",
title = "The impact of full disk encryption on digital
forensics",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "93--98",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368519",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The integration of strong encryption into operating
systems is creating challenges for forensic examiners,
potentially preventing us from recovering any digital
evidence from a computer. Because strong encryption
cannot be circumvented without a key or passphrase,
forensic examiners may not be able to access data after
a computer is shut down, and must decide whether to
perform a live forensic acquisition. In addition, with
encryption becoming integrated into the operating
system, in some cases, virtualization is the most
effective approach to performing a forensic examination
of a system with FDE. This paper presents the evolution
of full disk encryption (FDE) and its impact on digital
forensics. Furthermore, by demonstrating how full disk
encryption has been dealt with in past investigations,
this paper provides forensics examiners with practical
techniques for recovering evidence that would otherwise
be inaccessible.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "computer forensics; full disk encryption; live
forensic acquisition; virtual forensic analysis",
}
@Article{McHugh:2008:PNF,
author = "John McHugh and Ron McLeod and Vagishwari Nagaonkar",
title = "Passive network forensics: behavioural classification
of network hosts based on connection patterns",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "99--111",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368520",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Passive monitoring of the data entering and leaving an
enterprise network can support a number of forensic
objectives. We have developed analysis techniques for
NetFlow data that use behavioural identification and
can confirm individual host roles and behaviours
expressed as connection patterns. By looking at the way
a given machine interacts with others, it is often
possible to determine the role of the machine based
solely on the network data. Host behaviours as
characterized by NetFlow data are not stationary.
Evolutionary changes occur as the result of new
applications, computational and communications
paradigms. Compromised machines often undergo changes
in behaviour that range from subtle to dramatic. We use
behavioural changes to identify role shifts and to
trace the malicious or unintentional propagation of
that change to other machines. Observed behavioural
characteristics from over a year of traffic captures
containing ordinary behaviours as well as a variety of
compromises of interest are presented as examples for
the forensics practitioner or researcher.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "behaviour; forensic; intrusion detection; intrusion
prevention; network; on-line gaming; peer-to-peer;
propagation prevention; security; traffic; virus;
worm",
}
@Article{Peisert:2008:CFF,
author = "Sean Peisert and Matt Bishop and Keith Marzullo",
title = "Computer forensics {\em in forensis\/}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "112--122",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368521",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Different users apply computer forensic systems,
models, and terminology in very different ways. They
often make incompatible assumptions and reach different
conclusions about the validity and accuracy of the
methods they use to log, audit, and present forensic
data. In fact, it can be hard to say who, if anyone is
right. We present several forensic systems and discuss
situations in which they produce valid and accurate
conclusions and also situations in which their accuracy
is suspect. We also present forensic models and discuss
areas in which they are useful and areas in which they
could be augmented. Finally, we present some
recommendations about how computer scientists, forensic
practitioners, lawyers, and judges could build more
complete models of forensics that take into account
appropriate legal details and lead to scientifically
valid forensic analysis.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "auditing; data measurement; forensic analysis;
forensic systems; logging; models; scientific method;
security",
}
@Article{Bressoud:2008:CRT,
author = "Thomas C. Bressoud and M. Frans Kaashoek",
title = "{Chairs}' report on {Twenty-First ACM Symposium on
Operating Systems Principles}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "123--126",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368523",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The 21st ACM Symposium on Operating Systems Principles
(SOSP 2007) was held at the Skamania Lodge in
Stevenson, Washington, USA from October 14th to October
17th 2007. The conference site is located in the
Columbia River Gorge National Scenic Area, a
spectacular canyon along the border between Oregon and
Washington States in the Pacific Northwest, where the
Columbia River cuts through the Cascades mountain
range. Delegates were treated to breathtaking views of
the gorge and mountains from the lodge's rustic and
warm common areas and the weather cooperated for the
arrival and early parts of the conference, though the
rains came in force in the latter part of the
conference.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Isaacs:2008:RSS,
author = "Rebecca Isaacs",
title = "Report on the {2007 SOSP} shadow program committee",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "127--131",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368524",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Since its recent establishment, the European chapter
of SIGOPS (EuroSys) has initiated a number of
activities to `increase the visibility and quality of
systems research in Europe'. This report describes one
such activity, a shadow program committee for SOSP that
was open to junior systems researchers based anywhere
in the world. Feedback from the participants confirms
that the experience was worthwhile and enjoyable, and
it is my belief that a shadow PC also has long term
benefits for the wider systems research community, as
explained further below.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mogul:2008:PSH,
author = "Jeffrey C. Mogul",
title = "Policies for the {SIGOPS Hall of Fame Award}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "132--135",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368525",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The SIGOPS Hall of Fame Award was established in 2005
to recognize `the most influential Operating Systems
papers' of the past. See
http://www.sigops.org/awards/hall-of-fame.html for the
Web page that describes the award.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bressoud:2008:SSN,
author = "Thomas C. Bressoud",
title = "Session scribe notes for {Twenty-First ACM Symposium
on Operating Systems Principles}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "136--151",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368526",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The following article is divided into nine sections,
one for each of the sessions presented at SOSP 2007.
For each session, two student volunteers took notes at
the conference, capturing the questions and answers
following each of the papers presented in that session.
Note that the session order follows the program as
given at the conference which, due to logistic
necessity, differs slightly from the order in the
proceedings.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Merkel:2008:TAV,
author = "Andreas Merkel and Frank Bellosa",
title = "Task activity vectors: a new metric for
temperature-aware scheduling",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "1--12",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352594",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Non-uniform utilization of functional units in
combination with hardware mechanisms such as clock
gating leads to different power consumptions in
different parts of a processor chip. This in turn leads
to non-uniform temperature distributions and
problematic local hotspots, depending on the
characteristics of the currently running task. The
operating system's scheduler, responsible for deciding
which task to run at what time, can influence
temperature distribution. Our work investigates what
the operating system can do to alleviate the problem of
hotspots. We propose task activity vectors describing
which functional units a task uses to what degree. With
the knowledge provided by these vectors, the scheduler
can schedule tasks using different units successively,
distribute tasks using a particular unit excessively
over the system's processors, or mix tasks using
different units on a SMT processor. We implemented
several vector-based scheduling strategies for Linux.
Our evaluations show that vector-based scheduling
considerably reduces hotspots.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "activity vectors; hotspot reduction; task
characteristics; task migration; temperature-aware
scheduling; thermal management",
}
@Article{Povzner:2008:EGD,
author = "Anna Povzner and Tim Kaldewey and Scott Brandt and
Richard Golding and Theodore M. Wong and Carlos
Maltzahn",
title = "Efficient guaranteed disk request scheduling with
{Fahrrad}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "13--25",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352595",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Guaranteed I/O performance is needed for a variety of
applications ranging from real-time data collection to
desktop multimedia to large-scale scientific
simulations. Reservations on throughput, the standard
measure of disk performance, fail to effectively manage
disk performance due to the orders of magnitude
difference between best-, average-, and worst-case
response times, allowing reservation of less than
0.01\% of the achievable bandwidth. We show that by
reserving disk resources in terms of utilization it is
possible to create a disk scheduler that supports
reservation of nearly 100\% of the disk resources,
provides arbitrarily hard or soft guarantees depending
upon application needs, and yields efficiency as good
or better than best-effort disk schedulers tuned for
performance. We present the architecture of our
scheduler, prove the correctness of its algorithms, and
provide results demonstrating its effectiveness.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "guaranteed i/o performance; quality of service;
real-time i/o scheduling; storage",
}
@Article{Abe:2008:EAP,
author = "Yoshihisa Abe and Hiroshi Yamada and Kenji Kono",
title = "Enforcing appropriate process execution for exploiting
idle resources from outside operating systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "27--40",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352596",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Idle resources can be exploited not only to run
important local tasks such as data replication and
virus checking, but also to make contributions to
society by participating in open computing projects
like SETI@home [2]. When executing background processes
to utilize such valuable idle resources, we need to
explicitly control them so that the user will not be
discouraged from exploiting idle resources by
foreground performance degradation. Unfortunately,
common priority-based schedulers lack such explicit
execution control. In addition, to encourage active use
of idle resources, a mechanism for controlling
background processes should not require modifications
to the underlying operating system or user
applications. If such modifications are required, the
user may be reluctant to employ the mechanism.\par
In this paper, we argue that we can reasonably detect
resource contention between foreground and background
processes and properly control background process
execution at the user level. We infer the existence of
resource contention from the approximated resource
shares of background processes. Our approach takes
advantage of dynamically instrumented probes, which are
becoming increasingly popular, in estimating the
resource shares. Also, it considers different resource
types in combination and can handle varied workloads,
including multiple background processes.\par
We show that our system effectively avoids the
performance degradation of foreground activities by
suspending background processes in an appropriate
fashion. Our system keeps the increase in foreground
execution time due to background processes below
16.9\%, or much lower in most of our experiments. Also,
we extend our approach to address undesirable resource
allocations to CPU-intensive processes that can occur
in multiprocessor environments.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "background execution; idle resources",
}
@Article{Meyer:2008:PVD,
author = "Dut h T. Meyer and Gitika Aggarwal and Brendan Cully
and Geoffrey Lefebvre and Michael J. Feeley and Norman
C. Hutchinson and Andrew Warfield",
title = "{Parallax}: virtual disks for virtual machines",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "41--54",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352598",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Parallax is a distributed storage system that uses
virtualization to provide storage facilities
specifically for virtual environments. The system
employs a novel architecture in which storage features
that have traditionally been implemented directly on
high-end storage arrays and switches are relocated into
a federation of storage VMs, sharing the same physical
hosts as the VMs that they serve. This architecture
retains the single administrative domain and OS
agnosticism achieved by array- and switch-based
approaches, while lowering the bar on hardware
requirements and facilitating the development of new
features. Parallax offers a comprehensive set of
storage features including frequent, low-overhead
snapshot of virtual disks, the `gold-mastering' of
template images, and the ability to use local disks as
a persistent cache to dampen burst demand on networked
storage.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "network storage; snapshot; virtualization",
}
@Article{Zhong:2008:RDC,
author = "Ming Zhong and Kai Shen and Joel Seiferas",
title = "Replication degree customization for high
availability",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "55--68",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352599",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Object replication is a common approach to enhance the
availability of distributed data-intensive services and
storage systems. Many such systems are known to have
highly skewed object request probability distributions.
In this paper, we propose an object replication degree
customization scheme that maximizes the expected
service availability under given object request
probabilities, object sizes, and space constraints
(e.g., memory/storage capacities). In particular, we
discover that the optimal replication degree of an
object should be linear in the logarithm of its
popularity-to-size ratio. We also study the feasibility
and effectiveness of our proposed scheme using
applications driven by real-life system object request
traces and machine failure traces. When the data object
popularity distribution is known a priori, our proposed
customization can achieve 1.32-2.92 `nines' increase in
system availability (or 21-74\% space savings at the
same availability level) compared to uniform
replication. Results also suggest that our scheme
requires a moderate amount of replica creation/removal
overhead (weekly changes involve no more than 0.24\%
objects and no more than 0.11\% of total data size)
under realistic object request popularity changes.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "optimization; replication; system availability",
}
@Article{Joukov:2008:GME,
author = "Nikolai Joukov and Josef Sipek",
title = "{GreenFS}: making enterprise computers greener by
protecting them better",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "69--80",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352600",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Hard disks contain data --- frequently an irreplaceable
asset of high monetary and non-monetary value. At the
same time, hard disks are mechanical devices that
consume power, are noisy, and fragile when their
platters are rotating.\par
In this paper we demonstrate that hard disks cause
different kinds of problems for different types of
computer systems and demystify several common
misconceptions. We show that solutions developed to
date are incapable of solving the power consumption,
noise, and data reliability problems without
sacrificing hard disk life-time, data reliability, or
user convenience.\par
We considered data reliability, recovery, performance,
user convenience, and hard disk-caused problems
together at the enterprise scale. We have designed
GreenFS: a fan-out stackable file system that offers
all-time all-data run-time data protection, improves
performance under typical user workloads, and allows
hard disks to be kept off most of the time. As a
result, GreenFS improves enterprise data protection,
minimizes disk drive-related power consumption and
noise and increases the chances of disk drive
survivability in case of unexpected external impacts.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "backup; continuous data protection; power efficiency",
}
@Article{Weinhold:2008:VBV,
author = "Carsten Weinhold and Hermann H{\"a}rtig",
title = "{VPFS}: building a virtual private file system with a
small trusted computing base",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "81--93",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352602",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we present the lessons we learned when
developing VPFS, a virtual private file system that is
based on both a small amount of trusted storage and an
untrusted legacy file system residing on the same
machine. VPFS' purpose is to provide secure and
reliable storage to highly sensitive applications
running on top of a microkernel, which may concurrently
execute untrusted software. The confidentiality and
integrity guarantees of VPFS do not only apply to file
contents, but also to all meta data including integrity
of the directory structure.\par
We explored design alternatives that allow us to
securely reuse untrusted infrastructure and thereby
minimize the complexity that a file-system
implementation adds to the trusted computing base. VPFS
is split into two isolated components. A small trusted
component implements all security-critical
functionality, whereas the untrusted part reuses an
existing file-system implementation provided by a
virtualized legacy operating system that can be
untrusted. In our VPFS prototype, alternative
configurations of the trusted component comprise only
between 4,000 and 4,600 lines of code, which is at
least an order of magnitude smaller than existing
commodity file-system stacks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "legacy reuse; secure file system; virtualization",
}
@Article{Jain:2008:ALI,
author = "Shvetank Jain and Fareha Shafique and Vladan Djeric
and Ashvin Goel",
title = "Application-level isolation and recovery with
solitude",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "95--107",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352603",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "When computer systems are compromised by an attack, it
is difficult to determine the precise extent of the
damage caused by the attack because the state changes
made by an attacker and those made by regular users can
be closely intertwined. This problem occurs due to
implicit sharing in operating systems, and it can be
especially severe for persistent state. In particular,
the file system provides a single namespace that when
compromised can have cascading effects on the entire
system, making intrusion analysis and recovery a
time-consuming and error-prone process.\par
In this paper, we present Solitude, an
application-level isolation and recovery system that is
designed to both limit the effects of attacks and
simplify the post-intrusion recovery process. Solitude
uses a copy-on-write filesystem to provide a
transparent, restricted privilege isolation environment
for running untrusted applications, and it uses an
explicit file sharing mechanism across the isolation
environments that limits attack propagation without
compromising functionality. Solitude provides two modes
of recovery. If a sandboxed application proves to be
untrustworthy, a course-grained recovery method allows
easily removing the footprint of the software. However,
if a user mistakenly moves malicious files to the
trusted environment via explicit file sharing, then
Solitude uses data dependency tracking to allow
fine-grained recovery.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "access control; copy-on-write; file systems; recovery;
taint analysis; transactional file system",
}
@Article{Cheng:2008:TCI,
author = "Bin Cheng and Lex Stein and Hai Jin and Zheng Zhang",
title = "Towards cinematic {Internet} video-on-demand",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "109--122",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352605",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Video-on-demand (VoD) is increasingly popular with
Internet users. It gives users greater choice and more
control than live streaming or file downloading.
Systems such as MSN Video and YouTube deliver content
at low bitrates. This may suit short clips, but great
films and 5-minute bloopers are as different as
symphonies and jingles. For cinema, poor quality and
high jitter are less acceptable. Combining user control
with high bitrate is compelling, but technically
challenging.\par
VoD is expensive due to the load it places on video
source servers. Many researchers have proposed using
peer-to-peer (P2P) techniques to shift load from
sources to peers (peer-assistance), yet none have
implemented and deployed a system with the first
purpose of openly and systematically evaluating this
approach. To fill this void, we have built and deployed
GridCast$^1$. GridCast doubles the bitrates of current
popular internet VoD systems, provides a full set of
VCR$^2$ operations, and employs peer-assistance to
improve scalability and continuity. GridCast has been
live on CERNET$^3$ since May of 2006. In peak months,
GridCast has served videos to approximately 23,000
users. From the beginning, we have gathered information
to understand GridCast and improve its
algorithms.\par
This paper introduces and evaluates GridCast. In May of
2007, we deployed multivideo caching, a major change to
the caching algorithms. This paper analyzes scalability
and continuity before and after this change. Our
results contain several surprises and underline the
importance of deployment to validate simulation
results. We discuss what improvements can be developed
beyond multivideo caching.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "caching; peer-to-peer; video-on-demand",
}
@Article{Grace:2008:EOO,
author = "Paul Grace and Danny Hughes and Barry Porter and
Gordon S. Blair and Geoff Coulson and Francois Taiani",
title = "Experiences with open overlays: a middleware approach
to network heterogeneity",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "123--136",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352606",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In order to provide an increasing number of
functionalities and benefit from sophisticated and
application-tailored services from the network,
distributed applications are led to integrate an
ever-widening range of networking technologies. As
these applications become more complex, this
requirement for `network heterogeneity' is becoming a
crucial issue in their development. Although progress
has been made in the networking community in addressing
such needs through the development of network overlays,
we claim in this paper that the middleware community
has been slow to integrate these advances into
middleware architectures, and, hence, to provide the
foundational bedrock for heterogeneous distributed
applications. In response, we propose our `open
overlays' framework. This framework, which is part of a
wider middleware architecture, accommodates `overlay
plug-ins', allows physical nodes to support multiple
overlays, supports the stacking of overlays to create
composite protocols, and adopts a declarative approach
to configurable deployment and dynamic
reconfigurability. The framework has been in
development for a number of years and supports an
extensive range of overlay plug-ins including popular
protocols such as Chord and Pastry. We report on our
experiences with the open overlays framework, evaluate
it in detail, and illustrate its application in a
detailed case study of network heterogeneity.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "framework; middleware; overlay network; WSN",
}
@Article{Kong:2008:PTD,
author = "Jiantao Kong and Karsten Schwan and Min Lee and
Mustaque Ahamad",
title = "{Protectit}: trusted distributed services operating on
sensitive data",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "137--147",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352608",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Protecting shared sensitive information is a key
requirement for today's distributed applications. Our
research uses virtualization technologies to create and
maintain trusted data paths across distributed
machines, for the services being run and their
information exchanges. For trusted data paths, runtime
protection methods control what data is visible to
which distributed services operating on it, guided by
online monitoring that determines the levels of trust
inherent in the paths' machines, services, and service
actions. This paper presents a key functional element
of trusted data paths, which is the ProtectIT
interception mechanism for controlling the data
exchanges between the different virtual machines
running trusted services. ProtectIT can be applied to
any communication and/or I/O performed by virtual
machines, and because ProtectIT does not require
application, middleware, or operating system
modifications, it can be used to construct trusted data
paths without the knowledge or consent of such
entities. Further, since ProtectIT operates in virtual
machines isolated from those used by applications, it
is not subject to the attacks faced by services exposed
to the open Internet. ProtectIT's functionality
consists of dynamic protection rules represented as
data filters applied to virtual machines'
communications. Examples presented in this paper
include email services for which ProtectIT's filters
control data visibility to mail servers and clients,
and unsecured virtual machine communications morphed
into secure ones via ProtectIT-based message
interception.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "data protection; traffic interception; trusted data
path",
}
@Article{He:2008:MVE,
author = "Shan He and Renan G. Cattelan and Darko Kirovski",
title = "Modeling viral economies for digital media",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "149--162",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352609",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Financial efficiency is the premier performance
measure for most systems. Existing economic ecosystems
for distribution of multimedia leave a lot to be
desired: client-server platforms do not scale well
resulting in substantial operational costs, whereas
peer-to-peer platforms cannot police copyright control
and are thus notorious for not being able to capitalize
on its vast delivery potential. In this paper, we
introduce an economic model that aims at predicting
financial performance of both client-server and viral
distribution systems for multimedia. The model consists
of several probabilistic components: a global
scale-free viral network of users and a localized
user-behavior model that abstracts marketing, pricing,
and executed transactions. The model uses simulation to
predict relative economic behavior. In order to
showcase our model, we compared the popular `on-line
store' distribution system to the recently proposed
off-line incentive-based viral ecosystem for
multimedia. We also constructed an efficient dynamic
pricing scheme and evaluated its performance in
considered multimedia distribution scenarios.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "dynamic pricing; incentive-based economies; multimedia
distribution; scale-free networks; viral marketing",
}
@Article{Bessani:2008:DBF,
author = "Alysson Neves Bessani and Eduardo Pelison Alchieri and
Miguel Correia and Joni Silva Fraga",
title = "{DepSpace}: a {Byzantine} fault-tolerant coordination
service",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "163--176",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352610",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The tuple space coordination model is one of the most
interesting coordination models for open distributed
systems due to its space and time decoupling and its
synchronization power. Several works have tried to
improve the dependability of tuple spaces through the
use of replication for fault tolerance and access
control for security. However, many practical
applications in the Internet require both fault
tolerance and security. This paper describes the design
and implementation of DepSpace, a Byzantine
fault-tolerant coordination service that provides a
tuple space abstraction. The service offered by
DepSpace is secure, reliable and available as long as
less than a third of service replicas are faulty.
Moreover, the content-addressable confidentiality
scheme developed for DepSpace bridges the gap between
Byzantine fault-tolerant replication and
confidentiality of replicated data and can be used in
other systems that store critical data.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Byzantine fault tolerance; confidentiality; tuple
space",
}
@Article{Wang:2008:HAF,
author = "Xi Wang and Zhenyu Guo and Xuezheng Liu and Zhilei Xu
and Haoxiang Lin and Xiaoge Wang and Zheng Zhang",
title = "Hang analysis: fighting responsiveness bugs",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "177--190",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352612",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Soft hang is an action that was expected to respond
instantly but instead drives an application into a
coma. While the application usually responds
eventually, users cannot issue other requests while
waiting. Such hang problems are widespread in
productivity tools such as desktop applications;
similar issues arise in server programs as well. Hang
problems arise because the software contains blocking
or time-consuming operations in graphical user
interface (GUI) and other time-critical call paths that
should not.\par
This paper proposes HangWiz to find hang bugs in source
code, which are difficult to eliminate before release
by testing, as they often depend on a user's
environment. HangWiz finds hang bugs by finding hang
points: an invocation that is expected to complete
quickly, such as a GUI action, but calls a blocking
function. HangWiz collects hang patterns from runtime
traces supplemented with expert knowledge, and feed
these patterns into a static analysis framework that
searches exhaustively for hang points that involve
potential hang bugs.\par
Experiments with several large, real-world software
packages (including a source control client, a graphics
editor and a web server) show that there are several
hang bugs in these applications, and that HangWiz is
effective in finding them. The experiments also
demonstrate that HangWiz is scalable and can analyze
millions of lines of code. We further discuss related
techniques and report our experience on fixing hang
bugs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "blocking invocation; hang; interactive performance;
program analysis; responsive invocation;
responsiveness",
}
@Article{Koskinen:2008:BIE,
author = "Eric Koskinen and John Jannotti",
title = "{BorderPatrol}: isolating events for black-box
tracing",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "191--203",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352613",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Causal request traces are valuable to developers of
large concurrent and distributed applications, yet
difficult to obtain. Traces show how a request is
processed, and can be analyzed by tools to detect
performance or correctness errors and anomalous
behavior.\par
We present BorderPatrol, which obtains precise request
traces through systems built from a litany of
unmodified modules. Traced components include Apache,
thttpd, PostgreSQL, TurboGears, BIND and notably Zeus,
a closed-source event-driven web server. BorderPatrol
obtains traces using active observation which carefully
modifies the event stream observed by modules,
simplifying precise observation. Protocol processors
leverage knowledge about standard protocols, avoiding
application-specific instrumentation.\par
BorderPatrol obtains precise traces for black-box
systems that cannot be traced by any other technique.
We confirm the accuracy of BorderPatrol's traces by
comparing to manual instrumentation, and compare the
developer effort required for each kind of trace.
BorderPatrol imposes limited overhead on real systems
(approximately 10-15\%) and it may be enabled or
disabled in at run-time, making it a viable option for
deployment in production environments.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "black box systems; causal paths; distributed systems;
performance analysis; performance debugging",
}
@Article{Peter:2008:SES,
author = "Simon Peter and Andrew Baumann and Timothy Roscoe and
Paul Barham and Rebecca Isaacs",
title = "30 seconds is not enough!: a study of operating system
timer usage",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "205--218",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352614",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The basic system timer facilities used by applications
and OS kernels for scheduling timeouts and periodic
activities have remained largely unchanged for decades,
while hardware architectures and application loads have
changed radically. This raises concerns with CPU
overhead power management and application
responsiveness.\par
In this paper we study how kernel timers are used in
the Linux and Vista kernels, and the instrumentation
challenges and tradeoffs inherent in conducting such a
study. We show how the same timer facilities serve at
least five distinct purposes, and examine their
performance characteristics under a selection of
application workloads. We show that many timer
parameters supplied by application and kernel
programmers are somewhat arbitrary, and examine the
potential benefit of adaptive timeouts.\par
We also discuss the further implications of our
results, both for enhancements to the system timer
functionality in existing kernels, and for the
clean-slate design of a system timer subsystem for new
OS kernels, including the extent to which applications
might require such an interface at all.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "adaptability; kernel interface design; scheduling;
timers",
}
@Article{Pattabiraman:2008:SPC,
author = "Karthik Pattabiraman and Vinod Grover and Benjamin G.
Zorn",
title = "{Samurai}: protecting critical data in unsafe
languages",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "219--232",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352616",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Programs written in type-unsafe languages such as C
and C++ incur costly memory errors that result in
corrupted data structures, program crashes, and
incorrect results. We present a data-centric solution
to memory corruption called critical memory, a memory
model that allows programmers to identify and protect
data that is critical for correct program execution.
Critical memory defines operations to consistently read
and update critical data, and ensures that other
non-critical updates in the program will not corrupt
it. We also present Samurai, a runtime system that
implements critical memory in software. Samurai uses
replication and forward error correction to provide
probabilistic guarantees of critical memory semantics.
Because Samurai does not modify memory operations on
non-critical data, the majority of memory operations in
programs run at full speed, and Samurai is compatible
with third party libraries. Using both applications,
including a Web server, and libraries (an STL list
class and a memory allocator), we evaluate the
performance overhead and fault tolerance that Samurai
provides. We find that Samurai is a useful and
practical approach for the majority of the applications
and libraries considered.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "critical memory; error recovery; memory safety",
}
@Article{Nicoara:2008:CSE,
author = "Angela Nicoara and Gustavo Alonso and Timothy
Roscoe",
title = "Controlled, systematic, and efficient code replacement
for running {Java} programs",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "233--246",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352617",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we present PROSE, a system that performs
reversible and systematic changes to running Java
applications without requiring them to be shut down.
PROSE is motivated by scenarios such as hotfixes,
online program instrumentation and debugging, and
evolution of critical legacy applications. In PROSE,
changes to running applications are performed by
replacing method bodies. To select which code to
replace, PROSE supports matching based on both type
information and regular expressions. New code can
invoke the method it replaces, facilitating code
evolution. Changes are composable, and may be reordered
or selectively withdrawn at any time. Furthermore, the
dynamic changes are expressed as Java classes rather
than through an additional programming language. We
describe the architecture of PROSE, the challenges of
using aggressive inlining to achieve performance, and
use standard benchmarks to demonstrate code performance
comparable with, or better than, compile-time systems
from the Aspect-Oriented Programming community.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "dynamic bytecode instrumentation; inlining; PROSE;
run-time method code replacement; run-time
modification",
}
@Article{Padioleau:2008:DAC,
author = "Yoann Padioleau and Julia Lawall and Ren{\'e} Rydhof
Hansen and Gilles Muller",
title = "Documenting and automating collateral evolutions in
{Linux} device drivers",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "247--260",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352618",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The internal libraries of Linux are evolving rapidly,
to address new requirements and improve performance.
These evolutions, however, entail a massive problem of
collateral evolution in Linux device drivers: for every
change that affects an API, all dependent drivers must
be updated accordingly. Manually performing such
collateral evolutions is time-consuming and unreliable,
and has lead to errors when modifications have not been
done consistently.\par
In this paper, we present an automatic program
transformation tool Coccinelle, for documenting and
automating device driver collateral evolutions. Because
Linux programmers are accustomed to manipulating
program modifications in terms of patch files, this
tool uses a language based on the patch syntax to
express transformations, extending patches to semantic
patches. Coccinelle preserves the coding style of the
original driver, as would a human programmer.\par
We have evaluated our approach on 62 representative
collateral evolutions that were previously performed
manually in Linux 2.5 and 2.6. On a test suite of over
5800 relevant driver files, the semantic patches for
these collateral evolutions update over 93\% of the
files completely. In the remaining cases, the user is
typically alerted to a partial match against the driver
code, identifying the files that must be considered
manually. We have additionally identified over 150
driver files where the maintainer made an error in
performing the collateral evolution, but Coccinelle
transforms the code correctly. Finally, several patches
derived from the use of Coccinelle have been accepted
into the Linux kernel.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "collateral evolutions; device drivers; domain-specific
language; Linux; program transformation; software
evolution",
}
@Article{Ronda:2008:IUA,
author = "Troy Ronda and Stefan Saroiu and Alec Wolman",
title = "{Itrustpage}: a user-assisted anti-phishing tool",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "261--272",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352620",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Despite the many solutions proposed by industry and
the research community to address phishing attacks,
this problem continues to cause enormous damage.
Because of our inability to deter phishing attacks, the
research community needs to develop new approaches to
anti-phishing solutions. Most of today's anti-phishing
technologies focus on automatically detecting and
preventing phishing attacks. While automation makes
anti-phishing tools user-friendly, automation also
makes them suffer from false positives, false
negatives, and various practical hurdles. As a result,
attackers often find simple ways to escape automatic
detection.\par
This paper presents iTrustPage --- an anti-phishing tool
that does not rely completely on automation to detect
phishing. Instead, iTrustPage relies on user input and
external repositories of information to prevent users
from filling out phishing Web forms. With iTrustPage,
users help to decide whether or not a Web page is
legitimate. Because iTrustPage is user-assisted,
iTrustPage avoids the false positives and the false
negatives associated with automatic phishing detection.
We implemented iTrustPage as a downloadable extension
to FireFox. After being featured on the Mozilla website
for FireFox extensions, iTrustPage was downloaded by
more than 5,000 users in a two week period. We present
an analysis of our tool's effectiveness and ease of use
based on our examination of usage logs collected from
the 2,050 users who used iTrustPage for more than two
weeks. Based on these logs, we find that iTrustPage
disrupts users on fewer than 2\% of the pages they
visit, and the number of disruptions decreases over
time.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "anti-phishing; phishing",
}
@Article{Fetzer:2008:SED,
author = "Christof Fetzer and Martin S{\"u}{\ss}kraut",
title = "{Switchblade}: enforcing dynamic personalized system
call models",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "273--286",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352621",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "System call interposition is a common approach to
restrict the power of applications and to detect code
injections. It enforces a model that describes what
system calls and/or what sequences thereof are
permitted. However, there exist various issues like
concurrency vulnerabilities and incomplete models that
restrict the power of system call interposition
approaches. We present a new system, SwitchBlade, that
uses randomized and personalized fine-grained system
call models to increase the probability of detecting
code injections. However, using a fine-grain system
call model, we cannot exclude the possibility that the
model is violated during normal program executions. To
cope with false positives, SwitchBlade uses on-demand
taint analysis to update a system call model during
runtime.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "security; system call interposition; system call
models; taint analysis",
}
@Article{Portokalidis:2008:EID,
author = "Georgios Portokalidis and Herbert Bos",
title = "{Eudaemon}: involuntary and on-demand emulation
against zero-day exploits",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "287--299",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352622",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Eudaemon is a technique that aims to blur the borders
between protected and unprotected applications, and
brings together honeypot technology and end-user
intrusion detection and prevention. Eudaemon is able to
attach to any running process, and redirect execution
to a user-space emulator that will dynamically
instrument the binary by means of taint analysis. Any
attempts to subvert control flow, or to inject
malicious code will be detected and averted. When
desired Eudaemon can reattach itself to the emulated
process, and return execution to the native binary.
Selective emulation has been investigated before as a
mean to heal an attacked program or to generate a
vaccine after an attack is detected, by applying
intensive instrumentation to the vulnerable region of
the program. Eudaemon can move an application between
protected and native mode at will, e.g., when spare
cycles are available, when a system policy ordains it,
or when it is explicitly requested. The transition is
performed transparently and in very little time, thus
incurring minimal disturbance to an actively used
system Systems offering constant protection against
similar attacks have also been proposed, but require
access to source code or explicit operating system
support, and often induce significant performance
penalties We believe that Eudaemon offers a flexible
mechanism to detect a series of attacks in end-user
systems with acceptable overhead. Moreover, we require
no modification to the running system and/or
installation of a hypervisor, with an eye on putting
taint analysis within reach of the average user.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "honeypots; operating systems; security",
}
@Article{Efstathopoulos:2008:MFG,
author = "Petros Efstathopoulos and Eddie Kohler",
title = "Manageable fine-grained information flow",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "301--313",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1357010.1352624",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The continuing frequency and seriousness of security
incidents underline the critical importance of
application security. Decentralized information flow
control (DIFC), a promising tool for improving
application security, gives application developers
fine-grained control over security policy and privilege
management. DIFC developers can partition much
application functionality into untrusted components
bound by a kernel- or language-enforced security
policy. Unless a (usually smaller and less exposed)
trusted component is exploited, the effects of an
application compromise are contained by the
policy.\par
Although system-based DIFC can simultaneously achieve
high performance and effective isolation, it offers a
challenging programming model. Fine-grained policy
specifications are spread over several application
pieces. Common programming errors may be
indistinguishable from policy exploit attempts, the
system cannot expose developers to information about
these errors, complicating debugging. Static checking
(as in language based systems) and new system
primitives can reduce these problems, but for dynamic
applications like web servers, they do not eliminate
them.\par
In this paper we propose subsystems that make
decentralized information flow more manageable. First,
a policy description language specifies an
application-wide security policy in one localized
place; communication restrictions are compiled into
lower-level labels. Second, information flow-safe
debugging mechanisms let developers debug DIFC
applications without violating security policies.
Although these mechanisms are preliminary, we
demonstrate their effectiveness using applications
similar to those developed for Asbestos and other DIFC
systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "debugging; decentralized information flow control;
labels; policy language",
}
@Article{McCune:2008:FEI,
author = "Jonathan M. McCune and Bryan J. Parno and Adrian
Perrig and Michael K. Reiter and Hiroshi Isozaki",
title = "{Flicker}: an execution infrastructure for {TCB}
minimization",
journal = j-OPER-SYS-REV,
volume = "42",
number = "4",
pages = "315--328",
month = may,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1352592.1352625",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present Flicker, an infrastructure for executing
security-sensitive code in complete isolation while
trusting as few as 250 lines of additional code.
Flicker can also provide meaningful, fine-grained
attestation of the code executed (as well as its inputs
and outputs) to a remote party. Flicker guarantees
these properties even if the BIOS, OS and DMA-enabled
devices are all malicious. Flicker leverages new
commodity processors from AMD and Intel and does not
require a new OS or VMM. We demonstrate a full
implementation of Flicker on an AMD platform and
describe our development environment for simplifying
the construction of Flicker-enabled code.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "late launch; secure execution; trusted computing",
}
@Article{Ben-Yehuda:2008:MGR,
author = "Muli Ben-Yehuda and Eric {Van Hensbergen} and Marc
Fiuczynski",
title = "Minding the gap: {R\&D} in the {Linux} kernel",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "1--3",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400098",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Linux kernel, since its inception in 1991, has
captured the interest of many thousands of developers
and millions of users. It recently celebrated its 16th
anniversary, includes many millions of lines of code,
and is used in production systems around the world. It
is also advancing at an increasingly rapid pace,
undergoing many changes every single day. Indeed the
kernel's importance to many large corporations has
sparked a high level of contribution by those companies
[3] [4], including the employment of many core kernel
developers. Recently Linus Torvalds published
statistics relating to contributions to the kernel over
the past three years: 96,885 patches attributed to 4068
distinct authors have been accepted [5].",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McKenney:2008:ITL,
author = "Paul E. McKenney and Jonathan Walpole",
title = "Introducing technology into the {Linux} kernel: a case
study",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "4--17",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400099",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "There can be no doubt that a great many technologies
have been added to Linux\TM{} over the past ten years.
What is less well-known is that it is often necessary
to introduce a large amount of Linux into a given
technology in order to successfully introduce that
technology into Linux. This paper illustrates such an
introduction of Linux into technology with Read-Copy
Update (RCU). The RCU API's evolution over time clearly
shows that Linux's extremely diverse set of workloads
and platforms has changed RCU to a far greater degree
than RCU has changed Linux---and it is reasonable to
expect that other technologies that might be proposed
for inclusion into Linux would face similar challenges.
In addition, this paper presents a summary of lessons
learned and an attempt to foresee what additional
challenges Linux might present to RCU.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bahmann:2008:EFK,
author = "Helge Bahmann and Konrad Froitzheim",
title = "Extending futex for kernel to user notification",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "18--26",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400100",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Threads in reactive applications need to service a
multitude of events from different sources such as
device drivers, communication channels or cooperating
threads. While notification about these events can
conceptually be understood as a form of
'synchronization', most operating systems (including
Linux) do not provide a unified abstraction. This paper
proposes to separate event delivery and notification,
and to provide unified event notification through
general-purpose synchronization objects. It
demonstrates how this unified mechanism can be
implemented in Linux as an extension of the futex
mechanism to allow notification from kernel-space.
Required modifications are discussed and their impact
is assessed. The new event notification mechanism
allows to move many thread activation policy decisions
into user-space, with benefits for multi-threaded
reactive applications: This is demonstrated in a
modification of the leader/followers pattern with
considerable performance benefits.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "event notification; followers; futex; leader {\&}
synchronization",
}
@Article{Ganti:2008:PAL,
author = "Ashwin Ganti",
title = "{Plan 9} authentication in {Linux}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "27--33",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400101",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/plan9.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
abstract = "In Linux, applications like su and login currently run
as root in order to access authentication information
and set or alter the identity of the process. In such
cases, if the application is compromised while running
as a privileged user, the entire system can become
vulnerable. An alternative approach is taken by the
Plan 9 operating system from Bell Labs, which runs such
applications as a non-privileged user and relies on a
kernel-based capability device working in coordination
with an authentication server to provide the same
services. This avoids the risk of an application
vulnerability becoming a system vulnerability.\par
This paper discusses the extension of Linux
authentication mechanisms to allow the use of the Plan
9 approach with existing Linux applications in order to
reduce the security risks mentioned earlier. It
describes the port of the Plan 9 capability device as a
character device driver for the Linux kernel. It also
describes the port of the Plan 9 authentication server
and the implementation of a PAM module which allows the
use of these new facilities. {\em It is now possible to
restrain processes like login and su from the
uncontrolled setuid bit and make them run on behalf of
an unprivileged user in Linux}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "authentication",
}
@Article{Wong:2008:TAF,
author = "Chee Siang Wong and Ian Tan and Rosalind Deena Kumari
and Fun Wey",
title = "Towards achieving fairness in the {Linux} scheduler",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "34--43",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400102",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Operating System scheduler is designed to allocate
the CPU resources appropriately to all processes. The
Linux Completely Fair Scheduler (CFS) design ensures
fairness among tasks using the thread fair scheduling
algorithm. This algorithm ensures allocation of
resources based on the number of threads in the system
and not within executing programs. This can lead to
fairness issue in a multi-threaded environment as the
Linux scheduler tends to favor programs with higher
number of threads. We illustrate the issue of fairness
through experimental evaluation thus exposing the
weakness of the current allocation scheme where
software developers could take advantage by spawning
many additional threads in order to obtain more CPU
resources. A novel algorithm is proposed as a solution
towards achieving better fairness in the Linux
scheduler. The algorithm is based on weight
readjustment of the threads created in the same process
to significantly reduce the unfair allocation of CPU
resources in multi-threaded environments. The algorithm
was implemented and evaluated. It demonstrated
promising results towards solving the raised fairness
issue. We conclude this paper highlighting the
limitations of the proposed approach and the future
work in the stated direction.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "completely fair scheduler; fairness; Linux; process
scheduling",
}
@Article{Craciunas:2008:RMT,
author = "Silviu S. Craciunas and Christoph M. Kirsch and Harald
R{\"o}ck",
title = "{I/O} resource management through system call
scheduling",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "44--54",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400103",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A principal challenge in operating system design is
controlling system throughput and responsiveness while
maximizing resource utilization. Unlike previous
attempts in kernel resource management, which often
involve non-trivial changes in kernel subsystems, we
focus on the kernel's edge. System calls are usually
the default mechanism for user processes to get access
to operating system services. System calls can
therefore be used to control throughput and
responsiveness and thus also affect resource
utilization directly. We propose a simple,
non-intrusive kernel-space mechanism for explicit,
per-process system call scheduling already at kernel
entry in order to control the time and rate at which
system calls are executed, and, as a result, the
per-process utilization of the involved resources. We
have developed a high-performance Linux 2.6 kernel
patch with SMP support that implements system call
scheduling for network- and disk-related I/O calls with
policies that resemble traffic shaping in network
routers. Our experiments show that already simple and
easy-to-use policies provide effective I/O-related
process isolation with low overhead, and reduce
thrashing in certain overload scenarios. While system
call scheduling may still not be able to outperform
resource management systems that use specifically tuned
kernel subsystems, our experiments indicate that it may
sufficiently support relevant soft real-time
applications yet using a vastly simpler and more
generic approach.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deBruijn:2008:PFL,
author = "Willem de Bruijn and Herbert Bos",
title = "{PipesFS}: fast {Linux I/O} in the {Unix} tradition",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "55--63",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400104",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents PipesFS, an I/O architecture for
Linux 2.6 that increases I/O throughput and adds
support for heterogeneous parallel processors by (1)
collapsing many I/O interfaces onto one: the Unix
pipeline, (2) increasing pipe efficiency and (3)
exploiting pipeline modularity to spread computation
across all available processors.\par
PipesFS extends the pipeline model to kernel I/O and
communicates with applications through a Linux virtual
filesystem (VFS), where directory nodes represent
operations and pipe nodes export live kernel data.
Users can thus interact with kernel I/O through
existing calls like mkdir, tools like grep, most
languages and even shell scripts. To support
performance critical tasks, PipesFS improves pipe
throughput through copy, context switch and cache miss
avoidance. To integrate heterogeneous processors (e.g.,
the Cell) it transparently moves operations to the most
efficient type of core.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ha:2008:CNT,
author = "Sangtae Ha and Injong Rhee and Lisong Xu",
title = "{CUBIC}: a new {TCP}-friendly high-speed {TCP}
variant",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "64--74",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400105",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "CUBIC is a congestion control protocol for TCP
(transmission control protocol) and the current default
TCP algorithm in Linux. The protocol modifies the
linear window growth function of existing TCP standards
to be a cubic function in order to improve the
scalability of TCP over fast and long distance
networks. It also achieves more equitable bandwidth
allocations among flows with different RTTs (round trip
times) by making the window growth to be independent of
RTT -- thus those flows grow their congestion window at
the same rate. During steady state, CUBIC increases the
window size aggressively when the window is far from
the saturation point, and the slowly when it is close
to the saturation point. This feature allows CUBIC to
be very scalable when the bandwidth and delay product
of the network is large, and at the same time, be
highly stable and also fair to standard TCP flows. The
implementation of CUBIC in Linux has gone through
several upgrades. This paper documents its design,
implementation, performance and evolution as the
default TCP algorithm of Linux.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wu:2008:DNL,
author = "Fengguang Wu and Hongsheng Xi and Chenfeng Xu",
title = "On the design of a new {Linux} readahead framework",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "75--84",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400106",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As Linux runs an increasing variety of workloads, its
in-kernel readahead algorithm has been challenged by
many unexpected and subtle problems. To name a few:
readahead thrashings arise when readahead pages are
evicted prematurely under memory pressure; readahead
attempts on already cached pages are undesirable;
interrupted-then-retried reads and locally disordered
NFS reads that can easily fool the sequential detection
logic. In this paper, we present a new Linux readahead
framework with flexible and robust heuristics that can
cover varied sequential I/O patterns. It also enjoys
great simplicity by handling most abnormal cases in an
implicit way. We demonstrate its advantages by a host
of case studies. Network throughput is 3 times better
in the case of thrashing and 1.8 times better for large
NFS files. On serving large files with lighttpd, the
disk utilization is decreased by 26\% while providing
17\% more network throughput.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "access pattern; caching; I/O performance; Linux;
operating systems; prefetching; readahead;
sequentiality; thrashing",
}
@Article{Boutcher:2008:PTP,
author = "David Boutcher and Abhishek Chandra",
title = "Practical techniques for purging deleted data using
liveness information",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "85--94",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400107",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The layered design of the Linux operating system hides
the {\em liveness\/} of file system data from the
underlying block layers. This lack of liveness
information prevents the storage system from discarding
blocks deleted by the file system, often resulting in
poor utilization, security problems, inefficient
caching, and migration overheads. In this paper, we
define a generic 'purge' operation that can be used by
a file system to pass liveness information to the block
layer with minimal changes in the layer interfaces,
allowing the storage system to discard deleted data. We
present three approaches for implementing such a purge
operation: direct call, zero blocks, and flagged
writes, each of which differs in their architectural
complexity and potential performance overhead. We
evaluate the feasibility of these techniques through a
reference implementation of a dynamically resizable
copy on write (COW) data store in User Mode Linux
(UML). Performance results obtained from this reference
implementation show that all these techniques can
achieve significant storage savings with a reasonable
execution time overhead. At the same time, our results
indicate that while the direct call approach has the
best performance, the zero block approach provides the
best compromise in terms of performance overhead and
its semantic and architectural simplicity. Overall, our
results demonstrate that passing liveness information
across the file system-block layer interface with
minimal changes is not only feasible but practical.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Russell:2008:VTF,
author = "Rusty Russell",
title = "{{\tt virtio}}: towards a de-facto standard for
virtual {I/O} devices",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "95--103",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400108",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Linux Kernel currently supports at least 8
distinct virtualization systems: Xen, KVM, VMware's
VMI, IBM's System p, IBM's System z, User Mode Linux,
lguest and IBM's legacy iSeries. It seems likely that
more such systems will appear, and until recently each
of these had its own block, network, console and other
drivers with varying features and
optimizations.\par
The attempt to address this is virtio: a series of
efficient, well-maintained Linux drivers which can be
adapted for various different hypervisor
implementations using a shim layer. This includes a
simple extensible feature mechanism for each driver. We
also provide an obvious ring buffer transport
implementation called vring, which is currently used by
KVM and lguest. This has the subtle effect of providing
a path of least resistance for any new hypervisors:
supporting this efficient transport mechanism will
immediately reduce the amount of work which needs to be
done. Finally, we provide an implementation which
presents the vring transport and device configuration
as a PCI device: this means guest operating systems
merely need a new PCI driver, and hypervisors need only
add vring support to the virtual devices they implement
(currently only KVM does this).\par
This paper will describe the virtio API layer as
implemented in Linux, then the vring implementation,
and finally its embodiment in a PCI device for simple
adoption on otherwise fully-virtualized guests. We'll
wrap up with some of the preliminary work to integrate
this I/O mechanism deeper into the Linux host kernel.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "I/O; KVM; lguest; Linux; ring buffer; virtio;
virtio_pci; virtualization; vring",
}
@Article{Bhattiprolu:2008:VSC,
author = "Sukadev Bhattiprolu and Eric W. Biederman and Serge
Hallyn and Daniel Lezcano",
title = "Virtual servers and checkpoint\slash restart in
mainstream {Linux}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "104--113",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400109",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtual private servers and application checkpoint and
restart are two advanced operating system features
which place different but related requirements on the
way kernel-provided resources are accessed by
userspace. In Linux, kernel resources, such as process
IDs and SYSV shared messages, have traditionally been
identified using global tables. Since 2005, these
tables have gradually been transformed into per-process
namespaces in order to support both resource
availability on application restart and virtual private
server functionality. Due to inherent differences in
the resources themselves, the semantics of namespace
cloning differ for many of the resources. This paper
describes the existing and proposed namespaces as well
as their uses.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "checkpoint; mobility; reliability; restart; security;
survivability; virtualization",
}
@Article{Varman:2008:SVP,
author = "Peter Varman and Jun Wang",
title = "Storage and {I/O} virtualization, performance, energy,
evaluation and dependability {(SPEED08)}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "1--2",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453777",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guerra:2008:CAB,
author = "Jorge Guerra and Luis Useche and Medha Bhadkamkar and
Ricardo Koller and Raju Rangaswami",
title = "The case for active block layer extensions",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "3--9",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453778",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Self-managing storage systems have recently received
attention from the research community due to their
promised ability of continuously adapting to best
reflect high-level system goal specifications. However,
this eventuality is currently being met by both
conceptual and practical challenges that threaten to
slow down the pace of innovation. We argue that two
fundamental directions will help evolve the state of
self-managing storage systems: (i) a standardized
development environment for self-management extensions
that also addresses ease of deployment, and (ii) a
theoretical framework for reasoning about behavioral
properties of individual and collective self-management
extensions. We propose Active Block Layer Extensions
(ABLE), an operating system infrastructure that aids
the development and manages the deployed instances of
self-management extensions within the storage stack.
ABLE develops a theory behind block layer extensions
that helps address key questions about overall storage
stack behavior, data consistency, and reliability. We
exemplify specific storage self-management solutions
that can be built as stackable extensions using ABLE.
Our initial experience with ABLE and few block layer
extensions that we have been building, leads to believe
that the ABLE infrastructure can substantially simplify
the development and deployment of robust,
self-managing, storage systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gulati:2008:TDS,
author = "Ajay Gulati and Irfan Ahmad",
title = "Towards distributed storage resource management using
flow control",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "10--16",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453779",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Deployment of shared storage systems is increasing
with rapid adoption of virtualization technologies to
provide flexible sharing, isolation, better management
and high utilization of resources. {\em Quality of
service (QoS)\/} in such environments is quite
desirable for meeting IO demands of virtual machines.
The lack of QoS support at typical storage arrays,
simultaneous access by multiple hosts and concerns
regarding under-utilization of resources makes this
problem quite challenging. In this paper, we study the
problem of providing fairness among hosts accessing a
storage array in a distributed manner while maintaining
high efficiency. Towards this goal, we investigate
whether local latency estimates at each host can be
used to detect overload and whether limiting host issue
queue lengths can provide fairness across hosts. In
principle, the approach is similar to mechanisms used
by TCP at each host for flow control. Initial
experiments and simulation results for control
mechanism provide encouragement to develop a complete
framework.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distributed storage management; flow control; IO
scheduling",
}
@Article{Ge:2008:PDQ,
author = "Ping Ge and Hailong Cai",
title = "Providing differentiated {QoS} for peer-to-peer file
sharing systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "17--23",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453780",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we propose a new Cluster Server
Architecture (CSA) to realize an enhanced
differentiated QoS in P2P file sharing systems. CSA
adopts two approaches to provide a better QoS for
dedicated users than standard users: (1) expedited
forwarding messages of dedicated users and system
maintenance messages at each node to speedup their
response times, and (2) temporarily caching and
instantly supplying routing information for dedicated
users to reduce their self-organization overhead and
warm-up time. Both theoretical analysis and simulation
results show that our proposed architecture and
algorithms effectively and efficiently implement a
differentiated QoS model in P2P file sharing systems.
The CSA introduces only modest overhead but still
retains a good scalability and robustness.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Raj:2008:OEO,
author = "Himanshu Raj and Karsten Schwan",
title = "{O2S2}: enhanced object-based virtualized storage",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "24--29",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453781",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Object based storage devices (OSDs) elevate the level
of abstraction presented to clients, thereby permitting
them to offer methods for managing, sharing, and
securing information that go beyond those offered by
block-based stores. The Object-Oriented Storage System
(O2S2) architecture presented and evaluated in this
paper provides object-based storage in a virtualized
environment. This service provides a virtual
object-based storage device (vOSD) to virtual machines.
The use of vOSDs permits the service provider, i.e.,
the {\em vOSD storage domain}, to offer to guest
virtual machines new methods for resource management
and consolidation Methods demonstrated in this paper
include improved support for access control and for
heterogeneity of storage devices. A prototype
PVFS-based O2S2 implementation demonstrates that its
enhanced services can be provided at low cost, enabled
in part by the efficient utilization of otherwise idle
storage domain resources.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{He:2008:DOB,
author = "Shuibing He and Dan Feng",
title = "Design of an object-based storage device based on
{I/O} processor",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "30--35",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453782",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Object-based Storage Device (OSD) is the foundation of
the Object-based Storage System (OBSS). As the
petabyte-scale OBSS includes thousands of OSDs, the
performance, cost and power of single OSD must be
considered together to build such a huge storage system
The existing OSD based on server and general-purposed
PC platform cannot have an excellent tradeoff among the
three factor as they are not designed specifically for
storage applications. An original OSD architecture
based on the Intel IOP315 I/O processor chipset is
presented in this paper. The I/O processor makes it
powerful for the OSD to process the network
communication protocol and the unique switch fabric of
the chipset can further improve the I/O performance
through parallel data transfer in multiple I/O
channels. The experimental results show that the OSD
performs well for system performance. Moreover, it
provides characteristic of low cost and power.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "I/O processor; object-based storage device;
performance; power; switch fabric",
}
@Article{Lee:2008:LLA,
author = "Sungjin Lee and Dongkun Shin and Young-Jin Kim and
Jihong Kim",
title = "{LAST}: locality-aware sector translation for {NAND}
flash memory-based storage systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "36--42",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453783",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As flash memory technologies quickly improve, NAND
flash memory-based storage devices are becoming a
viable alternative as a secondary storage solution for
general-purpose computing systems such as personal
computers and enterprise server systems. Most existing
flash translation layer (FTL) schemes are, however,
ill-suited for such systems because they were optimized
for storage write patterns of embedded systems only. In
this paper, we propose a new flash management technique
called LAST which is optimized for access
characteristics of general-purpose computing systems.
By exploiting the locality of storage access patterns,
LAST reduces the garbage collection overhead
significantly, thus increasing the I/O performance of
flash-based storage devices. Our experimental results
show that the proposed technique reduces the garbage
collection overhead by 54\% over the existing flash
memory management techniques.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Patrick:2008:CEO,
author = "Christina M. Patrick and SeungWoo Son and Mahmut
Kandemir",
title = "Comparative evaluation of overlap strategies with
study of {I/O} overlap in {MPI-IO}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "43--49",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453784",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many scientific applications use parallel I/O to meet
the low latency and high bandwidth I/O
requirement. Among many available parallel I/O
operations, collective I/O is one of the most popular
methods when the storage layouts and access patterns of
data do not match. The implementation of collective I/O
typically involves disk I/O operations followed by
interprocessor communications. Also, in many
I/O-intensive applications, parallel I/O operations are
usually followed by parallel computations. This paper
presents a comparative study of different overlap
strategies in parallel applications. We have
experimented with four different overlap strategies (1)
Overlapping I/O and communication; (2) Overlapping I/O
and computation; (3) Overlapping computation and
communication; and (4) Overlapping I/O, communication,
and computation. All experiments have been conducted on
a Linux Cluster and the performance results obtained
are very encouraging. On an average, we have enhanced
the performance of a generic collective read call by
38\%, the MxM benchmark by 26\%, and the FFT benchmark
by 34\%.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deOliveira:2008:BWO,
author = "R{\^o}mulo Silva de Oliveira and Alexandre
Sztajnberg",
title = "{Brazilian} workshop on operating systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "50--51",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453786",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Regnier:2008:EIH,
author = "Paul Regnier and George Lima and Luciano Barreto",
title = "Evaluation of interrupt handling timeliness in
real-time {Linux} operating systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "52--63",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453787",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Several real-time Linux extensions are available
nowadays. Two of those extensions that have received
special attention recently are Preempt-RT and Xenomai.
This paper evaluates to what extent they provide
deterministic guarantees when reacting to external
events, an essential characteristic when it comes to
real-time systems. For this, we define two simple
experimental approaches. Our results indicate that
Preempt-RT is more prone to temporal variations than
Xenomai when the system is subject to overload
scenarios.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "interrupt handling; Linux; operating system; real
time",
}
@Article{Colaco:2008:UFW,
author = "Eduardo M. Cola{\c{c}}o and Marcelo Iury S. Oliveira
and Alexandro S. Soares and Francisco Brasileiro and
Dalton S. Guerrero",
title = "Using a file working set model to speed up the
recovery of {Peer-to-Peer} backup systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "64--70",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453788",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The high churn and low bandwidth characteristics of
peer-to-peer (P2P) backup systems make recovery a
time-consuming activity that increases the system's
outage. This is especially disturbing from the user's
perspective, because during outage the user is
prevented from carrying out useful work. Nevertheless,
at any given time, a user typically requires only a
small number of her files to continue working. If the
backup system is able to quickly recover these files,
then the system's outage can be greatly reduced, even
if a large portion of the data lost is still being
recovered. In this paper, we evaluate the use of a file
system working set model to support efficient recovery
of a P2P backup system. By exploiting a simple LRU-like
working set model, we have designed a recovery
mechanism that substantially reduces outage and allows
the user to return to work more quickly. The
simulations we have performed show that even this
simple model is able to reduce the outage by as much as
80\%, when compared to the state-of-practice in P2P
backup recovery.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "backup; file systems; optimization and performance
evaluation; P2P systems",
}
@Article{Wiedenhoft:2008:PME,
author = "Geovani Ricardo Wiedenhoft and Lucas Francisco Wanner
and Giovani Gracioli and Ant{\^o}nio Augusto
Fr{\"o}hlich",
title = "Power management in the {EPOS} system",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "71--80",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453789",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Power management strategies for embedded systems
typically rely on static, application driven
deactivation of components (e.g. sleep, suspend), or on
dynamic voltage and frequency scaling. However, the
design and implementation of these strategies in
embedded operating system often fail to deal with
real-time and quality-of-service (QoS)
requirements.\par
The EPOS system implements an infra-structure that
supports both static (application-driven) and dynamic
(system-driven) power management. In this work, this
infrastructure is used to explore energy as a parameter
for QoS in embedded systems, with the goal of
guaranteeing energy consumption metrics, while
preserving the deadlines of essential (hard real-time)
tasks. Given a set of real-time tasks and their
associated energy consumption, we provide equations to
check schedulability in project-time. At runtime, a
preemptive scheduler for imprecise tasks prevents the
execution of optional subtasks whenever there is the
possibility of deadline loss or depletion of the energy
source. We show that this mechanism is effective in
controlling energy consumption and ensuring
'best-effort' computation without deadline loss.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "embedded systems; imprecise computation; power
management",
}
@Article{Midorikawa:2008:ARB,
author = "Edson T. Midorikawa and Ricardo L. Piantola and Hugo
H. Cassettari",
title = "On adaptive replacement based on {LRU} with working
area restriction algorithm",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "81--92",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453790",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Adaptive algorithms are capable of modifying their own
behavior through time, depending on the execution
characteristics. Recently, we have proposed LRU-WAR, an
adaptive replacement algorithm whose objective is to
minimize failures detected in LRU policy, preserving
its simplicity and low overhead. In this paper, we
present our contribution to the study of adaptive
replacement algorithms describing their behavior under
a number of workloads. Simulations include an analysis
of the performance sensibility with the variation of
the control parameters and its application in a
multiprogrammed environment. In order to address
LRU-WAR weakness as a global policy, we also introduce
LRU-WARlock. The simulation results show that
substantial performance improvements can be obtained.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "adaptive replacement; demand paging; LRU; virtual
memory",
}
@Article{Robbins:2008:TPA,
author = "Steven Robbins",
title = "A three pronged approach to teaching undergraduate
operating systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "93--100",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453792",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper describes an approach to teaching an
undergraduate operating systems course that relies on
three aspects. First, a standard textbook is used for
the basic theoretical material. Second, programming
projects are used to reinforce some of the material
covered from the textbook. Lastly, simulators are used
to illustrate other material. A key to the approach is
to use experimentation by the student to enhance
understanding and prepare them for research. Although
no formal evaluation has been done, students seem to
enjoy using the simulators and student performance on
exams has increased since the simulators were
introduced.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "curriculum; operating systems; systems programming",
}
@Article{Hamberg:2008:UMC,
author = "Roelof Hamberg and Frits Vaandrager",
title = "Using model checkers in an introductory course on
operating systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "6",
pages = "101--111",
month = oct,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1453775.1453793",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Oct 23 14:23:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "During the last three years, we have been
experimenting with the use of the Uppaal model checker
in an introductory course on operating systems for
first-year Computer Science students at the Radboud
University Nijmegen. The course uses model checkers as
a tool to explain, visualize and solve concurrency
problems. Our experience is that students enjoy to play
with model checkers because it makes concurrency issues
tangible. Even though it is hard to measure
objectively, we think that model checkers really help
students to obtain a deeper insight into concurrency.
In this article, we report on our experiences in the
classroom, explain how mutual exclusion algorithms,
semaphores and monitors can conveniently be modeled in
Uppaal, and present some results on properties of
small, concurrent patterns.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "concurrency; model checkers; monitors; mutual
exclusion; operating system course; semaphores",
}
@Article{Grider:2009:CGF,
author = "Gary Grider and James Nunez and John Bent and Steve
Poole and Rob Ross and Evan Felix",
title = "Coordinating government funding of file system and
{I/O} research through the high end computing
university research activity",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "2--7",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496910",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In 2003, the High End Computing Revitalization Task
Force designated file systems and I/O as an area in
need of national focus. The purpose of the High End
Computing Interagency Working Group (HECIWG) is to
coordinate government spending on File Systems and I/O
(FSIO) R\&D by all the government agencies that are
involved in High End Computing. The HECIWG tasked a
smaller advisory group to list, categorize, and
prioritize HEC I/O and File Systems R\&D needs. In
2005, leaders in FSIO from academia, industry and
government agencies collaborated to list and prioritize
areas of research in HEC FSIO. This led to a very
successful High End Computing University Research
Activity (HECURA) call from NSF in 2006 and has
prompted a new HECURA call from NSF in 2009. This paper
serves as both a review of the 2008 HEC FSIO identified
research gaps as well as a preview of this forthcoming
HECURA call.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "file systems; high end computing; storage",
}
@Article{Mogul:2009:CSR,
author = "Jeffrey C. Mogul and Jay J. Wylie",
title = "Computer systems research at {HP Labs}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "8--9",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496912",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wilkes:2009:TRR,
author = "John Wilkes",
title = "Traveling to {Rome}: a retrospective on the journey",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "10--15",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496914",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Starting in 1994/5, the Storage Systems Program at HP
Labs embarked on a decade-long journey to automate the
management of enterprise storage systems by means of a
technique we initially called attribute-managed
storage. The key idea was to provide declarative
specifications of workloads and their needs, and of
storage devices and their capabilities, and to automate
the mapping of one to the other. One of many outcomes
of the project was a specification language we called
Rome 1 --- hence the title of this paper, which offers a
short retrospective on the approach and some of the
lessons we learned along the way.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "attribute-based storage; declarative system
management; solvers; storage management; storage
performance models",
}
@Article{Goldsack:2009:SCM,
author = "Patrick Goldsack and Julio Guijarro and Steve Loughran
and Alistair Coles and Andrew Farrell and Antonio Lain
and Paul Murray and Peter Toft",
title = "The {SmartFrog} configuration management framework",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "16--25",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496915",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "SmartFrog is a framework for creating
configuration-driven systems. It has been designed with
the express purpose of making the design, deployment
and management of distributed component-based systems
simpler and more robust. Over the last decade it has
been the focus for ongoing research into aspects of
configuration management and large-scale distributed
systems, providing a platform for experimentation. The
paper covers the rationale for the design of the
framework, details of its design, plus a description of
the further research that is in progress.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "automation; autonomic computing; configuration;
deployment; distributed systems; lifecycle; management;
scalability; SmartFrog",
}
@Article{Brassil:2009:CSH,
author = "Jack Brassil and Rick McGeer and Raj Rajagopalan and
Puneet Sharma and Praveen Yalagandula and Sujata
Banerjee and David P. Reed and Sung-Ju Lee",
title = "The {CHART} system: a high-performance, fair transport
architecture based on explicit-rate signaling",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "26--35",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496916",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "TCP/IP is known to have poor performance under
conditions of moderate to high packet loss (5\%-20\%)
and end-to-end latency (20-200 ms). The CHART system,
under development by HP and its partners under contract
to the US Defense Advanced Research Projects Agency, is
a careful re-engineering of Internet Layer 3 and Layer
4 protocols to improve TCP/IP performance in these
cases. The CHART system has just completed the second
phase of a three-phase, 42-month development cycle. The
goal for the 42-month program was a 10x improvement in
the performance of TCP/IP under conditions of loss and
delay. In independent tests for DARPA at Science
Applications International Corporation, the CHART
System demonstrated a 20x performance improvement over
TCP/IP, exceeding the goals for the program by a factor
of two. Fairness to legacy TCP and UDP flows was further
demonstrated in DARPA testing. We describe the CHART
System as a set of five interacting services and
protocol improvements which act together to make TCP/IP
robust under conditions of loss and latency, and we
describe and detail the test regime and performance
results.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "explicit-rate; flow-based routing; overlay; quality of
service; virtualization",
}
@Article{Dalton:2009:TVP,
author = "Chris I. Dalton and David Plaquin and Wolfgang Weidner
and Dirk Kuhlmann and Boris Balacheff and Richard Brown",
title = "Trusted virtual platforms: a key enabler for converged
client devices",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "36--43",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496918",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper introduces our work around combining
machine virtualization technology with Trusted
Computing Group technology. We first describe our
architecture for reducing and containing the privileged
code of the Xen Hypervisor. Secondly we describe our
Trusted Virtual Platform architecture. This is aimed at
supporting the strong enforcement of integrity and
security policy controls over a virtual entity where a
virtual entity can be either a full guest operating
system or virtual appliance running on a virtualized
platform. The architecture includes a
virtualization-specific integrity measurement and
reporting framework. This is designed to reflect all
the dependencies of the virtual environment of a guest
operating system. The work is a core enabling component
of our research around converged devices -- client
platforms such as notebooks or desktop PCs that can
safely host multiple virtual operating systems and
virtual appliances concurrently and report accurately
on the trustworthiness of the individually executing
entities.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "open trusted computing; TCG; TPM; trusted
virtualization",
}
@Article{Baldwin:2009:PSS,
author = "Adrian Baldwin and Chris Dalton and Simon Shiu and
Krzysztof Kostienko and Qasim Rajpoot",
title = "Providing secure services for a virtual
infrastructure",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "44--51",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496919",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualization brings flexibility to the data center
and enables separations allowing for better security
properties. For these security properties to be fully
utilized, virtual machines need to be able to connect
to secure services such as networking and storage. This
paper addresses the problems associated with managing
the cryptographic keys upon which such services rely by
ensuring that keys remain within the trusted computing
base. Here we describe a general architecture for
managing keys tied to the underlying virtualized
systems, with a specific example given for secure
storage.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "key management; storage; TCG; virtualization",
}
@Article{Argollo:2009:CIF,
author = "Eduardo Argollo and Ayose Falc{\'o}n and Paolo
Faraboschi and Matteo Monchiero and Daniel Ortega",
title = "{COTSon}: infrastructure for full system simulation",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "52--61",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496921",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Simulation has historically been the primary technique
used for evaluating the performance of new proposals in
computer architecture. Speed and complexity
considerations have traditionally limited its
applicability to single-thread processors running
application-level code. This is no longer sufficient to
model modern multicore systems running the complex
workloads of commercial interest today.\par
COTSon is a simulator framework jointly developed by HP
Labs and AMD. The goal of COTSon is to provide fast and
accurate evaluation of current and future computing
systems, covering the full software stack and complete
hardware models. It targets cluster-level systems
composed of hundreds of commodity multicore nodes and
their associated devices connected through a standard
communication network. COTSon adopts a
functional-directed philosophy, where fast functional
emulators and timing models cooperate to improve the
simulation accuracy at a speed sufficient to simulate
the full stack of applications, middleware and
OSs.\par
This paper describes the changes in simulation
philosophy we embraced in COTSon to address these new
challenges. We base functional emulation on
established, fast and validated tools that support
commodity OSs and complex multitier applications.
Through a robust interface between the functional and
timing domain, we can leverage other existing
simulators for individual sub-components, such as disks
or networks. We abandon the idea of 'always-on'
cycle-based simulation in favor of statistical sampling
approaches that can trade accuracy for
speed.\par
COTSon opens up a new dimension in the speed/accuracy
space, allowing simulation of a cluster of nodes
several orders of magnitude faster with a minimal
accuracy loss.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "full system simulation",
}
@Article{Zhu:2009:WDC,
author = "Xiaoyun Zhu and Mustafa Uysal and Zhikui Wang and
Sharad Singhal and Arif Merchant and Pradeep Padala and
Kang Shin",
title = "What does control theory bring to systems research?",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "62--69",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496922",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Feedback mechanisms can help today's increasingly
complex computer systems adapt to changes in workloads
or operating conditions. Control theory offers a
principled way for designing feedback loops to deal
with unpredictable changes, uncertainties, and
disturbances in systems. We provide an overview of the
joint research at HP Labs and University of Michigan in
the past few years, where control theory was applied to
automated resource and service level management in data
centers. We highlight the key benefits of a
control-theoretic approach for systems research, and
present specific examples from our experience of
designing adaptive resource control systems where this
approach worked well. In addition, we outline the main
limitations of this approach, and discuss the lessons
learned from our experience.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "control theory; dynamics; model; stability; systems
research",
}
@Article{Anderson:2009:DEF,
author = "Eric Anderson and Martin Arlitt and Charles B. {Morrey
III} and Alistair Veitch",
title = "{DataSeries}: an efficient, flexible data format for
structured serial data",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "70--75",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496923",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Structured serial data is used in many scientific
fields; such data sets consist of a series of records,
and are typically written once, read many times,
chronologically ordered, and read sequentially. In this
paper we introduce DataSeries, an on-disk format,
run-time library and set of tools for storing and
analyzing structured serial data. We identify six key
properties of a system to store and analyze this type
of data, and describe how DataSeries was designed to
provide these properties. We quantify the benefits of
DataSeries through several experiments. In particular,
we demonstrate that DataSeries exceeds the performance
of common trace formats by at least a factor of two.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "compression; data format; performance;
trace-analysis",
}
@Article{Povzner:2009:AAE,
author = "Anna Povzner and Kimberly Keeton and Arif Merchant and
Charles B. {Morrey III} and Mustafa Uysal and Marcos
K. Aguilera",
title = "{Autograph}: automatically extracting workflow file
signatures",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "76--83",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496925",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Storage management activities, such as reporting, file
placement, migration and archiving, require the ability
to discover files that belong to an application
workflow by relying only on information from the file
server. Some classes of application workflows, such as
rendering an animated sequence from its graphics models
or building an application from its source files, often
exhibit a high degree of repeatability. We describe a
system called Autograph that exploits this
repeatability to discover files that belong to an
application workflow. Our approach examines traces of
file accesses, finds repeated and correlated accesses,
and infers which files likely belong to the same
workflow. Our solution targets server workflows and
uses file server traces, which contain less process and
file information than the local machine traces used in
prior work. We show that Autograph successfully
extracts workflow file signatures, even if the
workflows are concurrent or share files.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "application workflow; storage management",
}
@Article{Forman:2009:EDL,
author = "George Forman and Kave Eshghi and Jaap Suermondt",
title = "Efficient detection of large-scale redundancy in
enterprise file systems",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "84--91",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496926",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In order to catch and reduce waste in the
exponentially increasing demand for disk storage, we
have developed very efficient technology to detect
approximate duplication of large directory hierarchies.
Such duplication can be caused, for example, by
unnecessary mirroring of repositories by uncoordinated
employees or departments. Identifying these duplicate
or near-duplicate hierarchies allows appropriate action
to be taken at a high level. For example, one could
coordinate and consolidate multiple copies in one
location.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "data mining; directory similarity and de-duplication;
file systems; min-hashing; scalability; set sketches;
storage management",
}
@Article{Dayal:2009:MOB,
author = "Umeshwar Dayal and Harumi Kuno and Janet L. Wiener and
Kevin Wilkinson and Archana Ganapathi and Stefan
Krompass",
title = "Managing operational business intelligence workloads",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "92--98",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496927",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We explore how to manage database workloads that
contain a mixture of OLTP-like queries that run for
milliseconds as well as business intelligence queries
and maintenance tasks that last for hours. As data
warehouses grow in size to petabytes and complex
analytic queries play a greater role in day-to-day
business operations, factors such as inaccurate
cardinality estimates, data skew, and resource
contention all make it notoriously difficult to predict
how such queries will behave before they start
executing. However, traditional workload management
assumes that accurate expectations for the resource
requirements and performance characteristics of a
workload are available at compile-time, and relies on
such information in order to make critical workload
management decisions. In this paper, we describe our
approach to dealing with inaccurate predictions. First,
we evaluate the ability of workload management
algorithms to handle workloads that include
unexpectedly long-running queries. Second, we describe
a new and more accurate method for predicting the
resource usage of queries before runtime. We have
carried out an extensive set of experiments, and report
on a few of our results.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "business intelligence databases; database performance
prediction; database workload management",
}
@Article{Hazelwood:2009:COA,
author = "Kim Hazelwood and Mohamed Zahran",
title = "Challenges and opportunities at all levels:
interactions among operating systems, compilers, and
multicore processors",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "3--4",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531795",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wells:2009:DHN,
author = "Philip M. Wells and Koushik Chakraborty and Gurindar
S. Sohi",
title = "Dynamic heterogeneity and the need for multicore
virtualization",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "5--14",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531797",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As the computing industry enters the multicore era,
exponential growth in the number of transistors on a
chip continues to present challenges and opportunities
for computer architects and system designers. We
examine one emerging issue in particular: that of
dynamic heterogeneity, which can arise, even among
physically homogeneous cores, from changing
reliability, power, or thermal conditions, different
cache and TLB contents, or changing resource
configurations. This heterogeneity results in a
constantly varying pool of hardware resources, which
greatly complicates software's traditional task of
assigning computation to cores. In part to address
dynamic heterogeneity, we argue that hardware should
take a more active role in the management of its
computation resources. We propose hardware techniques
to virtualize the cores of a multicore processor,
allowing hardware to flexibly reassign the virtual
processors that are exposed, even to a single operating
system, to any subset of the physical cores. We show
that multicore virtualization operates with minimal
overhead, and that it enables several novel resource
management applications for improving both performance
and reliability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nagarajan:2009:RMM,
author = "Vijay Nagarajan and Rajiv Gupta",
title = "Runtime monitoring on multicores via {OASES}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "15--24",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531798",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Runtime monitoring support serves as a foundation for
the important tasks of providing security, performing
debugging, and improving performance of applications.
Often runtime monitoring requires the maintenance of
information associated with each of the application's
original memory location, which is held in
corresponding shadow memory locations. Unfortunately,
existing robust shadow memory implementations are
inefficient. In this paper, we present OASES: OS and
Architectural Support for Efficient Shadow memory
implementation for multicores that is also robust. A
combination of operating system support (in the form of
coupled allocation of memory pages used by the
application and associated shadow memory pages) and
architectural support (in the form of ISA support and
exposed cache events) is proposed. Our page allocation
policy enables fast translation of original addresses
into corresponding shadow memory addresses; thus
allowing implicit addressing of shadow memory. By
exposing the cache events to the software, we ensure in
software that the shadow memory instructions execute
atomically with their corresponding original memory
instructions. Our experiments show that the overheads
of runtime monitoring tasks are significantly reduced
in comparison to previous software implementations.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "atomic updates; exposed cache events; shadow memory",
}
@Article{Rafique:2009:SML,
author = "M. Mustafa Rafique and Benjamin Rose and Ali R. Butt
and Dimitrios S. Nikolopoulos",
title = "Supporting {MapReduce} on large-scale asymmetric
multi-core clusters",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "25--34",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531800",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Asymmetric multi-core processors (AMPs) with
general-purpose and specialized cores packaged on the
same chip, are emerging as a leading paradigm for
high-end computing. A large body of existing research
explores the use of standalone AMPs in computationally
challenging and data-intensive applications. AMPs are
rapidly deployed as high-performance accelerators on
clusters. In these settings, scheduling, communication
and I/O are managed by general-purpose processors
(GPPs), while computation is off-loaded to AMPs. Design
space exploration for the configuration and software
stack of hybrid clusters of AMPs and GPPs is an open
problem. In this paper, we explore this design space in
an implementation of the popular MapReduce programming
model. Our contributions are: An exploration of various
design alternatives for hybrid asymmetric clusters of
AMPs and GPPs; the adoption of a streaming approach to
supporting MapReduce computations on clusters with
asymmetric components; and adaptive schedulers that
take into account individual component capabilities in
asymmetric clusters. Throughout our design, we remove
I/O bottlenecks, using double-buffering and
asynchronous I/O. We present an evaluation of the
design choices through experiments on a real cluster
with MapReduce workloads of varying degrees of
computation intensity. We find that in a cluster with
resource-constrained and well-provisioned AMP
accelerators, a streaming approach achieves 50.5\% and
73.1\% better performance compared to the non-streaming
approach, respectively, and scales almost linearly with
increasing number of compute nodes. We also show that
our dynamic scheduling mechanisms adapt effectively the
parameters of the scheduling policies between
applications with different computation density.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Strong:2009:FST,
author = "Richard Strong and Jayaram Mudigonda and Jeffrey C.
Mogul and Nathan Binkert and Dean Tullsen",
title = "Fast switching of threads between cores",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "35--45",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531801",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We address the software costs of switching threads
between cores in a multicore processor. Fast core
switching enables a variety of potential improvements,
such as thread migration for thermal management,
fine-grained load balancing, and exploiting asymmetric
multicores, where performance asymmetry creates
opportunities for more efficient resource utilization.
Successful exploitation of these opportunities demands
low core-switching costs. We describe our
implementation of core switching in the Linux kernel,
as well as software changes that can decrease switching
costs. We use detailed simulations to evaluate several
alternative implementations. We also explore how some
simple architectural variations can reduce switching
costs. We evaluate system efficiency using both real
(but symmetric) hardware, and simulated asymmetric
hardware, using both microbenchmarks and realistic
applications.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bratanov:2009:VMW,
author = "Stanislav Bratanov and Roman Belenov and Nikita
Manovich",
title = "Virtual machines: a whole new world for performance
analysis",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "46--55",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531802",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This article addresses a problem of performance
monitoring inside virtual machines (VMs). It advocates
focused monitoring of particular virtualized programs,
explains the need for and the importance of such an
approach to performance monitoring in virtualized
execution environments, and emphasizes its benefits for
virtual machine manufacturers, virtual machine users
(mostly, software developers) and hardware (processor)
manufacturers. The article defines the problem of in-VM
performance monitoring as the ability to employ modern
methods and hardware performance monitoring
capabilities inside virtual machines to an extent
comparable with what is being done in real
environments. Unfortunately, there are numerous reasons
preventing us from achieving such an ambitious goal,
one of those reasons being the lack of support from
virtualization engines; that is why a novel method of
'cooperative' performance data collection is disclosed.
The method implies collection of performance data at
physical hardware and simultaneous tracking of software
states inside a virtual machine. Each statistically
visible execution point of the virtualized software may
then be associated with information on real hardware
events. The method effectively enables time-based
sampling of virtualized workloads combined with
hardware event counting, is applicable to unmodified,
commercially available virtual machines, and has
competitive precision and overhead. The practical
significance and value of the method are further
illustrated by studying a parallel workload and
uncovering virtualization-specific performance issues
of multithreaded programs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "hardware performance event counters; virtual
machines",
}
@Article{Azimi:2009:EOS,
author = "Reza Azimi and David K. Tam and Livio Soares and
Michael Stumm",
title = "Enhancing operating system support for multicore
processors by using hardware performance monitoring",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "56--65",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531803",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Multicore processors contain new hardware
characteristics that are different from previous
generation single-core systems or traditional SMP
(symmetric multiprocessing) multiprocessor systems.
These new characteristics provide new performance
opportunities and challenges. In this paper, we show
how hardware performance monitors can be used to
provide a fine-grained, closely-coupled feedback loop
to dynamic optimizations done by a multicore-aware
operating system. These multicore optimizations are
possible due to the advanced capabilities of hardware
performance monitoring units currently found in
commodity processors, such as execution pipeline stall
breakdown and data address sampling. We demonstrate
three case studies on how a multicore-aware operating
system can use these online capabilities for (1)
determining cache partition sizes, which helps reduce
contention in the shared cache among applications, (2)
detecting memory regions with bad cache usage, which
helps in isolating these regions to reduce cache
pollution, and (3) detecting sharing among threads,
which helps in clustering threads to improve locality.
Using realistic applications from standard benchmark
suites, the following performance improvements were
achieved: (1) up to 27\% improvement in IPC
(instructions-per-cycle) due to cache partition sizing;
(2) up to 10\% reduction in cache miss rates due to
reduced cache pollution, resulting in up to 7\%
improvement in IPC; and (3) up to 70\% reduction in
remote cache accesses due to thread clustering,
resulting in up to 7\% application-level improvement.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shelepov:2009:HSH,
author = "Daniel Shelepov and Alexandra Fedorova and Sergey
Blagodurov and Juan Carlos Saez Alcaide and Nestor
Perez and Viren Kumar and Stacey Jeffery and Zhi Feng
Huang",
title = "{HASS}: a scheduler for heterogeneous multicore
systems",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "66--75",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531804",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Future heterogeneous single-ISA multicore processors
will have an edge in potential performance per watt
over comparable homogeneous processors. To fully tap
into that potential, the OS scheduler needs to be
heterogeneity-aware, so it can match jobs to cores
according to characteristics of both. We propose a
Heterogeneity-Aware Signature-Supported scheduling
algorithm that does the matching using per-thread
architectural signatures, which are compact summaries
of threads' architectural properties collected offline.
The resulting algorithm does not rely on dynamic
profiling, and is comparatively simple and scalable. We
implemented HASS in OpenSolaris, and achieved average
workload speedups of up to 13\%, matching best static
assignment, achievable only by an oracle. We have also
implemented a dynamic IPC-driven algorithm proposed
earlier that relies on online profiling. We found that
the complexity, load imbalance and associated
performance degradation resulting from dynamic
profiling are significant challenges to using this
algorithm successfully. As a result it failed to
deliver expected performance gains and to outperform
HASS.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "architectural signatures; asymmetric; heterogeneous;
multicore; scheduling",
}
@Article{Wentzlaff:2009:FOS,
author = "David Wentzlaff and Anant Agarwal",
title = "Factored operating systems (fos): the case for a
scalable operating system for multicores",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "76--85",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531805",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The next decade will afford us computer chips with
100's to 1,000's of cores on a single piece of silicon.
Contemporary operating systems have been designed to
operate on a single core or small number of cores and
hence are not well suited to manage and provide
operating system services at such large scale. If
multicore trends continue, the number of cores that an
operating system will be managing will continue to
double every 18 months. The traditional evolutionary
approach of redesigning OS subsystems when there is
insufficient parallelism will cease to work because the
rate of increasing parallelism will far outpace the
rate at which OS designers will be capable of
redesigning subsystems. The fundamental design of
operating systems and operating system data structures
must be rethought to put scalability as the prime
design constraint. This work begins by documenting the
scalability problems of contemporary operating systems.
These studies are used to motivate the design of a
factored operating system (fos). fos is a new operating
system targeting manycore systems with scalability as
the primary design constraint, where space sharing
replaces time sharing to increase scalability. We
describe fos, which is built in a message passing
manner, out of a collection of Internet inspired
services. Each operating system service is factored
into a set of communicating servers which in aggregate
implement a system service. These servers are designed
much in the way that distributed Internet services are
designed, but instead of providing high level Internet
services, these servers provide traditional kernel
services and replace traditional kernel data structures
in a factored, spatially distributed manner. fos
replaces time sharing with space sharing. In other
words, fos's servers are bound to distinct processing
cores and by doing so do not fight with end user
applications for implicit resources such as TLBs and
caches. We describe how fos's design is well suited to
attack the scalability challenge of future multicores
and discuss how traditional application-operating
systems interfaces can be redesigned to improve
scalability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "factored operating system; multicore operating
systems",
}
@Article{Moreto:2009:FQF,
author = "Miquel Moreto and Francisco J. Cazorla and Alex
Ramirez and Rizos Sakellariou and Mateo Valero",
title = "{FlexDCP}: a {QoS} framework for {CMP} architectures",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "86--96",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531806",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Current multicore architectures offer high throughput
by increasing hardware resource utilization. As the
number of cores in a multicore system increases,
providing Quality of Service (QoS) to applications in
addition to throughput is becoming an important
problem.\par
In this work, we present FlexDCP, a framework that
allows the Operating System (OS) to guarantee a QoS for
each application running in a chip multiprocessor.
FlexDCP directly estimates the performance of
applications for different cache configurations instead
of using indirect measures of performance like the
number of misses. This information allows the OS to
convert QoS requirements into resource assignments.
Consequently, it offers more flexibility to the OS as
it can optimize different QoS metrics like
per-application performance or global performance
metrics such as fairness, weighted speed up or
throughput.\par
Our results show that FlexDCP is able to force
applications in a workload to run at a certain
percentage of their maximum performance in 94\% of the
cases considered, being on average 1:48\% under the
objective for remaining cases. When optimizing a global
QoS metric like fairness, FlexDCP consistently
outperforms traditional eviction policies like LRU,
pseudo LRU and previous dynamic cache partitioning
proposals for two-, four- and eight-core
configurations. In an eight-core architecture FlexDCP
obtains a fairness improvement of 10:1\% over Fair, the
best policy in the literature optimizing fairness.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cache partitioning; multicore systems; operating
systems; performance predictability; quality of
service",
}
@Article{Karcher:2009:ATS,
author = "Thomas Karcher and Christoph Schaefer and Victor
Pankratius",
title = "Auto-tuning support for manycore applications:
perspectives for operating systems and compilers",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "96--97",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531808",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kunal:2009:HDS,
author = "K. Kunal and K. George and M. Gautam and V.
Kamakoti",
title = "{HTM} design spaces: complete decoupling from caches
and achieving highly concurrent transactions",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "98--99",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531809",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper proposes a Hardware Transactional Memory
(HTM) design for multi-core environments. Using a novel
technique to keep track of transactional read-write
entries, the design provides a holistic and scalable
solution to Transactional Memory (TM) implementation
issues of context switching, process migration and
overflow handling. Another aspect of the design is that
it allows transactions to run in a highly concurrent
manner by using special techniques to handle conflict
resolution, conflict detection and overflows. The
feasibility and validity of the proposed design are
demonstrated by developing a synthesizable Hardware
Description Language (HDL) model of the design and also
experimenting on the same with standard benchmarks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "context switching; hardware transactional memory;
multi-threaded cores; operating systems; overflow
handling; process migration",
}
@Article{Penry:2009:MDS,
author = "David A. Penry",
title = "Multicore diversity: a software developer's
nightmare",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "100--101",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531810",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Commodity microprocessors with tens to hundreds of
processor cores will require the widespread deployment
of parallel programs. This deployment will be hindered
by the architectural and environmental diversity
introduced by multicore processors. To overcome
diversity, the operating system must change its
interactions with the program runtime and parallel
runtime systems must be developed that can
automatically adapt programs to the architecture and
usage environment.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "multicore; multicore diversity; packaging; parallel
adaptation; runtime parallel optimization",
}
@Article{Woo:2009:PGO,
author = "Dong Hyuk Woo and Hsien-Hsin S. Lee",
title = "{PROPHET}: goal-oriented provisioning for highly
tunable multicore processors in cloud computing",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "102--103",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531811",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this article, we propose PROPHET, a goal-oriented
provisioning infrastructure based on execution history
profile gathered from the cloud of distributed
heterogeneous computing environment. It can
autonomously tune the efficiency of a data center or
satisfy the end-users' need when running network-based
applications. With more tunable features provided by
future multicore and many-core processors, we envision
that PROPHET can be easily integrated into today's
network infrastructure to provide value-added service
to many of us.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "heterogeneous environment; multicore; provisioning",
}
@Article{Nellans:2009:EMC,
author = "David Nellans and Rajeev Balasubramonian and Erik
Brunvand",
title = "{OS} execution on multi-cores: is out-sourcing
worthwhile?",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "104--105",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531812",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Large-scale multi-core chips open up the possibility
of implementing heterogeneous cores on a single chip,
where some cores can be customized to execute common
code patterns. The operating system is an example of a
common code pattern that is constantly executing on
every processor. It is therefore a prime candidate for
core customization. Recent work has begun to explore
this possibility, where some fraction of system calls
and other OS functionality is off-loaded to a separate
special-purpose core. Studies have shown that this can
improve overall system performance and power
consumption. However, our explorations in this arena
reveal that the primary benefits of off-loading can be
captured with alternative mechanisms that eliminate the
negative effects of off-loading. This position paper
articulates this alternative mechanism with initial
results that demonstrate promise.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mogul:2009:WWO,
author = "Jeffrey C. Mogul",
title = "{WOWCS}: the {Workshop on Organizing Workshops,
Conferences, and Symposia for Computer Systems}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "106--107",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531814",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:2009:CRC,
author = "Thomas Anderson",
title = "Conference reviewing considered harmful",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "108--116",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531815",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper develops a model of computer systems
research to help prospective authors understand the
often obscure workings of conference program
committees. We present data to show that the
variability between reviewers is often the dominant
factor as to whether a paper is accepted. We argue that
paper merit is likely to be Zipf distributed, making it
inherently difficult for program committees to
distinguish between most papers. We use game theory to
show that with noisy reviews and Zipf merit, authors
have an incentive to submit papers too early and too
often. These factors make conference reviewing, and
systems research as a whole, less efficient and less
effective. We describe some recent changes in
conference design to address these issues, and we
suggest some further potential improvements.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Douceur:2009:PRV,
author = "John R. Douceur",
title = "Paper rating vs. paper ranking",
journal = j-OPER-SYS-REV,
volume = "43",
number = "2",
pages = "117--121",
month = apr,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1531793.1531816",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 23 19:43:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Within the computer-science community, submitted
conference papers are typically evaluated by means of
rating, in two respects: First, individual reviewers
are asked to provide their evaluations of papers by
assigning a rating to each paper's overall quality.
Second, program committees collectively rate each paper
as being either worthy or unworthy of acceptance,
according to the aggregate judgment of the committee
members. This paper proposes an alternative approach to
these two processes, based on rankings rather than
ratings. It also presents experiences from employing
rankings in PC discussions of a major CS conference.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "paper ranking; paper rating; program committee
process",
}
@Article{Kliot:2009:LFC,
author = "Gabriel Kliot and Erez Petrank and Bjarne
Steensgaard",
title = "A lock-free, concurrent, and incremental stack
scanning mechanism for garbage collectors",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "3--13",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618527",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Two major efficiency parameters for garbage collectors
are the throughput overheads and the pause times that
they introduce. Highly responsive systems need to use
collectors with as short as possible pause times. Pause
times have decreased significantly over the years,
especially through the use of concurrent garbage
collectors. For modern concurrent collectors, the
longest pause is typically created by the need to
atomically scan the runtime stack. All practical
concurrent collectors that we are aware of must obtain
a snapshot of the pointers on each thread's runtime
stack, in order to reclaim objects correctly. To
further reduce the duration of the collector pauses,
incremental stack scans were proposed. However,
previous such methods employ locks to stop the mutator
from accessing a stack frame while it is being scanned.
Thus, these methods introduce potentially long and
unpredictable pauses for a mutator thread. In this work
we propose the first concurrent, incremental, and
lock-free stack scanning mechanism for garbage
collectors, that allows high responsiveness and support
for programs that employ fine-grain synchronization to
avoid locks. Our solution can be employed by all
concurrent collectors that we are aware of, it is
lock-free, it imposes a negligible overhead on the
program execution, and it supports intra-stack
references as found in languages like C\#.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "incremental and concurrent garbage collection;
lock-free data structures; stack scanning",
}
@Article{Hines:2009:PCL,
author = "Michael R. Hines and Umesh Deshpande and Kartik
Gopalan",
title = "Post-copy live migration of virtual machines",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "14--26",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618528",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present the design, implementation, and evaluation
of post-copy based live migration for virtual machines
(VMs) across a Gigabit LAN. Post-copy migration defers
the transfer of a VM's memory contents until after its
processor state has been sent to the target host. This
deferral is in contrast to the traditional pre-copy
approach, which first copies the memory state over
multiple iterations followed by a final transfer of the
processor state. The post-copy strategy can provide a
'win-win' by reducing total migration time while
maintaining the liveness of the VM during migration. We
compare post-copy extensively against the traditional
pre-copy approach on the Xen Hypervisor. Using a range
of VM workloads we show that post-copy improves several
metrics including pages transferred, total migration
time, and network overhead. We facilitate the use of
post-copy with adaptive prepaging techniques to
minimize the number of page faults across the network.
We propose different prepaging strategies and
quantitatively compare their effectiveness in reducing
network-bound page faults. Finally, we eliminate the
transfer of free memory pages in both pre-copy and
post-copy through a dynamic self-ballooning (DSB)
mechanism. DSB periodically reclaims free pages from a
VM and significantly speeds up migration with
negligible performance impact on VM workload.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "operating systems; post-copy; process migration;
virtual machines; Xen",
}
@Article{Wood:2009:MBE,
author = "Timothy Wood and Gabriel Tarasuk-Levin and Prashant
Shenoy and Peter Desnoyers and Emmanuel Cecchet and
Mark D. Corner",
title = "Memory buddies: exploiting page sharing for smart
colocation in virtualized data centers",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "27--36",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618529",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many data center virtualization solutions, such as
VMware ESX, employ content-based page sharing to
consolidate the resources of multiple servers. Page
sharing identifies virtual machine memory pages with
identical content and consolidates them into a single
shared page. This technique, implemented at the host
level, applies only between VMs placed on a given
physical host. In a multiserver data center,
opportunities for sharing may be lost because the VMs
holding identical pages are resident on different
hosts. In order to obtain the full benefit of
content-based page sharing it is necessary to place
virtual machines such that VMs with similar memory
content are located on the same hosts.\par
In this paper we present Memory Buddies, a memory
sharing aware placement system for virtual machines.
This system includes a memory fingerprinting system to
efficiently determine the sharing potential among a set
of VMs, and compute more efficient placements. In
addition it makes use of live migration to optimize VM
placement as workloads change. We have implemented a
prototype Memory Buddies system with VMware ESX Server
and present experimental results on our testbed, as
well as an analysis of an extensive memory trace study.
Evaluation of our prototype using a mix of enterprise
and e-commerce applications demonstrates an increase of
data center capacity (i.e. number of VMs supported) of
17\%, while imposing low overhead and scaling to as
many as a thousand servers.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "consolidation; page sharing; virtualization",
}
@Article{Zhao:2009:DMB,
author = "Weiming Zhao and Zhenlin Wang and Yingwei Luo",
title = "Dynamic memory balancing for virtual machines",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "37--47",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618530",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualization essentially enables multiple operating
systems and applications to run on one physical
computer by multiplexing hardware resources. A key
motivation for applying virtualization is to improve
hardware resource utilization while maintaining
reasonable quality of service. However, such a goal
cannot be achieved without efficient resource
management. Though most physical resources, such as
processor cores and I/O devices, are shared among
virtual machines using time slicing and can be
scheduled flexibly based on priority, allocating an
appropriate amount of main memory to virtual machines
is more challenging. Different applications have
different memory requirements. Even a single
application shows varied working set sizes during its
execution. An optimal memory management strategy under
a virtualized environment thus needs to dynamically
adjust memory allocation for each virtual machine,
which further requires a prediction model that
forecasts its host physical memory needs on the fly.
This paper introduces MEmory Balancer (MEB) which
dynamically monitors the memory usage of each virtual
machine, accurately predicts its memory needs, and
periodically reallocates host memory. MEB uses two
effective memory predictors which, respectively,
estimate the amount of memory available for reclaiming
without a notable performance drop, and additional
memory required for reducing the virtual machine paging
penalty. Our experimental results show that our
prediction schemes yield high accuracy and low
overhead. Furthermore, the overall system throughput
can be significantly improved with MEB.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "LRU histogram; memory balancing; virtual machine",
}
@Article{Shen:2009:SHP,
author = "Xipeng Shen and Feng Mao and Kai Tian and Eddy Zheng
Zhang",
title = "The study and handling of program inputs in the
selection of garbage collectors",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "48--61",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618531",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many studies have shown that the best performer among
a set of garbage collectors tends to be different for
different applications. Researchers have proposed
application-specific selection of garbage
collectors. In this work, we concentrate on a second
dimension of the problem: the influence of program
inputs on the selection of garbage collectors. We
collect tens to hundreds of inputs for a set of Java
benchmarks, and measure their performance on Jikes RVM
with different heap sizes and garbage collectors. A
rigorous statistical analysis produces four-fold
insights. First, inputs influence the relative
performance of garbage collectors significantly,
causing large variations to the top set of garbage
collectors across inputs. Profiling one or few runs is
thus inadequate for selecting the garbage collector
that works well for most inputs. Second, when the heap
size ratio is fixed, one or two types of garbage
collectors are enough to stimulate the top performance
of the program on all inputs. Third, for some programs,
the heap size ratio significantly affects the relative
performance of different types of garbage
collectors. For the selection of garbage collectors on
those programs, it is necessary to have a cross-input
predictive model that predicts the minimum possible
heap size of the execution on an arbitrary
input. Finally, by adopting statistical learning
techniques, we investigate the cross-input
predictability of the influence. Experimental results
demonstrate that with regression and classification
techniques, it is possible to predict the best garbage
collector (along with the minimum possible heap size)
with reasonable accuracy given an arbitrary input to an
application. The exploration opens the opportunities
for tailoring the selection of garbage collectors to
not only applications but also their inputs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cross-input program analysis; input-specific
selection; minimum possible heap size; profiling;
selection of garbage collectors",
}
@Article{Chen:2009:CLC,
author = "Huacai Chen and Hai Jin and Zhiyuan Shao and Kan Hu
and Ke Yu and Kun Tian",
title = "{ClientVisor}: leverage {COTS OS} functionalities for
power management in virtualized desktop environment",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "62--71",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618532",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As an emerging trend, virtualization is more and more
widely used in today's computing world. But, the
introduction of virtual machines bring trouble for the
{\em power management\/} (PM for short), since the
operating system can not directly access and control
the hardware as before. Solutions were proposed to
manage the power in the server consolidation case.
However, such solutions are VMM-centric: the VMM
gathers the PM decisions of the guests as hints, and
makes the final decision to manipulate the hardware.
These solutions do not fit well for the virtualized
desktop environment, which is highly interactive with
the users.\par
In this paper, we propose a novel solution, called
ClientVisor, to manage the power in the virtualized
desktop environment. The key idea of our scheme is to
leverage the functionalities of the {\em
Commercial-Off-The-Shelf\/} (COTS) operating system,
which actually interacts with the user, to manage the
power of the processor and the peripheral devices in
all possible cases. VMM coordinates the PM decisions of
the guests only at the key points. By prototype
implementation and experiments, we find our scheme
results in 22\% lower power consumption in the static
power usage scenario, and about 8\% lower in the
dynamic scenario than the corresponding cases of Xen.
Moreover, the experimental data shows that the
deployment of our scheme will not deteriorate the user
experience.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "client virtualization; power management; virtual
machine",
}
@Article{Dowty:2009:GVV,
author = "Micah Dowty and Jeremy Sugerman",
title = "{GPU} virtualization on {VMware}'s hosted {I/O}
architecture",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "73--82",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618534",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modern graphics co-processors (GPUs) can produce high
fidelity images several orders of magnitude faster than
general purpose CPUs, and this performance expectation
is rapidly becoming ubiquitous in personal computers.
Despite this, GPU virtualization is a nascent field of
research. This paper introduces a taxonomy of
strategies for GPU virtualization and describes in
detail the specific GPU virtualization architecture
developed for VMware's hosted products (VMware
Workstation and VMware Fusion).\par
We analyze the performance of our GPU virtualization
with a combination of applications and microbenchmarks.
We also compare against software rendering, the GPU
virtualization in Parallels Desktop 3.0, and the native
GPU. We find that taking advantage of hardware
acceleration significantly closes the gap between pure
emulation and native, but that different
implementations and host graphics stacks show distinct
variation. The microbenchmarks show that our
architecture amplifies the overheads in the traditional
graphics API bottlenecks: draw calls, downloading
buffers, and batch sizes.\par
Our virtual GPU architecture runs modern
graphics-intensive games and applications at
interactive frame rates while preserving virtual
machine portability. The applications we tested achieve
from 86\% to 12\% of native rates and 43 to 18 frames
per second with VMware Fusion 2.0.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "GPU; I/O virtualization; virtual device",
}
@Article{Xia:2009:IVP,
author = "Lei Xia and Jack Lange and Peter Dinda and Chang
Bae",
title = "Investigating virtual passthrough {I/O} on commodity
devices",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "83--94",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618535",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A commodity I/O device has no support for
virtualization. A VMM can assign such a device to a
single guest with direct, fast, but insecure access by
the guest's native device driver. Alternatively, the
VMMcan build virtual devices on top of the physical
device, allowing it to be multiplexed across VMs, but
with lower performance. We propose a technique that
provides an intermediate option. In virtual passthrough
I/O (VPIO), the guest interacts directly with the
physical device most of the time, achieving high
performance, as in passthrough I/O. Additionally, the
guest/device interactions drive a model that in turn
identifies (1) when the physical device can be handed
off to another VM, and (2) if the guest programs the
device to behave illegitimately. In this paper, we
describe the VPIO model, and present preliminary
results in using it to support two commodity network
cards within the Palacios VMM we are building. We
believe that an appropriate model for an I/O device
could be produced by the hardware vendor as part of the
design, implementation, and testing process.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kadav:2009:LMD,
author = "Asim Kadav and Michael M. Swift",
title = "Live migration of direct-access devices",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "95--104",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618536",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtual machine migration greatly aids management by
allowing flexible provisioning of resources and
decommissioning of hardware for maintenance. However,
efforts to improve network performance by granting
virtual machines direct access to hardware currently
prevent migration. This occurs because (1) the VMM
cannot migrate the state of the device, and (2) the
source and destination machines may have different
network devices, requiring different drivers to run in
the migrated virtual machine.\par
In this paper, we describe a lightweight software
mechanism for migrating virtual machines with direct
hardware access. We base our solution on shadow
drivers, an agent in the guest OS kernel that
efficiently captures and restores the state of a device
driver. On the source machine, the shadow driver
monitors the state of the driver and device. After
migration, the shadow driver uses this information to
configure a driver for the corresponding device on the
destination machine. We implement shadow driver
migration for Linux network drivers running on the Xen
hypervisor. Shadow driver migration requires a
migration downtime similar to the driver initialization
time, short enough to avoid disrupting active TCP
connections. We find that the performance overhead,
compared to direct hardware access, is negligible and
is much lower than using a virtual NIC.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kumar:2009:TBP,
author = "Viren Kumar and Alexandra Fedorova",
title = "Towards better performance per watt in virtual
environments on asymmetric single-{ISA} multi-core
systems",
journal = j-OPER-SYS-REV,
volume = "43",
number = "3",
pages = "105--109",
month = jul,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1618525.1618538",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 22 12:51:49 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Single-ISA heterogeneous multicore architectures
promise to deliver plenty of cores with varying
complexity, speed and performance in the near future.
Virtualization enables multiple operating systems to
run concurrently as distinct, independent guest
domains, thereby reducing core idle time and maximizing
throughput. This paper seeks to identify a heuristic
that can aid in intelligently scheduling these
virtualized workloads to maximize performance while
reducing power consumption.\par
We propose that the controlling domain in a Virtual
MachineMonitor or hypervisor is relatively insensitive
to changes in core frequency, and thus scheduling it on
a slower core saves power while only slightly affecting
guest domain performance. We test and validate our
hypothesis and further propose a metric, the Combined
Usage of a domain, to assist in future energy-efficient
scheduling. Our preliminary findings show that the
Combined Usage metric can be used as a starting point
to gauge the sensitivity of a guest domain to
variations in the controlling domain's frequency.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "performance-asymmetric multicore architectures;
performance per watt; virtualization",
}
@Article{Weatherspoon:2009:SAS,
author = "Hakim Weatherspoon and Doug Terry and Gregory
Chockler",
title = "Summary of the {3rd ACM SIGOPS Workshop on Large-Scale
Distributed Systems and Middleware (LADIS 2009)}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "3--4",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ciortea:2009:CST,
author = "Liviu Ciortea and Cristian Zamfir and Stefan Bucur and
Vitaly Chipounov and George Candea",
title = "{Cloud9}: a software testing service",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "5--10",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muniswamy-Reddy:2009:PFC,
author = "Kiran-Kumar Muniswamy-Reddy and Margo Seltzer",
title = "Provenance as first class cloud data",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "11--16",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Loo:2009:IWN,
author = "Boon Thau Loo and Stefan Saroiu",
title = "{5th International Workshop on Networking Meets
Databases (NetDB 2009)}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "17--18",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mao:2009:DDN,
author = "Yun Mao",
title = "On the declarativity of declarative networking",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "19--24",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Alvaro:2009:DDC,
author = "Peter Alvaro and Tyson Condie and Neil Conway and
Joseph M. Hellerstein and Russell Sears",
title = "{I} do declare: consensus in a logic language",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "25--30",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eide:2009:PFW,
author = "Eric Eide and Gilles Muller and Olaf Spinczyk",
title = "{PLOS 2009: Fifth Workshop on Programming Languages
and Operating Systems}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "31--34",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dagand:2009:FFP,
author = "Pierre-Evariste Dagand and Andrew Baumann and Timothy
Roscoe",
title = "{Filet-o-fish}: practical and dependable
domain-specific languages for {OS} development",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "35--39",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Princehouse:2009:CPG,
author = "Lonnie Princehouse and Ken Birman",
title = "Code-partitioning gossip",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "40--44",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barnes:2009:CPO,
author = "Frederick R. M. Barnes and Carl G. Ritson",
title = "Checking process-oriented operating system behaviour
using {CSP} and refinement",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "45--49",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dabbous:2009:ORW,
author = "Walid Dabbous and Maximilian Ott",
title = "Overview of the {ROADS'09} workshop",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "50--53",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rakotoarivelo:2009:OCM,
author = "Thierry Rakotoarivelo and Maximilian Ott and Guillaume
Jourjon and Ivan Seskar",
title = "{OMF}: a control and management framework for
networking testbeds",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "54--59",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lacage:2009:NUI,
author = "Mathieu Lacage and Martin Ferrari and Mads Hansen and
Thierry Turletti and Walid Dabbous",
title = "{NEPI}: using independent simulators, emulators, and
testbeds for easy experimentation",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "60--65",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Knezevic:2009:TCE,
author = "Nikola Kne{\v{z}}evi{\'c} and Simon Schubert and Dejan
Kosti{\'c}",
title = "Towards a cost-effective networking testbed",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "66--71",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Parikh:2009:NWN,
author = "Tapan Parikh and Vivek Pai",
title = "{NSDR 2009 3rd Workshop on Networked Systems for
Developing Regions}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "72--72",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Paik:2009:SLC,
author = "Michael Paik and Lakshminarayanan Subramanian",
title = "{Signet}: low-cost auditable transactions using {SIMs}
and mobile phones",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "73--78",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lober:2009:DIL,
author = "William B. Lober and Stephen Wagner and Christina
Quiles",
title = "Development and implementation of a loosely coupled,
multi-site, networked and replicated electronic medical
record in {Haiti}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "79--83",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ledlie:2009:CTB,
author = "Jonathan Ledlie and Billy Odero and Einat Minkov and
Imre Kiss and Joseph Polifroni",
title = "Crowd translator: on building localized speech
recognizers through micropayments",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "84--89",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mickens:2009:SDW,
author = "James Mickens and Dilma da Silva",
title = "{SOSP} diversity workshop",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "90--91",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ousterhout:2009:CRS,
author = "John Ousterhout and Parag Agrawal and David Erickson
and Christos Kozyrakis and Jacob Leverich and David
Mazi{\`e}res and Subhasish Mitra and Aravind Narayanan
and Guru Parulkar and Mendel Rosenblum and Stephen
M. Rumble and Eric Stratmann and Ryan Stutsman",
title = "The case for {RAMClouds}: scalable high-performance
storage entirely in {DRAM}",
journal = j-OPER-SYS-REV,
volume = "43",
number = "4",
pages = "92--105",
month = dec,
year = "2009",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 15 18:20:28 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Matthews:2010:WPO,
author = "Jeanna Neefe Matthews",
title = "Workshop proceedings and other publications in {\em
{Operating System Review\/}}",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "1--1",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740391",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In the last few years, Operating System Review has
published the full proceedings or best papers of
workshops on a variety of operating systems related
topics including storage, gossip-based networking, I/O
virtualization and more. Most recently, we have been
highlighting the nine workshops co-located with SOSP09.
If you are organizing a systems related workshop, we
would like to encourage you to consider publishing a
summary of the event and a collection of its best
papers in OSR. This gives the full SIGOPS community an
opportunity to taste the work being done in its many
focused sub-communities and gives workshop authors a
good venue for publishing their work.\par
For new workshops, it can be great way to spread the
word to potential attendees. For more established
workshops, OSR can help you develop a regular
publication strategy based on factors such as how often
the workshop occurs, how many total papers/pages of
material are produced, the number of attendees, the
acceptance rate for papers, etc. In some cases, OSR
itself may be able to publish the entire proceedings
for your workshop and if not, we can help you explore
alternatives for publishing all the papers including
working with ACM to have the full proceedings placed in
the ACM digital library.\par
There are some advantages to discussing publication in
OSR before the call for participation is released.
Specifically, ACM is working on some new policies
regarding the collection of permission or copyright
forms for workshop papers. If the call for
participation specifically mentions that papers will be
published in OSR, then it may be possible to avoid
collecting permission or copyright forms.\par
In addition to workshop papers, we would like to remind
everyone of the opportunity to publish other types of
work in OSR. OSR regularly publishes special topics
issues that are not organized around a particular
workshop or event. Most recently, in April 2009,
Mohamed Zahran and Kim Hazelwood put together a great
issue on the interaction of operating systems and
multicore chips. Organizing a special topics issue is a
chance to focus the community{\~A}\={\^A}$3/4${\^A}'s
attention on a particular topic of interest and
assemble a single body of work exploring the topic in
more depth. Individual submissions on a wide variety of
operating system related topics are also accepted.
Papers are reviewed by our individual submission
committee, which is chaired by John Chandy (University
of Connecticut). We would especially like to encourage
polemics that explore points of disagreement in the
community, results of repeated research, memorials or
historical accounts, novel approaches to systems
education, works-in-progress and 'the case for' papers.
The review cycle for individual submissions is
currently around 2 months and if accepted, publication
is scheduled in the next issue of OSR.\par
We also regularly publish issues focused on systems
work in industry. Recently, there has been one such
issue per year --- 'Systems Work at Microsoft Research'
organized by Mike Schroeder in 2007, 'Systems Work at
IBM Research' organized by Dilma Da Silva and Robert
Wisniewski in 2008 and 'Computer Systems Research at HP
Labs' organized by Jay Wylie and Jeff Mogul in 2009.
This year, David Belson and Erik Nygren from Akamai are
organizing a collection of papers in the July issue and
Steve Herrod, Ben Verghese, Julia Austin, Orran Krieger
and Sharon Weber from VMware are organizing an issue in
December. Michael Kaminsky, and Scott Hahn are
organizing an issue on the systems work at Intel for
2011. We welcome suggestions for other industrial
issues. We thank everyone who has contributed to OSR!
We look forward to your submissions, suggestions for
special topics issues, comments, and continued help in
developing OSR into a great resource for the SIGOPS
community.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Strauss:2010:DTN,
author = "Jacob Strauss and Chris Lesniewski-Laas and Justin
Mazzola Paluska and Bryan Ford and Robert Morris and
Frans Kaashoek",
title = "Device transparency: a new model for mobile storage",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "5--9",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740393",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper proposes a new storage model, {\em device
transparency}, in which users view and manage their
entire data collection from any of their devices, even
from disconnected storage-limited devices holding only
a subset of the entire collection.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Al-Kiswany:2010:CVS,
author = "Samer Al-Kiswany and Abdullah Gharaibeh and Matei
Ripeanu",
title = "The case for a versatile storage system",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "10--14",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740394",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Storage systems in emerging large-scale (a.k.a.
peta-scale) computing systems often introduce a
performance or scalability bottleneck. To deal with
these limitations we propose a new operational
approach: versatile storage, an application-optimized
and highly configurable storage system that harnesses
node-local resources, is configured and deployed at
application deployment time, and has a lifetime
dependent on the application lifetime. Our prototype
evaluation, using synthetic and application-level
benchmarks, on a small cluster as well as on a 96K
processor machine, provides evidence that the versatile
storage approach can bring valuable benefits to large
scale deployments in terms of storage system
performance and scalability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "dynamic deployment; high performance storage; storage
system specialization; versatile storage system",
}
@Article{Keeton:2010:LFV,
author = "Kimberly Keeton and Charles B. {Morrey III} and Craig
A. N. Soules and Alistair Veitch",
title = "{LazyBase}: freshness vs. performance in information
management",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "15--19",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740395",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Information management applications exhibit a wide
range of query performance and result freshness goals.
Some applications, such as web search, require
interactive performance, but may safely operate on
stale data. Others, such as policy violation detection,
require up-to-date results, but can tolerate relaxed
performance goals. Furthermore, information processing
applications must be able to ingest updates at the
scale of an entire organization. In this paper, we
present LazyBase, a system that allows users to trade
off query performance and result freshness in order to
satisfy the full range of users' goals. LazyBase breaks
up data ingestion into a pipeline of operations to
minimize ingest time and uses models of processing and
query performance to execute user queries. Initial
results with LazyBase illustrate the feasibility of the
pipelined model, highlight a rich space of trade-offs
between result freshness and query performance, and
often outperform existing solutions in the space.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Boutcher:2010:DVM,
author = "David Boutcher and Abhishek Chandra",
title = "Does virtualization make disk scheduling pass{\'e}?",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "20--24",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740396",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We examine whether traditional disk I/O scheduling
still provides benefits in a layered system consisting
of virtualized operating systems and underlying virtual
machine monitor. We demonstrate that choosing the
appropriate scheduling algorithm in guest operating
systems provides performance benefits, while scheduling
in the virtual machine monitor has no measurable
advantage. We propose future areas for investigation,
including schedulers optimized for running in a virtual
machine, for running in a virtual machine monitor, and
layered schedulers optimizing both application level
access and the underlying storage technology.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sundararaman:2010:WPI,
author = "Swaminathan Sundararaman and Sriram Subramanian and
Abhishek Rajimwale and Andrea C. Arpaci-Dusseau and
Remzi H. Arpaci-Dusseau and Michael M. Swift",
title = "Why panic()?: improving reliability with restartable
file systems",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "25--29",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740397",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The file system is one of the most critical components
of the operating system. Almost all applications
running in the operating system require file systems to
be available for their proper operation. Though
file-system availability is critical in many cases,
very little work has been done on tolerating file
system crashes. In this paper, we propose Membrane, a
set of changes to the operating system to support
restartable file systems. Membrane allows an operating
system to tolerate a broad class of file system
failures and does so while remaining transparent to
running applications; upon failure, the file system
restarts, its state is restored, and pending
application requests are serviced as if no failure had
occurred. Our initial evaluation of Membrane with ext2
shows that Membrane induces little performance overhead
and can tolerate a wide range of file system crashes.
More critically, Membrane does so with few changes to
ext2, thus improving robustness to crashes without
mandating intrusive changes to existing filesystem
code.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ghanbari:2010:SDQ,
author = "Saeed Ghanbari and Gokul Soundararajan and Cristiana
Amza",
title = "{SelfTalk} for {Dena}: query language and runtime
support for evaluating system behavior",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "30--34",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740398",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We introduce SelfTalk, a novel declarative language
that allows users to query and understand the status of
a large scale system. SelfTalk is sufficiently
expressive to encode an administrator's high level
hypotheses/expectations about normal system behavior,
such as, 'I expect that the throughputs across all
system components are linearly correlated'. SelfTalk
works in conjunction with Dena, a runtime support
system designed to help system administrators detect
the root cause of system misbehavior quickly and
accurately. Given a user hypothesis, Dena instantiates
and validates it using actual monitored data within
specific system contexts. We evaluate Dena by posing
several hypotheses about system behavior and querying
Dena to diagnose anomalies in a virtual storage system.
We find that Dena can automatically validate the system
performance based on the user hypotheses and also
accurately diagnose system misbehavior.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guerra:2010:EPS,
author = "Jorge Guerra and Wendy Belluomini and Joseph Glider
and Karan Gupta and Himabindu Pucha",
title = "Energy proportionality for storage: impact and
feasibility",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "35--39",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740399",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper highlights the growing importance of
storage energy consumption in a typical data center,
and asserts that storage energy research should drive
towards a vision of energy proportionality for
achieving significant energy savings. Our analysis of
real-world enterprise workloads shows a potential
energy reduction of 40-75\% using an ideally
proportional system. We then present a preliminary
analysis of appropriate techniques to achieve
proportionality, chosen to match both application
requirements and workload characteristics. Based on the
techniques we have identified, we believe that energy
proportionality is achievable in storage systems at a
time scale that will make sense in real world
environments.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Anderson:2010:EM,
author = "Eric Anderson and Joseph Tucek",
title = "Efficiency matters!",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "40--45",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740400",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Current data intensive scalable computing (DISC)
systems, although scalable, achieve embarrassingly low
rates of processing per node. We feel that current DISC
systems have repeated a mistake of old high-performance
systems: focusing on scalability without considering
efficiency. This poor efficiency comes with issues in
reliability, energy, and cost. As the gap between
theoretical performance and what is actually achieved
has become glaringly large, we feel there is a pressing
need to rethink the design of future data intensive
computing and carefully consider the direction of
future research.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stanton:2010:FAD,
author = "Paul T. Stanton and Benjamin McKeown and Randal Burns
and Giuseppe Ateniese",
title = "{FastAD}: an authenticated directory for billions of
objects",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "45--49",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740401",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We develop techniques that make authenticated
directories efficient and scalable toward the goal of
managing tens of billions of objects in a single
directory. Internet storage services have already
realized this scale: Amazon's S3 contained more than 52
billion objects as of April 2009 [1]. Our contributions
include defining on-disk, block-oriented data
structures and algorithms for authenticated directories
that exceed memory capacity and optimizations that
reduce the I/O required to insert and access entries in
the directory.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Desnoyers:2010:EEN,
author = "Peter Desnoyers",
title = "Empirical evaluation of {NAND} flash memory
performance",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "50--54",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740402",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Reports of NAND ash device testing in the literature
have for the most part been limited to examination of
circuit-level parameters on raw ash chips or
prototypes, and system-level parameters on entire
storage subsystems. However, there has been little
examination of system-level parameters of raw devices,
such as mean latency and endurance values. We report
the results of such tests on a variety of devices.
Read, program, and erase latency were found to align
closely with manufacturer's specified `typical' values
in almost all cases. Program\slash erase endurance,
however, was found to exceed specified minimum values,
often by as much as a factor of 100. In addition
significant performance changes were found with wear.
These changes may be used to track wear, and in
addition have significant implications for system
performance over the lifespan of a device. Finally,
random write patterns which incur performance penalties
on current ash-based memory systems were found to incur
no overhead on the devices themselves.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kadav:2010:DRR,
author = "Asim Kadav and Mahesh Balakrishnan and Vijayan
Prabhakaran and Dahlia Malkhi",
title = "Differential {RAID}: rethinking {RAID} for {SSD}
reliability",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "55--59",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740403",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Deployment of SSDs in enterprise settings is limited
by the low erase cycles available on commodity devices.
Redundancy solutions such as RAID can potentially be
used to protect against the high Bit Error Rate (BER)
of aging SSDs. Unfortunately, such solutions wear out
redundant devices at similar rates, inducing correlated
failures as arrays age in unison. We present Diff-RAID,
a new RAID variant that distributes parity unevenly
across SSDs to create age disparities within arrays. By
doing so, Diff-RAID balances the high BER of old SSDs
against the low BER of young SSDs. Diff-RAID provides
much greater reliability for SSDs compared to RAID-4
and RAID-5 for the same space overhead, and offers a
trade-off curve between throughput and reliability.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Leverich:2010:EEH,
author = "Jacob Leverich and Christos Kozyrakis",
title = "On the energy (in)efficiency of {Hadoop} clusters",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "61--65",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740405",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Distributed processing frameworks, such as Yahoo!'s
Hadoop and Google's MapReduce, have been successful at
harnessing expansive datacenter resources for
large-scale data analysis. However, their effect on
datacenter energy efficiency has not been scrutinized.
Moreover, the filesystem component of these frameworks
effectively precludes scale-down of clusters deploying
these frameworks (i.e. operating at reduced capacity).
This paper presents our early work on modifying Hadoop
to allow scale-down of operational clusters. We find
that running Hadoop clusters in fractional
configurations can save between 9\% and 50\% of energy
consumption, and that there is a tradeoff between
performance energy consumption. We also outline further
research into the energy-efficiency of these
frameworks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kansal:2010:SLC,
author = "Aman Kansal and Jie Liu and Abhishek Singh and Ripal
Nathuji and Tarek Abdelzaher",
title = "Semantic-less coordination of power management and
application performance",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "66--70",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740406",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A computer system often has multiple power management
modules controlling different power
knobs. Uncoordinated operation of these knobs not only
leads to suboptimal operation but may also cause unsafe
behaviors. Coordination methods have thus been proposed
to jointly control the power knobs and
performance. However, in many systems, such joint
design is not feasible due to lack of visibility into
all modules to be coordinated. This occurs, for
instance, in commodity software that runs on multiple
platforms, and emerging cloud hosted applications that
operate on platforms outside developers' control and
alongside unknown other workloads. We propose an
approach for semantics-free coordination where
power-performance management can be performed within
each module without semantic knowledge regarding other
modules.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Szalay:2010:LPA,
author = "Alexander S. Szalay and Gordon C. Bell and H. Howie
Huang and Andreas Terzis and Alainna White",
title = "Low-power {Amdahl}-balanced blades for data intensive
computing",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "71--75",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740407",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Enterprise and scientific data sets double every year,
forcing similar growths in storage size and power
consumption. As a consequence, current system
architectures used to build data warehouses are about
to hit a power consumption wall. In this paper we
propose an alternative architecture comprising large
number of so-called Amdahl blades that combine
energy-efficient CPUs with solid state disks to
increase sequential read I/O throughput by an order of
magnitude while keeping power consumption constant. We
also show that while keeping the total cost of
ownership constant, Amdahl blades offer five times the
throughput of a state-of-the-art computing cluster for
data-intensive applications. Finally, using the scaling
laws originally postulated by Amdahl, we show that
systems for data-intensive computing must maintain a
balance between low power consumption and per-server
throughput to optimize performance per Watt.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "data-intensive science; solid state disks",
}
@Article{Chun:2010:ECH,
author = "Byung-Gon Chun and Gianluca Iannaccone and Giuseppe
Iannaccone and Randy Katz and Gunho Lee and Luca
Niccolini",
title = "An energy case for hybrid datacenters",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "76--80",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740408",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Reducing energy consumption in datacenters is key to
building low cost datacenters. To address this
challenge, we explore the potential of hybrid
datacenter designs that mix low power platforms with
high performance ones. We show how these designs can
handle diverse workloads with different service level
agreements in an energy efficient fashion. We evaluate
the feasibility of our approach through experiments and
then discuss the design challenges and options of
hybrid datacenters.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhu:2010:ILS,
author = "Kenny Q. Zhu and Kathleen Fisher and David Walker",
title = "Incremental learning of system log formats",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "85--90",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740410",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "System logs come in a large and evolving variety of
formats, many of which are semi-structured and/or
non-standard. As a consequence, off-the-shelf tools for
processing such logs often do not exist, forcing
analysts to develop their own tools, which is costly
and time-consuming. In this paper, we present an
incremental algorithm that automatically infers the
format of system log files. From the resulting format
descriptions, we can generate a suite of data
processing tools automatically. The system can handle
large-scale data sources whose formats evolve over
time. Furthermore, it allows analysts to modify
inferred descriptions as desired and incorporates those
changes in future revisions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "ad hoc data; analysis of system logs; domain-specific
languages; grammar induction; PADS; parsing; tool
generation",
}
@Article{Lou:2010:MDD,
author = "Jian-Guang Lou and Qiang Fu and Yi Wang and Jiang
Li",
title = "Mining dependency in distributed systems through
unstructured logs analysis",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "91--96",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740411",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Dependencies among system components are crucial to
locating root errors in a distributed system. In this
paper, we propose an approach to mine intercomponent
dependencies from unstructured logs. The technique
requires neither additional system instrumentation nor
any application specific knowledge. In the approach, we
first parse each log message into its log key and
parameters. Then, we find dependent log key pairs
belong to different components by leveraging
co-occurrence analysis and parameter correspondence.
After that, we use Bayesian decision theory to estimate
the dependency direction of each dependent log key
pair. We further apply time delay consistency to remove
false positive detections. Case studies on Hadoop show
that the technique successfully identifies the
dependencies among the distributed system components.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cooccurrence analysis; dependency graph; log analysis;
root error localization",
}
@Article{DePauw:2010:VAT,
author = "Wim {De Pauw} and Stephen Heisig",
title = "Visual and algorithmic tooling for system trace
analysis: a case study",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "97--102",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740412",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Despite advances in the application of automated
statistical and machine learning techniques to system
log and trace data there will always be a need for
human analysis of machine traces, because trace
information on unstable systems may be incomplete, or
incorrect. In addition, false positives from automated
analysis will not likely disappear, and remediation
measures and candidate fix tests will need to be
evaluated. We present Zinsight, a visual and analytic
tool that supports performance analysts and debugging,
using large event traces to understand complex systems.
This tool enables analysts to quickly create and
manipulate high-level structural representations linked
with statistical analysis derived from the underlying
event trace data. The original raw trace is annotated
with module names and a domain specific database is
incorporated to relate software functions to module
names. Navigable sequence context graph views present
automatically extracted execution flow patterns from
arbitrarily definable sets of events and are linked to
frequency, distribution, and response time views. The
goal is to reduce the cognitive and computational load
on the analyst while providing answers to the most
natural questions in a problem determination session.
We present a case study of the tool in use on field
problems from the recently shipped (late 2008) IBM z10
mainframe. As a result of the industry trend toward
higher parallelism and memory latency, many issues were
encountered with legacy code. The tool was applied
successfully to diagnose these problems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "pattern extraction; problem determination; trace
analysis; visualization",
}
@Article{deGois:2010:OPD,
author = "Lourival A. de Gois and Walter C. da Borelli",
title = "Optimization of procedures for discovery and
information of idle resources in distributed systems",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "103--109",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740414",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper proposes strategies for identification and
information of idle resources in a distributed
environment with centralized management. The presented
approaches make it possible to obtain load indexes free
from transient variations on the allocation of
resources. This is possible through the use of
exponential moving averages to process temporal series
of data. The knowledge of trends of resource
utilization was fundamental for the elaboration of an
information algorithm, used by the owners of the
resources to inform about their availability to the
environment manager. Experimental results confirm the
efficiency of the proposed model to reduce the number
of load indexes transmitted and consequently, to obtain
a significant decrease of network traffic and of the
amount of transactions processed by the manager.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "discovery and information of idle resources; moving
averages; resources trends",
}
@Article{Cansado:2010:CFD,
author = "Jacinto C. A. Cansado and Jo{\~a}o H. S. Pereira and
Edson T. Midorikawa",
title = "Considering the frequency dimension into on demand
adaptive algorithms",
journal = j-OPER-SYS-REV,
volume = "44",
number = "1",
pages = "110--115",
month = jan,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1740390.1740415",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Mar 17 14:10:48 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Efficient memory usage in high performance timesharing
computing systems is a considerable challenge. Some
research areas on adaptive algorithms concerning memory
page replacement, analyze the memory access behavior
seeking to store the pages that will be used in a near
future and discarding the others. This is important due
to the high cost of treating page faults. The proposal
is to analyze the influence of page access frequency on
adaptive algorithms, using its structure and applying
page replacement with access frequency analysis, as a
function of its execution state. The comparative
performance analysis is conducted by using trace files
that represent different memory access behaviors.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "adaptive replacement algorithm; demand paging; page
access frequency; virtual memory",
}
@Article{Romano:2010:CTH,
author = "Paolo Romano and Luis Rodrigues and Nuno Carvalho and
Jo{\~a}o Cachopo",
title = "{Cloud-TM}: harnessing the cloud with distributed
transactional memories",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "1--6",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773914",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "One of the main challenges to harness the potential of
Cloud computing is the design of programming models
that simplify the development of large-scale parallel
applications and that allow ordinary programmers to
take full advantage of the computing power and the
storage provided by the Cloud, both of which made
available, on demand, in a pay-only-for-what-you-use
pricing model.\par
In this paper, we discuss the use of the Transactional
Memory programming model in the context of the cloud
computing paradigm, which we refer to as Cloud-TM. We
identify where existing Distributed Transactional
Memory platforms still fail to meet the requirements of
the cloud and of its users, and we point several open
research problems whose solution we deem as essential
to materialize the Cloud-TM vision.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ostrowski:2010:SAL,
author = "Krzysztof Ostrowski and Ken Birman",
title = "Storing and accessing live mashup content in the
cloud",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "7--11",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773915",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Today's {\em Rich Internet Application\/} (RIA)
technologies such as Ajax, Flex, or Silverlight, are
designed around the client-server paradigm and cannot
easily take advantage of replication,
publish-subscribe, or peer-to-peer mechanisms for
better scalability or responsiveness. This is
particularly true of storage: content is typically
persisted in data centers and consumed via web
services. We propose1 a {\em checkpointed channel\/}
(CC) abstraction as an alternative model for storing
and accessing content. CCs are architecture-agnostic:
they could be implemented as web services, but also as
replicated state machines running over peer-to-peer
multicast protocols. They can seamlessly span across
the data center boundaries, or live at the edge. They
are a more natural way of consuming streaming content.
CCs can store hierarchical documents with hyperlinks to
other CCs, thus forming a web of interconnected CCs: a
live scalable information space. We discuss the
advantages of the new abstraction, challenges it poses,
and the way it fits within the existing models for RIA
development.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "cloud computing; distributed storage; edge computing;
hyperlink; peer-to-peer; rich internet application;
scalability",
}
@Article{VanHensbergen:2010:UEM,
author = "Eric {Van Hensbergen} and Noah Paul Evans and Phillip
Stanley-Marbell",
title = "A unified execution model for cloud computing",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "12--17",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773916",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This article presents the design goals and
architecture for a unified execution model (UEM) for
cloud computing and clusters. The UEM combines
interfaces for logical provisioning and distributed
command execution with integrated mechanisms for
establishing and maintaining communication,
synchronization, and control. In this paper, the UEM
architecture is described, and an existing application
which could benefit from its facilities is used to
illustrate its value.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sripanidkulchai:2010:CRL,
author = "Kunwadee Sripanidkulchai and Sambit Sahu and Yaoping
Ruan and Anees Shaikh and Chitra Dorai",
title = "Are clouds ready for large distributed applications?",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "18--23",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773918",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud computing carries the promise of providing
powerful new models and abstractions that could
transform the way IT services are delivered today. In
order to establish the readiness of clouds to deliver
meaningful enterprise-class IT services, we identify
three key issues that ought to be addressed as first
priority from the perspective of potential cloud users:
how to deploy large-scale distributed services, how to
deliver high availability services, and how to perform
problem resolution on the cloud. We analyze multiple
sources of publicly available data to establish cloud
user expectations and compare against the current state
of cloud offerings, with a focus on contrasting the
different requirements from two classes of users -- the
individual and the enterprise. Through this process,
our initial findings indicate that while clouds are
ready to support usage scenarios for individual users,
there are still rich areas of future research to be
explored to enable clouds to support large distributed
applications such as those found in enterprise.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Siegenthaler:2010:CSC,
author = "Michael Siegenthaler and Hakim Weatherspoon",
title = "Cloudifying source code repositories: how much does it
cost?",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "24--28",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773919",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud computing provides us with general purpose
storage and server hosting platforms at a reasonable
price. We explore the possibility of tapping these
resources for the purpose of hosting source code
repositories for individual projects as well as entire
open source communities. An analysis of storage costs
is presented, and a complete hosting solution is built
and evaluated as a proof-of-concept.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Letia:2010:CCC,
author = "Mihai Letia and Nuno Pregui{\c{c}}a and Marc
Shapiro",
title = "Consistency without concurrency control in large,
dynamic systems",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "29--34",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773921",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Replicas of a commutative replicated data type (CRDT)
eventually converge without any complex concurrency
control. We validate the design of a non-trivial CRDT,
a replicated sequence, with performance measurements in
the context of Wikipedia. Furthermore, we discuss how
to eliminate a remaining scalability bottleneck:
Whereas garbage collection previously required a
system-wide consensus, here we propose a flexible
two-tier architecture and a protocol for migrating
between tiers. We also discuss how the CRDT concept can
be generalised, and its limitations.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lakshman:2010:CDS,
author = "Avinash Lakshman and Prashant Malik",
title = "{Cassandra}: a decentralized structured storage system",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "35--40",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773922",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cassandra is a distributed storage system for managing
very large amounts of structured data spread out across
many commodity servers, while providing highly
available service with no single point of failure.
Cassandra aims to run on top of an infrastructure of
hundreds of nodes (possibly spread across different
data centers). At this scale, small and large
components fail continuously. The way Cassandra manages
the persistent state in the face of these failures
drives the reliability and scalability of the software
systems relying on this service. While in many ways
Cassandra resembles a database and shares many design
and implementation strategies therewith, Cassandra does
not support a full relational data model; instead, it
provides clients with a simple data model that supports
dynamic control over data layout and format. Cassandra
system was designed to run on cheap commodity hardware
and handle high write throughput while not sacrificing
read efficiency.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Porter:2010:DSC,
author = "George Porter",
title = "Decoupling storage and computation in {Hadoop} with
{SuperDataNodes}",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "41--46",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773923",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The rise of ad-hoc data-intensive computing has led to
the development of data-parallel programming systems
such as Map/Reduce and Hadoop, which achieve
scalability by tightly coupling storage and
computation. This can be limiting when the ratio of
computation to storage is not known in advance, or
changes over time. In this work, we examine decoupling
storage and computation in Hadoop through
SuperDataNodes, which are servers that contain an order
of magnitude more disks than traditional Hadoop nodes.
We found that SuperDataNodes are not only capable of
supporting workloads with high storage-to-processing
workloads, but in some cases can outperform traditional
Hadoop deployments through better management of a large
centralized pool of disks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Goldszmidt:2010:TAP,
author = "Moises Goldszmidt and Mihai Budiu and Yue Zhang and
Michael Pechuk",
title = "Toward automatic policy refinement in repair services
for large distributed systems",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "47--51",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773925",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In order to be economically feasible and to offer high
levels of availability and performance, large scale
distributed systems depend on the automation of repair
services. While there has been considerable work on
mechanisms for such automated services, a framework for
evaluating and optimizing the policies governing such
mechanisms has been lacking. In this paper we propose
one such framework and report on our initial experience
in applying the framework to analyze and optimize the
operation a geo-distributed cloud storage system at
Microsoft.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Haeberlen:2010:CAC,
author = "Andreas Haeberlen",
title = "A case for the accountable cloud",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "52--57",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773926",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "For many companies, clouds are becoming an interesting
alternative to a dedicated IT infrastructure. However,
cloud computing also carries certain risks for both the
customer and the cloud provider. The customer places
his computation and data on machines he cannot directly
control; the provider agrees to run a service whose
details he does not know. If something goes wrong --- for
example, data leaks to a competitor, or the computation
returns incorrect results --- it can be difficult for
customer and provider to determine which of them has
caused the problem, and, in the absence of solid
evidence, it is nearly impossible for them to hold each
other responsible for the problem if a dispute
arises.\par
In this paper, we propose that the cloud should be made
accountable to both the customer and the provider. Both
parties should be able to check whether the cloud is
running the service as agreed. If a problem appears,
they should be able to determine which of them is
responsible, and to prove the presence of the problem
to a third party, such as an arbitrator or a judge. We
outline the technical requirements for an accountable
cloud, and we describe several challenges that are not
yet met by current accountability techniques.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ezhilchelvan:2010:LPR,
author = "Paul Ezhilchelvan and Santosh Shrivastava",
title = "Learning from the past for resolving dilemmas of
asynchrony",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "58--63",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773927",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents two design approaches to avoid
many complications introduced at both user and
developer levels by the FLP impossibility. The first
approach is appropriate in managed hosting
environments, such as datacenters, and involves
offering service guarantees with tunable success
probabilities and remedial actions in the unlikely
scenarios. The second is appropriate in open
environments and advocates building fail-signal
abstractions for hosting application-level
replication.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bortnikov:2010:BBS,
author = "Vita Bortnikov and Gregory Chockler and Alexey Roytman
and Mike Spreitzer",
title = "Bulletin board: a scalable and robust eventually
consistent shared memory over a peer-to-peer overlay",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "64--70",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773929",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present the design and early experience with a
completely new implementation of the Bulletin Board, a
topic-based distributed shared memory service employed
by commercial-grade application middleware, to achieve
robustness and administrative simplicity with adequate
latency and costs at the required throughput and scale.
To facilitate scalability, only weak consistency is
provided. For robustness and ease of use, the
implementation is designed in a fully peer-to-peer
fashion leveraging the weakly consistent group
communication services provided by a semi-structured
overlay network. We discuss issues in providing good
(while not perfect) stability and reliability at
tolerable cost. We address scalability issues, such as
supporting large numbers of processes, large
subscription spaces, and complex interest patterns. We
also consider comprehensive API instrumentation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vigfusson:2010:OIF,
author = "Ymir Vigfusson and Ken Birman and Qi Huang and Deepak
P. Nataraj",
title = "Optimizing information flow in the gossip objects
platform",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "71--76",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773930",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Gossip-based protocols are commonly used for diffusing
information in large-scale distributed applications. GO
(Gossip Objects) is a per-node gossip platform that we
developed in support of this class of protocols. GO
allows nodes to join multiple gossip groups without
losing the appealing fixed bandwidth guarantee of
gossip protocols, and the platform also optimizes
latency in a principled manner. Our algorithm is based
on the observations that multiple rumors can often be
squeezed into a single IP packet, and that indirect
routing of rumors can speed up delivery. We formalize
these observations and develop a theoretical analysis
of this algorithm. We have also implemented GO, and
studied the effectiveness of the algorithm by comparing
it to the more standard random dissemination gossip
strategy.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "epidemic broadcast; gossip; multicast",
}
@Article{Fournier:2010:ABD,
author = "Pierre-Marc Fournier and Michel R. Dagenais",
title = "Analyzing blocking to debug performance problems on
multi-core systems",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "77--87",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773932",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Multi-core systems are rapidly becoming more
prevalent. Consequently, developers frequently face
performance bugs caused by unexpected interactions
between parallel software components. The location of
these bugs is difficult to identify with current tools.
Indeed, the process exhibiting the slowness may be
separated from the root cause of the problem by a
blocking chain involving several other
processes.\par
This article introduces a new approach for analyzing
blocking on multi-core systems and reports on its
implementation in the LTTV Delay Analyzer. It enables
developers to quickly understand the dependencies among
processes and see how the total elapsed time is divided
into its main components. The LTTV Delay Analyzer was
used to analyze and rapidly correct complex performance
problems, something not possible with the existing
tools. The Linux Trace Toolkit, LTTng, is used for most
of the instrumentation and the trace recording,
allowing the tracing of production systems with great
accuracy and minimal impact. This approach uses solely
kernel instrumentation and does not require the
instrumentation or recompilation of processes. The
analysis time is linear with respect to trace size.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dalton:2010:TP,
author = "Michael Dalton and Hari Kannan and Christos
Kozyrakis",
title = "Tainting is not pointless",
journal = j-OPER-SYS-REV,
volume = "44",
number = "2",
pages = "88--92",
month = apr,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1773912.1773933",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Apr 22 16:07:36 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Pointer tainting is a form of Dynamic Information Flow
Tracking used primarily to prevent software security
attacks such as buffer overflows. Researchers have also
applied pointer tainting to malware and virus
analysis.\par
A recent paper by Slowinska and Bos has criticized
pointer tainting as a security mechanism, arguing that
it is has serious, inherent false positive and false
negative defects. We present a rebuttal that addresses
the confusion due to the two uses of pointer tainting
in security literature. We clarify that many of the
arguments against pointer tainting apply only to its
use as a malware and virus analysis platform, but do
not apply to the application of pointer tainting to
memory corruption protection. Hence, we argue that
pointer tainting remains a useful and promising
technique for robust protection against memory
corruption attacks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "buffer overflow; dynamic information flow tracking;
malware detection; memory corruption; pointer tainting;
software security; virus detection",
}
@Article{Nygren:2010:NSR,
author = "Erik Nygren and Ramesh K. Sitaraman and Joel Wein",
title = "Networked systems research at {Akamai}",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "1--1",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842735",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this special section of OSR, we present a selection
of research papers that relate to Akamai's platform and
technology.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "content delivery; distributed systems; network
architecture",
}
@Article{Nygren:2010:ANP,
author = "Erik Nygren and Ramesh K. Sitaraman and Jennifer
Sun",
title = "The {Akamai} network: a platform for high-performance
{Internet} applications",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "2--19",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842736",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Comprising more than 61,000 servers located across
nearly 1,000 networks in 70 countries worldwide, the
Akamai platform delivers hundreds of billions of
Internet interactions daily, helping thousands of
enterprises boost the performance and reliability of
their Internet applications. In this paper, we give an
overview of the components and capabilities of this
large-scale distributed computing platform, and offer
some insight into its architecture, design principles,
operation, and management.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Akamai; application acceleration; CDN; content
delivery; DNS; fault tolerance; HTTP; overlay networks;
quality of service; streaming media",
}
@Article{Repantis:2010:SMI,
author = "Thomas Repantis and Jeff Cohen and Scott Smith and
Joel Wein",
title = "Scaling a monitoring infrastructure for the {Akamai}
network",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "20--26",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842737",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We describe the design of, and experience with, Query,
a monitoring system that supports the Akamai
EdgePlatform. Query is a foundation of Akamai's
approach to administering its distributed computing
platform, allowing administrators, operations staff,
developers, customers, and automated systems near
real-time access to data about activity in Akamai's
network. Users extract information regarding the
current state of the network via a SQL-like interface.
Versions of Query have been deployed since the
inception of Akamai's platform, and it has scaled to
support a distributed platform of 60,000+ servers,
collecting over 200 gigabytes of data and answering
over 30,000 queries approximately every 2 minutes.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "distributed databases; distributed systems;
monitoring; scalability; stream processing",
}
@Article{Belson:2010:ASI,
author = "David Belson",
title = "{Akamai State of the Internet Report, Q4 2009}",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "27--37",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842738",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we review data gathered across Akamai's
global server network about attack traffic, Internet
and broadband penetration, and mobile connectivity, as
well as trends seen in this data over time.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Akamai; attacks; broadband; connectivity; internet;
mobile; security",
}
@Article{Bouchenak:2010:SIW,
author = "Sara Bouchenak and Eric Rutten",
title = "Summary of the {5th International Workshop on Feedback
Control Implementation and Design in Computing Systems
and Networks (FeBID 2010)}",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "38--40",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842740",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2010:OCU,
author = "Zhikui Wang and Niraj Tolia and Cullen Bash",
title = "Opportunities and challenges to unify workload, power,
and cooling management in data centers",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "41--46",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842741",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Independent optimization for workload and power
management, and active cooling control have been
studied extensively to improve data center energy
efficiency. Recently, proposals have started to
advocate unified workload, power, and cooling
management for further energy savings. In this paper,
we study this problem with the objectives of both
saving energy and capping power. We present the
detailed models derived in our previous work from
experiments on a blade enclosure system that can be
representative of a data center, discuss the
optimization opportunities for coordinated power and
cooling management, and the challenges for controller
design. We then propose a few design principles and
examples for unified workload management, power
minimization, and power capping. Our simulation-based
evaluation shows that the controllers can cap the total
power consumption while maintaining the thermal
conditions and improve the overall energy efficiency.
We argue that the same opportunities, challenges, and
designs are also generally applicable to data center
level management.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Arnaud:2010:ACI,
author = "Jean Arnaud",
title = "Automated control of {Internet} services",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "47--52",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842742",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Finding an efficient configuration for cluster-based
multi-tier Internet services is often a difficult task.
Moreover, even a good configuration could become
obsolete, depending on workload evolution. In this
paper, we address both problems by dynamically
calculating an optimal configuration for multi-tier
Internet services and applying this configuration to
the managed application. Our approach is based on two
main components. A model of the underlying application,
and a controller using this model to find the optimal
configuration according current environment and
performance objectives. We evaluate the model accuracy
and the controller efficiency. Experiments show that
our solution improves resource consumption, and may
lead to significant energy savings, besides matching
the performance objectives even with a dynamic
workload.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "availability; capacity planning; cost; modeling;
multi-tier applications; performance; SLA",
}
@Article{Alt:2010:CSH,
author = "Anne-Marie Alt and Daniel Simon",
title = "Control strategies for {H.264} video decoding under
resources constraints",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "53--58",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842743",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Automatic control appears to be an enabling technology
to handle both the performance dispersion in highly
integrated chips and computing power adaptability under
varying loads and energy storage constraints. This work
in progress paper presents a case study, where a video
decoder is controlled via quality loops and frequency
scaling, to meet end-users requirements mixing quality
and energy consumption related constraints.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "feedback scheduling; H.264 video decoder; QoS",
}
@Article{Malrait:2010:QOC,
author = "Luc Malrait",
title = "{QoS}-oriented control of server systems",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "59--64",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842744",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Multi-tier architectures are widely used by internet
applications. Guaranteeing the performance, and more
generally the quality of service (QoS), of such
applications remains a crucial issue. In this paper we
propose a methodology to get the optimal admission
control of multi-tier server systems under high loads
for one QoS objective. First we present a model of
multi-tier server systems using fluid approximations.
Second, we state and solve an optimization problem
which consists in finding the configuration that
maximizes the availability of the system for a given
performance constraint. Simulations of both model and
control from this preliminary work are presented. They
show that the optimal configuration of such systems is
not always intuitive.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dolev:2010:STR,
author = "Shlomi Dolev and Reuven Yagel",
title = "Stabilizing trust and reputation for self-stabilizing
efficient hosts in spite of {Byzantine} guests",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "65--74",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842746",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This work presents a general and complete method to
protect a system against possible malicious programs.
We provide concepts for building a system that can
automatically recover from an arbitrary state including
even one in which a Byzantine execution of one or more
programs repeatedly attempts to corrupt the system
state. Preservation of a guest execution is guaranteed
as long as the guest respects a predefined contract,
while efficiency is improved by using stabilizing
reputation. We augment a provable self-stabilizing host
operating system implementation with a
contract-enforcement framework example.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "Byzantine programs; host systems; security;
self-stabilization; trust and reputation",
}
@Article{Poirier:2010:AOS,
author = "Benjamin Poirier and Robert Roy and Michel Dagenais",
title = "Accurate offline synchronization of distributed traces
using kernel-level events",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "75--87",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842747",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Tracing has proven to be a valuable tool for
identifying functional and performance problems. In
order to use it on distributed nodes, the timestamps in
the traces need to be precisely synchronized. The
objective of this work is to improve synchronization of
traces recorded on distributed nodes. We aim for high
precision and low intrusiveness. In this paper, we
present an offline trace synchronization algorithm that
is directly applicable to pairs of nodes and that can
report approximate bounds on accuracy over short
tracing durations. We also present an efficient
implementation of this algorithm and an experimental
study of parameters that affect synchronization
accuracy.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "convex hull; events; kernel; offline synchronization;
synchronization; timestamp; time synchronization; trace
synchronization",
}
@Article{Slowinska:2010:PTS,
author = "Asia Slowinska and Herbert Bos",
title = "Pointer tainting still pointless: (but we all see the
point of tainting)",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "88--92",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842748",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McKenney:2010:WGM,
author = "Paul E. McKenney and Maged M. Michael and Josh
Triplett and Jonathan Walpole",
title = "Why the grass may not be greener on the other side: a
comparison of locking vs. transactional memory",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "93--101",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842749",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The advent of multi-core and multi-threaded processor
architectures highlights the need to address the
well-known shortcomings of the ubiquitous lock-based
synchronization mechanisms. To this end, transactional
memory has been viewed by many as a promising
alternative to locking. This paper therefore presents a
constructive critique of locking and transactional
memory: their strengths, weaknesses, and opportunities
for improvement.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Triplett:2010:SCH,
author = "Josh Triplett and Paul E. McKenney and Jonathan
Walpole",
title = "Scalable concurrent hash tables via relativistic
programming",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "102--109",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842750",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents a novel concurrent hash table
implementation which supports wait-free, near-linearly
scalable lookup, even in the presence of concurrent
modifications. In particular, this hash table
implementation supports concurrent moves of hash table
elements between buckets, for purposes such as
renames.\par
Implementation of this algorithm in the Linux kernel
demonstrates its performance and scalability.
Benchmarks on a 64-way POWER system showed a 6x
scalability improvement versus fine-grained locking,
and a 1.5x improvement versus the current state of the
art in Linux.\par
To achieve these scalability improvements, the hash
table implementation uses a new concurrent programming
technique known as {\em relativistic programming}. This
approach uses a copy-based update strategy to allow
readers and writers to run concurrently without
conflicts, avoiding many of the non-scalable costs of
synchronization, inter-processor communication, and
cache coherence. New techniques such as the proposed
hash-table move algorithm allow readers to tolerate the
resulting weak memory-ordering behavior that arises
from allowing one version of a structure to be read
concurrently with updates to a different version of the
same structure. Relativistic programming techniques
provide performance and scalability advantages over
traditional synchronization, as demonstrated through
several benchmarks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hu:2010:GBU,
author = "Wenjin Hu and Tao Yang and Jeanna N. Matthews",
title = "The good, the bad and the ugly of consumer cloud
storage",
journal = j-OPER-SYS-REV,
volume = "44",
number = "3",
pages = "110--115",
month = jul,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1842733.1842751",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 19 14:21:54 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Herrod:2010:SRD,
author = "Stephen Alan Herrod",
title = "Systems research and development at {VMware}",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "1--2",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899949",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Over the last twelve years, VMware has grown from a
small startup with an interesting idea to an 8000+
person company that is changing the landscape of the
datacenter and how IT happens in the enterprise. The
VMware story has been one of intense technological
innovation delivered consistently as a series of
products and releases. We will briefly look at the
history of innovation at VMware and how we have
balanced research, advanced development and product
delivery to set the context for the papers in this
issue",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Agesen:2010:EXV,
author = "Ole Agesen and Alex Garthwaite and Jeffrey Sheldon and
Pratap Subrahmanyam",
title = "The evolution of an x86 virtual machine monitor",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "3--18",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899930",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Twelve years have passed since VMware engineers first
virtualized the x86 architecture. This technological
breakthrough kicked off a transformation of an entire
industry, and virtualization is now (once again) a
thriving business with a wide range of solutions being
deployed, developed and proposed. But at the base of it
all, the fundamental quest is still the same: running
virtual machines as well as we possibly can on top of a
virtual machine monitor.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{West:2010:OCM,
author = "Richard West and Puneet Zaroo and Carl A. Waldspurger
and Xiao Zhang",
title = "Online cache modeling for commodity multicore
processors",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "19--29",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899931",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modern chip-level multiprocessors (CMPs) contain
multiple processor cores sharing a common last-level
cache, memory interconnects, and other hardware
resources. Workloads running on separate cores compete
for these resources, often resulting in highly-variable
performance. It is generally desirable to co-schedule
workloads that have minimal resource contention, in
order to improve both performance and fairness.
Unfortunately, commodity processors expose only limited
information about the state of shared resources such as
caches to the software responsible for scheduling
workloads that execute concurrently. To make informed
resource-management decisions, it is important to
obtain accurate measurements of per-workload cache
occupancies and their impact on performance, often
summarized by utility functions such as miss-ratio
curves (MRCs) In this paper, we first introduce an
efficient online technique for estimating the cache
occupancy of individual software threads using only
commonly-available hardware performance counters.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Scales:2010:DPS,
author = "Daniel J. Scales and Mike Nelson and Ganesh
Venkitachalam",
title = "The design of a practical system for fault-tolerant
virtual machines",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "30--39",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899932",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We have implemented a commercial enterprise-grade
system for providing fault-tolerant virtual machines,
based on the approach of replicating the execution of a
primary virtual machine (VM) via a backup virtual
machine on another server. We have designed a complete
system in VMware vSphere 4.0 that is easy to use, runs
on commodity servers, and typically reduces performance
of real applications by less than 10\%. In addition,
the data bandwidth needed to keep the primary and
secondary VM executing in lockstep is less than 20
Mbit/s for several real applications, which allows for
the possibility of implementing fault tolerance over
longer distances.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McDougall:2010:VPP,
author = "Richard McDougall and Jennifer Anderson",
title = "Virtualization performance: perspectives and
challenges ahead",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "40--56",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899933",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Performance is a central requirement to the
wide-spread adoption of virtualization. To deliver on
the promise of simplifying IT via virtualization, the
virtualization platform must provide excellent
performance with minimal effort. Virtualization
performance encompasses several different dimensions.
An application running in a virtual machine must
perform on-par with the same application natively.
Multiple virtual machines running on the same host must
scale well and share resources effectively. In this
paper we will describe how virtualization performance
at all of these levels has progressed with advances in
software and hardware.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vaghani:2010:VMF,
author = "Satyam B. Vaghani",
title = "Virtual machine file system",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "57--70",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899935",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Virtual Machine File System (VMFS) is a scalable
and high performance symmetric clustered file system
for hosting virtual machines (VMs) on shared block
storage. It implements a clustered locking protocol
exclusively using storage links, and does not require
network-based inter-node communication between hosts
participating in a VMFS cluster. VMFS layout and IO
algorithms are optimized towards providing raw device
speed IO throughput to VMs. An adaptive IO mechanism
masks errors on the physical fabric using contextual
information from the fabric. The VMFS lock service
forms the basis of VMware's clustered applications such
as vMotion, Storage vMotion, Distributed Resource
Scheduling, High Availability, and Fault Tolerance.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hansen:2010:SVM,
author = "Jacob Gorm Hansen and Eric Jul",
title = "Scalable virtual machine storage using local disks",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "71--79",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899936",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In virtualized data centers, storage systems have
traditionally been treated as black boxes administered
separately from the compute nodes. Direct-attached
storage is often left unused, to not have VM
availability depend on individual hosts. Our work aims
to integrate storage and compute, addressing the
fundamental limitations of contemporary centralized
storage solutions. We are building Lithium, a
distributed storage system designed specifically for
virtualization workloads running in large-scale data
centers and clouds. Lithium aims to be scalable, highly
available, and compatible with commodity hardware and
existing application software.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhou:2010:VN,
author = "Shudong Zhou",
title = "Virtual networking",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "80--85",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899938",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Over a decade ago, virtual networking started with a
simple bridging of VM's virtual network adapter to
host's physical network adapter in VMware's Workstation
product. With VMware's vSphere 4 product, virtual
networking has evolved to a distributed virtual
networking infrastructure with pluggable packet
switching and filtering modules, under the umbrella
marketing name of vNetwork. It is clear that in a
virtualized environment, traditional network access
layer has migrated from physical switches to virtual
switches in the hypervisor.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Basak:2010:VNS,
author = "Debashis Basak and Rohit Toshniwal and Serge Maskalik
and Allwyn Sequeira",
title = "Virtualizing networking and security in the cloud",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "86--94",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899939",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualization of computer workloads onto powerful x86
multicore platforms is leading to a massive
transformation in the way services are produced by next
generation data centers. Simultaneously, cloud
computing principles are compelling a rethink in the
way enterprises are beginning to consume such services.
In this paper, we present the need for network and
security (netsec) functions, which are currently
realized in hardware appliances, to significantly
evolve to keep pace with these new trends, and to
provide ``disruptively simplified'' security that was
not earlier possible With server consolidation and
desktop virtualization, significantly more traffic
remains within the data center racks, leading to blind
spots for ``in network'' security appliances.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Soundararajan:2010:CBS,
author = "Vijayaraghavan Soundararajan and Kinshuk Govil",
title = "Challenges in building scalable virtualized datacenter
management",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "95--102",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899941",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualization drives higher resource utilization and
makes provisioning new systems very easy and cheap.
This combination has led to an ever-increasing number
of virtual machines: the largest data centers will
likely have more than 100K in few years, and many
deployments will span multiple data centers. Virtual
machines are also getting increasingly more capable,
consisting of more vCPUs, more memory, and
higher-bandwidth virtual I/O devices with a variety of
capabilities like bandwidth throttling and traffic
mirroring To reduce the work for IT administrators
managing these environments, VMware and other companies
provide several monitoring, automation, and
policy-driven tools. These tools require a lot of
information about various aspects of each VM and other
objects in the system, such as physical hosts, storage
infrastructure, and networking.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Krieger:2010:EMC,
author = "Orran Krieger and Phil McGachey and Arkady Kanevsky",
title = "Enabling a marketplace of clouds: {VMware's} {vCloud}
director",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "103--114",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899942",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud computing promises to bring about a fundamental
shift in the computer industry where consumers of IT
enjoy on-demand access to massive compute capacity and
producers of IT benefit from economies of scale and
automation. We believe that the advantages of cloud
computing will be best realized if there is a highly
competitive marketplace. We describe our vision of a
marketplace of clouds, discuss what is needed to make
this vision a reality, and then describe what VMware is
doing to help enable this marketplace model of cloud
computing",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schmidt:2010:VSB,
author = "Ren{\'e} W. Schmidt and Steffen Grarup",
title = "{vApp}: a standards-based container for cloud
providers",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "115--123",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899943",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In the past decade, virtualization has swept through
the x86 server landscape and caused a dramatic change
in how enterprise datacenters are organized both from a
physical infrastructure level and an organizational
level. This has lead to a datacenter where all
resources and services are virtualized, paving the way
for a complete decoupling of the applications from the
physical infrastructure. This is known as cloud
computing or more specifically, Infrastructure as a
Service (IaaS). The decoupling of the application from
the deployment platform is a fundamental shift from
previous generations of datacenter infrastructure. To
utilize this decoupling, a well-defined interface
between the application and the cloud provider must
exist.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barr:2010:VMV,
author = "Ken Barr and Prashanth Bungale and Stephen Deasy and
Viktor Gyuris and Perry Hung and Craig Newell and
Harvey Tuch and Bruno Zoppis",
title = "The {VMware} mobile virtualization platform: is that a
hypervisor in your pocket?",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "124--135",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899945",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The virtualization of mobile devices such as
smartphones, tablets, netbooks, and MIDs offers
significant potential in addressing the mobile
manageability, security, cost, compliance, application
development and deployment challenges that exist in the
enterprise today. Advances in mobile processor
performance, memory and storage capacities have led to
the availability of many of the virtualization
techniques that have previously been applied in the
desktop and server domains. Leveraging these
opportunities, VMware's Mobile Virtualization Platform
(MVP) makes use of system virtualization to deliver an
end-to-end solution for facilitating employee-owned
mobile phones in the enterprise. In this paper we
describe the use case behind MVP, and provide an
overview of the hypervisor's design and
implementation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Simons:2010:VHP,
author = "Joshua E. Simons and Jeffrey Buell",
title = "Virtualizing high performance computing",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "136--145",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899946",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "While virtualization is widely used in commercial
enterprise environments, it has not to date played any
significant role in High Performance Computing (HPC).
However, with the rise of cloud computing and its
promise of computing on demand, the HPC community's
interest in virtualization (a key cloud enabler) is
increasing. Beyond cloud computing, virtualization
offers additional potential benefits for HPC, among
them reactive and proactive application fault
tolerance, secure and fault-isolated use of
shared-resource clusters, dynamic provisioning, job
migration, and support for heterogeneous HPC
facilities.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dumitras:2010:RSA,
author = "Tudor Dumitra{\c{s}} and Iulian Neamtiu and Eli
Tilevich",
title = "Report on the {Second ACM Workshop on Hot Topics in
Software Upgrades (HotSWUp'09)}",
journal = j-OPER-SYS-REV,
volume = "44",
number = "4",
pages = "146--152",
month = dec,
year = "2010",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1899928.1899948",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Dec 15 10:02:07 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "http://www.hotswup.org/2009/",
abstract = "The Second ACM SIGPLAN Workshop on Hot Topics in
Software Upgrades (HotSWUp'09) was held on 25 October
2009 in Orlando, FL. The workshop was co-located with
OOPSLA 2009 and was sponsored by ACM SIGPLAN. Twenty
researchers and practitioners, from the programming
languages, systems, software engineering and database
communities, attended HotSWUp'09. The goal of HotSWUp
is to identify, through interdisciplinary
collaboration, cutting-edge research ideas for
implementing software upgrades. The workshop combined
presentations of peer-reviewed research papers with
invited presentations from well-known experts and a
keynote speech on the practical issues related to
performing large-scale upgrades. The audience included
researchers and practitioners from academia, the
industry (Facebook, ABB, Oracle) and the open-source
community (AppUpdater).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rattner:2011:RI,
author = "Justin Rattner",
title = "Research at {Intel}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "1--2",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945025",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gupta:2011:ASP,
author = "Vishakha Gupta and Rob Knauerhase and Karsten
Schwan",
title = "Attaining system performance points: revisiting the
end-to-end argument in system design for heterogeneous
many-core systems",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "3--10",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945026",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Trends indicate a rapid increase in the number of
cores on chip, exhibiting various types of performance
and functional asymmetries present in hardware to gain
scalability with balanced power vs. performance
requirements. This poses new challenges in platform
resource management, which are further exacerbated by
the need for runtime power budgeting and by the
increased dynamics in workload behavior observed in
consolidated datacenter and cloud-computing systems.
This paper considers the implications of these
challenges for the virtualization layer of abstraction,
which is the base layer for resource management in such
heterogeneous multicore platforms. Specifically, while
existing and upcoming management methods routinely
leverage system-level information available to the
hypervisor about current and global platform state, we
argue that for future systems there will be an
increased necessity for additional information about
applications and their needs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chinya:2011:BDP,
author = "Gautham N. Chinya and Jamison D. Collins and Perry H.
Wang and Hong Jiang and Guei-Yuan Lueh and Thomas
A. Piazza and Hong Wang",
title = "{Bothnia}: a dual-personality extension to the {Intel}
integrated graphics driver",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "11--20",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945027",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we introduce Bothnia, an extension to
the Intel production graphics driver to support a
shared virtual memory heterogeneous multithreading
programming model. With Bothnia, the Intel graphics
device driver can support both the traditional 3D
graphics rendering software stack and a new class of
heterogeneous multithreaded applications, which can use
both IA (Intel Architecture) CPU cores and Intel
integrated Graphics and Media Accelerator (GMA) cores
in the same virtual address space. We describe the
necessary architectural supports in both IA CPU and the
GMA cores and present a reference Bothnia
implementation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reddy:2011:BFH,
author = "Dheeraj Reddy and David Koufaty and Paul Brett and
Scott Hahn",
title = "Bridging functional heterogeneity in multicore
architectures",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "21--33",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945028",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Heterogeneous processors that mix big high performance
cores with small low power cores promise excellent
single-threaded performance coupled with high
multi-threaded throughput and higher
performance-per-watt. A significant portion of the
commercial multicore heterogeneous processors are
likely to have a common instruction set architecture(
ISA). However, due to limited design resources and
goals, each core is likely to contain ISA extensions
not yet implemented in the other core. Therefore, such
heterogeneous processors will have inherent functional
asymmetry at the ISA level and face significant
software challenges. This paper analyzes the software
challenges to the operating system and the application
layer software on a heterogeneous system with
functional asymmetry, where the ISA of the small and
big cores overlaps.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vasudevan:2011:COE,
author = "Vijay Vasudevan and David G. Andersen and Michael
Kaminsky and Jason Franklin and Michael A. Kozuch and
Iulian Moraru and Padmanabhan Pillai and Lawrence Tan",
title = "Challenges and opportunities for efficient computing
with {FAWN}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "34--44",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945029",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents the architecture and motivation
for a cluster-based, many-core computing architecture
for energy-efficient, data-intensive computing. FAWN, a
Fast Array of Wimpy Nodes, consists of a large number
of slower but efficient nodes coupled with low-power
storage. We present the computing trends that motivate
a FAWN-like approach, for CPU, memory, and storage. We
follow with a set of microbenchmarks to explore under
what workloads these FAWN nodes perform well (or
perform poorly), and briefly examine scenarios in which
both code and algorithms may need to be re-designed or
optimized to perform well on an efficient platform.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mesnier:2011:DSS,
author = "Michael P. Mesnier and Jason B. Akers",
title = "Differentiated storage services",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "45--53",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945030",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This article presents a Differentiated Storage
Services architecture for file and storage systems. By
classifying data at the block-level, a filesystem can
request that different classes of data (e.g., file,
directory, executable, text) be handled with different
policies (e.g., low-latency versus high-bandwidth), and
it is left to the storage system to enforce these
policies. Our approach assumes that an I/O classifier
can be included in-band with each I/O request (e.g.,
using a field in the SCSI block command set) and that
the policy for each class can be specified out-of-band
through the management interface of the storage system.
We describe our prototypes based on Linux Ext3, Windows
NTFS, and hybrid storage systems composed of rotating
and solid-state disks.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Raghunath:2011:DDF,
author = "Arun Raghunath and John Keys and Mona Vij",
title = "Direct data flows",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "54--61",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945031",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Reducing power consumption of Mobile Internet Devices
(MID) and smartphones is critical as battery life is a
key feature for mobility. Most vendors use
System-On-Chip designs integrating more and more
fixed-function hardware modules in a bid to reduce
power consumption. On the other hand the explosion of
new applications has increased the demand for PC-like
processing capabilities on these devices. They are best
supported by general purpose CPUs and Operating Systems
which consume more power. Traditional system
architectures focus on a data transfer model with the
CPU as one of the endpoints. Consequently there are
numerous usage scenarios where the general purpose CPU
just acts as an intermediary between hardware modules,
transferring data from a hardware module to memory and
vice-versa.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Srinivasan:2011:EIB,
author = "Sadagopan Srinivasan and Li Zhao and Ramesh Illikkal
and Ravishankar Iyer",
title = "Efficient interaction between {OS} and architecture in
heterogeneous platforms",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "62--72",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945032",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Almost all hardware platforms to date have been
homogeneous with one or more identical processors
managed by the operating system (OS). However,
recently, it has been recognized that power constraints
and the need for domain-specific high performance
computing may lead architects towards building
heterogeneous architectures and platforms in the near
future. In this paper, we consider the three types of
heterogeneous core architectures: (a) Virtual
asymmetric cores: multiple processors that have
identical core micro-architectures and ISA but each
running at a different frequency point or perhaps
having a different cache size, (b) Physically
asymmetric cores: heterogeneous cores, each with a
fundamentally different microarchitecture (in-order
vs. ...) ...",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{vanderWijngaart:2011:LWC,
author = "Rob F. van der Wijngaart and Timothy G. Mattson and
Werner Haas",
title = "Light-weight communications on {Intel}'s single-chip
cloud computer processor",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "73--83",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945033",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many-core chips are changing the way high-performance
computing systems are built and programmed. As it is
becoming increasingly difficult to maintain cache
coherence across many cores, manufacturers are
exploring designs that do not feature any cache
coherence between cores. Communications on such chips
are naturally implemented using message passing, which
makes them resemble clusters, but with an important
difference. Special hardware can be provided that
supports very fast on-chip communications, reducing
latency and increasing bandwidth. We present one such
chip, the Single-Chip Cloud Computer (SCC). This is an
experimental processor, created by Intel Labs. We
describe two communication libraries available on SCC:
RCCE and Rckmb.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:2011:LBA,
author = "Shimin Chen and Phillip B. Gibbons and Michael Kozuch
and Todd C. Mowry",
title = "Log-based architectures: using multicore to help
software behave correctly",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "84--91",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945034",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "While application performance and power-efficiency are
both important, application correctness is even more
important. In other words, if the application is
misbehaving, it is little consolation that it is doing
so quickly or power-efficiently. In the Log-Based
Architectures (LBA) project, we are focusing on a
challenging source of application misbehavior: software
bugs, including obscure bugs that only cause problems
during security attacks. To help detect and fix
software bugs, we have been exploring techniques for
accelerating dynamic program monitoring tools, which we
call ``lifeguards''. Lifeguards are typically written
today using dynamic binary instrumentation frameworks
such as Valgrind or Pin. Due to the overheads of binary
instrumentation, lifeguards that require
instruction-grain information typically experience
30X--100X slow-downs, and hence it is only practical to
use them during explicit debug cycles.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yan:2011:OSV,
author = "Shoumeng Yan and Xiaocheng Zhou and Ying Gao and Hu
Chen and Gansha Wu and Sai Luo and Bratin Saha",
title = "Optimizing a shared virtual memory system for a
heterogeneous {CPU-accelerator} platform",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "92--100",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945035",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The client computing platform is moving towards a
heterogeneous architecture that combines
scalar-oriented CPU cores and throughput-oriented
accelerator cores. Recognizing that existing
programming models for such heterogeneous platforms are
still difficult for most programmers, we advocate a
shared virtual memory programming model to improve
programmability. In this paper, we focus on
performance, and demonstrate that users need not
sacrifice performance for programmability. We describe
our approaches, experiences, and results in optimizing
MYO on a heterogeneous platform consisting of a CPU and
an Aubrey Isle accelerator. Our efforts involve the
whole system software stack including the OS, runtime,
and application.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dong:2011:RNF,
author = "Yuan Dong and Haiyang Zhu and Jinzhan Peng and Fang
Wang and Michael P. Mesnier and Dawei Wang and Sun
C. Chan",
title = "{RFS}: a network file system for mobile devices and
the cloud",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "101--111",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945036",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Due to the increasing number of applications (and
their data) being placed on mobile devices, access to
dependable storage is becoming a key issue in mobile
system design -- and cloud storage is becoming an
attractive solution. However, this introduces a number
of new issues related to unpredictable wireless network
connectivity and data privacy over the network. In this
article we present RFS, a wireless-friendly network
file system for mobile devices and the cloud. RFS
provides device-aware cache management and
client-driven data security and privacy protection. We
implement the RFS client in the Linux kernel and the
RFS server with Amazon S3 cloud storage, and we employ
two new optimizations: server pre-push (a server-side
data pre-fetching mechanism) and client reintegration
(synchronizing a mobile device's cache with the
cloud).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fall:2011:REG,
author = "Kevin Fall and Gianluca Iannaccone and Maziar Manesh
and Sylvia Ratnasamy and Katerina Argyraki and Mihai
Dobrescu and Norbert Egi",
title = "{RouteBricks}: enabling general purpose network
infrastructure",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "112--125",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945037",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We revisit the problem of scaling software routers,
motivated by recent advances in server technology that
enable high-speed parallel processing a feature router
workloads appear ideally suited to exploit. We propose
a software router architecture that parallelizes router
functionality both across multiple servers and across
multiple cores within a single server. By carefully
exploiting parallelism at every opportunity, we
demonstrate a 40Gbps parallel router prototype; this
router capacity can be linearly scaled through the use
of additional servers. Our prototype router is fully
programmable using the familiar Click/Linux environment
and is built entirely from off-the-shelf,
general-purpose server hardware.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Maniatis:2011:STP,
author = "Petros Maniatis and Byung-Gon Chun",
title = "Small trusted primitives for dependable systems",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "126--141",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945038",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Secure, fault-tolerant distributed systems are
difficult to build, to validate, and to operate.
Conservative design for such systems dictates that
their security and fault tolerance depend on a very
small number of assumptions taken on faith; such
assumptions are typically called the ``trusted
computing base'' (TCB) of a system. However, a rich
trade-off exists between larger TCBs and more secure,
more fault-tolerant, or more efficient systems. In our
recent work, we have explored this trade-off by
defining ``small,'' generic trusted primitives--for
example, an attested, monotonically sequenced FIFO
buffer of a few hundred machine words guaranteed to
hold appended words until eviction and showing how such
primitives can improve the performance, fault
tolerance, and security of systems using them.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhu:2011:TPS,
author = "David (Yu) Zhu and Jaeyeon Jung and Dawn Song and
Tadayoshi Kohno and David Wetherall",
title = "{TaintEraser}: protecting sensitive data leaks using
application-level taint tracking",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "142--154",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945039",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present TaintEraser, a new tool that tracks the
movement of sensitive user data as it flows through
off-the-shelf applications. TaintEraser uses
application-level dynamic taint analysis to let users
run applications in their own environment while
preventing unwanted information exposure. It is made
possible by techniques we developed for accurate and
efficient tainting: (1) Semantic-aware
instruction-level tainting is critical to track taint
accurately, without explosion or loss. (2) Function
summaries provide an interface to handle taint
propagation within the kernel and reduce the overhead
of instruction-level tracking. (3) On-demand
instrumentation enables fast loading of large
applications. Together, these techniques let us analyze
large, multi-threaded, networked applications in near
real-time.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{daSilva:2011:VBW,
author = "Dilma da Silva and Luciano Barreto and Paulo C{\'e}sar
A. Pereira",
title = "{VII Brazilian Workshop on Operating Systems}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "155--155",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945041",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper reports on the VII Brazilian Workshop on
Operating Systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barreto:2011:ASF,
author = "Luciano Barreto and Aline Andrade and Adolfo Duran and
Caique Lima and Ademilson Lima",
title = "Abstract specification and formalization of an
operating system kernel in {Z}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "1",
pages = "156--160",
month = jan,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1945023.1945042",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 25 16:43:23 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "One of the mini challenges in software verification
related to the Grand Challenge proposed by Tony Hoare
concerns the formal specification and verification of
an operating system kernel. This paper proposes a
simple and correct specification of an OS kernel in Z
which simplifies the understanding and verification of
operating system components. Our current specification
comprises process management, interprocess
communication and a POSIX-compliant file system.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Krepska:2011:HPP,
author = "Elzbieta Krepska and Thilo Kielmann and Wan Fokkin and
Henri Bal",
title = "{HipG}: parallel processing of large-scale graphs",
journal = j-OPER-SYS-REV,
volume = "45",
number = "2",
pages = "3--13",
month = jul,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2007183.2007185",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 18 16:13:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Narang:2011:PDM,
author = "Ankur Narang and Abhinav Srivastava and Naga Praveen
Kumar Katta and Rudrapatna K. Shyamasundar",
title = "Performance driven multi-objective distributed
scheduling for parallel computations",
journal = j-OPER-SYS-REV,
volume = "45",
number = "2",
pages = "14--27",
month = jul,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2007183.2007186",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 18 16:13:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lubowich:2011:PDL,
author = "Yuval Lubowich and Gadi Taubenfeld",
title = "On the performance of distributed lock-based
synchronization?",
journal = j-OPER-SYS-REV,
volume = "45",
number = "2",
pages = "28--37",
month = jul,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2007183.2007187",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 18 16:13:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Azmandian:2011:VMM,
author = "Fatemeh Azmandian and Micha Moffie and Malak
Alshawabkeh and Jennifer Dy and Javed Aslam and David
Kaeli",
title = "Virtual machine monitor-based lightweight intrusion
detection",
journal = j-OPER-SYS-REV,
volume = "45",
number = "2",
pages = "38--53",
month = jul,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2007183.2007189",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 18 16:13:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schiper:2011:SMK,
author = "Andr{\'e} Schiper and Zarko Milosevic and Omid
Shahmirzadi",
title = "Student mini-kernel project based on an {FPGA} board",
journal = j-OPER-SYS-REV,
volume = "45",
number = "2",
pages = "54--58",
month = jul,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2007183.2007190",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 18 16:13:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eide:2011:SPS,
author = "Eric Eide and Gilles Muller and Wolfgang
Schr{\"o}der-Preikschat and Olaf Spinczyk",
title = "Summary of {PLOS 2011: the Sixth Workshop on
Programming Languages and Operating Systems}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "1--4",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094093",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This report summarizes the Sixth Workshop on
Programming Languages and Operating Systems (PLOS
2011), which was held in conjunction with the SOSP 2011
conference. It presents the motivation for the PLOS
workshop series and describes the contributions of the
PLOS 2011 event.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saha:2011:FRR,
author = "Suman Saha and Julia Lawall and Gilles Muller",
title = "Finding resource-release omission faults in {Linux}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "5--9",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094094",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The management of the releasing of allocated resources
is a continual problem in ensuring the robustness of
systems code. Missing resource-releasing operations
lead to memory leaks and deadlocks. A number of
approaches have been proposed to detect such problems,
but they often have a high rate of false positives, or
focus only on commonly used functions. In this paper we
observe that resource-releasing operations are often
found in error-handling code, and that the choice of
resource-releasing operation may depend on the context
in which it is to be used. We propose an approach to
finding resource-release omission faults in C code that
takes into account these issues.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tartler:2011:CCA,
author = "Reinhard Tartler and Daniel Lohmann and Christian
Dietrich and Christoph Egger and Julio Sincero",
title = "Configuration coverage in the analysis of large-scale
system software",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "10--14",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094095",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "System software, especially operating systems, tends
to be highly configurable. Like every complex piece of
software, a considerable amount of bugs in the
implementation has to be expected. In order to improve
the general code quality, tools for static analysis
provide means to check for source code defects without
having to run actual test cases on real hardware.
Still, for proper type checking a specific
configuration is required so that all header include
paths are available and all types are properly
resolved. In order to find as many bugs as possible,
usually a ``full configuration'' is used for the check.
However, mainly because of alternative blocks in form
of \#else-blocks, a single configuration is
insufficient to achieve full coverage.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gidra:2011:ASG,
author = "Lokesh Gidra and Ga{\"e}l Thomas and Julien Sopena and
Marc Shapiro",
title = "Assessing the scalability of garbage collectors on
many cores",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "15--19",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094096",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Managed Runtime Environments (MRE) are increasingly
used for application servers that use large multi-core
hardware. We find that the garbage collector is
critical for overall performance in this setting. We
explore the costs and scalability of the garbage
collectors on a contemporary 48-core multiprocessor
machine. We present experimental evaluation of the
parallel and concurrent garbage collectors present in
OpenJDK, a widely-used Java virtual machine. We show
that garbage collection represents a substantial amount
of an application's execution time, and does not scale
well as the number of cores increases. We attempt to
identify some critical scalability bottlenecks for
garbage collectors.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bodik:2011:OWM,
author = "Peter Bod{\'\i}k",
title = "Overview of the workshop on managing large-scale
systems via the analysis of system logs and the
application of machine learning techniques",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "20--22",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094098",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kavulya:2011:PEC,
author = "Soila P. Kavulya and Kaustubh Joshi and Matti Hiltunen
and Scott Daniels and Rajeev Gandhi and Priya
Narasimhan",
title = "Practical experiences with chronics discovery in large
telecommunications systems",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "23--30",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094099",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Chronics are recurrent problems that fly under the
radar of operations teams because they do not perturb
the system enough to set off alarms or violate
service-level objectives. The discovery and diagnosis
of never-before seen chronics poses new challenges as
they are not detected by traditional threshold-based
techniques, and many chronics can be present in a
system at once, all starting and ending at different
times. In this paper, we describe our experiences
diagnosing chronics using server logs on a large
telecommunications service. Our technique uses a
scalable Bayesian distribution learner coupled with an
information-theoretic measure of distance (KL
divergence), to identify the attributes that best
distinguish failed calls from successful calls.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Basu:2011:BDA,
author = "Sumit Basu and John Dunagan and Kevin Duh and
Kiran-Kumar Muniswamy-Reddy",
title = "{BLR-D}: applying bilinear logistic regression to
factored diagnosis problems",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "31--38",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094100",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we address a pattern of diagnosis
problems in which each of J entities produces the same
K features, yet we are only informed of overall faults
from the ensemble. Furthermore, we suspect that only
certain entities and certain features are leading to
the problem. The task, then, is to reliably identify
which entities and which features are at fault. Such
problems are particularly prevalent in the world of
computer systems, in which a datacenter with hundreds
of machines, each with the same performance counters,
occasionally produces overall faults. In this paper, we
present a means of using a constrained form of bilinear
logistic regression for diagnosis in such problems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Beschastnikh:2011:MTI,
author = "Ivan Beschastnikh and Yuriy Brun and Michael D. Ernst
and Arvind Krishnamurthy and Thomas E. Anderson",
title = "Mining temporal invariants from partially ordered
logs",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "39--46",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094101",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A common assumption made in log analysis research is
that the underlying log is totally ordered. For
concurrent systems, this assumption constrains the
generated log to either exclude concurrency altogether,
or to capture a particular interleaving of concurrent
events. This paper argues that capturing concurrency as
a partial order is useful and often indispensable for
answering important questions about concurrent systems.
To this end, we motivate a family of event ordering
invariants over partially ordered event traces, give
three algorithms for mining these invariants from logs,
and evaluate their scalability on simulated distributed
system logs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dutta:2011:WPA,
author = "Prabal Dutta and Ricardo Bianchini",
title = "Workshop on power aware computing and systems
{(HotPower'11)}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "47--47",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094103",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:2011:EAW,
author = "Jie Chen and Ron C. Chiang and H. Howie Huang and Guru
Venkataramani",
title = "Energy-aware writes to non-volatile main memory",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "48--52",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094104",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Scalability challenges of DRAM technology call for
advances in emerging memory technologies, among which
Phase Change Memory (PCM) has received considerable
attention due to its non-volatility, storage density
and capacity advantages. The drawbacks of PCM include
limited write endurance and high power consumption for
write operations (upto 10x in comparison to read
operations). In this paper, we investigate new
techniques that would perform writes to PCM with energy
awareness.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aksanli:2011:UGE,
author = "Baris Aksanli and Jagannathan Venkatesh and Liuyi
Zhang and Tajana Rosing",
title = "Utilizing green energy prediction to schedule mixed
batch and service jobs in data centers",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "53--57",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094105",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As brown energy costs grow, renewable energy becomes
more widely used. Previous work focused on using
immediately available green energy to supplement the
non-renewable, or brown energy at the cost of canceling
and rescheduling jobs whenever the green energy
availability is too low [16]. In this paper we design
an adaptive data center job scheduler which utilizes
short term prediction of solar and wind energy
production.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Honig:2011:SES,
author = "Timo H{\"o}nig and Christopher Eibel and R{\"u}diger
Kapitza and Wolfgang Schr{\"o}der-Preikschat",
title = "{SEEP}: exploiting symbolic execution for energy-aware
programming",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "58--62",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094106",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In recent years, there has been a rapid evolution of
energy-aware computing systems (e.g., mobile devices,
wireless sensor nodes), as still rising system
complexity and increasing user demands make energy a
permanently scarce resource. While static and dynamic
optimizations for energy-aware execution have been
explored massively, writing energy-efficient programs
in the first place has only received limited
attention. This paper proposes SEEP, a framework which
exploits symbolic execution and platform-specific
energy profiles to provide the basis for energy-aware
programming. More specifically, the framework provides
developers with information about the energy demand of
their code at hand, even for the invocation of library
functions and in settings with multiple possibly
strongly heterogeneous target platforms.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Subramanian:2011:OAS,
author = "Lakshminarayanan Subramanian",
title = "Overview of the {3rd ACM SOSP Workshop on Networking,
Systems and Applications on Mobile Handhelds}",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "63--64",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094108",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Javed:2011:PHN,
author = "Umar Javed and Dongsu Han and Ramon Caceres and
Jeffrey Pang and Srinivasan Seshan and Alexander
Varshavsky",
title = "Predicting handoffs in {3G} networks",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "65--70",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094109",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Consumers all over the world are increasingly using
their smartphones on the go and expect consistent, high
quality connectivity at all times. A key network
primitive that enables continuous connectivity in
cellular networks is handoff. Although handoffs are
necessary for mobile devices to maintain connectivity,
they can also cause short-term disruptions in
application performance. Thus, applications could
benefit from the ability to predict impending handoffs
with reasonable accuracy, and modify their behavior to
counter the performance degradation that accompanies
handoffs. In this paper, we study whether attributes
relating to the cellular network conditions measured at
handsets can accurately predict handoffs. In
particular, we develop a machine learning framework to
predict handoffs in the near future.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bakht:2011:SHM,
author = "Mehedi Bakht and Matt Trower and Robin Kravets",
title = "{Searchlight}: helping mobile devices find their
neighbors",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "71--76",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094110",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The rapid deployment of millions of handheld
communication devices has resulted in a demand for
physical proximitybased opportunistic networking.
However, the success of these emerging ad hoc networks
requires that a device should be able to search and
find other devices in its vicinity without
infrastructure support, without consuming too much
battery power, and preferably without requiring clock
synchronization. While approaches exist to solve this
problem of energy-efficient asynchronous neighbor
discovery, they present an unpleasant trade-off between
good average-case performance (probabilistic
approaches) and strict bound on worstcase discovery
latency (deterministic approaches).",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lagar-Cavilla:2011:TBS,
author = "H. Andr{\'e}s Lagar-Cavilla and Kaustubh Joshi and
Alexander Varshavsky and Jeffrey Bickford and Darwin
Parra",
title = "Traffic backfilling: subsidizing lunch for
delay-tolerant applications in {UMTS} networks",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "77--81",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094111",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Mobile application developers pay little attention to
the interactions between applications and the cellular
network carrying their traffic. This results in waste
of device energy and network signaling resources. We
place part of the blame on mobile OSes: they do not
expose adequate interfaces through which applications
can interact with the network. We propose traffic
backfilling, a technique in which delay-tolerant
traffic is opportunistically transmitted by the OS
using resources left over by the naturally occurring
bursts caused by interactive traffic. Backfilling
presents a simple interface with two classes of
traffic, and grants the OS and network large
flexibility to maximize the use of network resources
and reduce device energy consumption.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Raghavan:2011:RRP,
author = "Karthik Raghavan and V. Kamakoti",
title = "{ROSY}: recovering processor and memory systems from
hard errors",
journal = j-OPER-SYS-REV,
volume = "45",
number = "3",
pages = "82--84",
month = dec,
year = "2011",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2094091.2094113",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jan 16 19:01:36 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In the nanometer era, there has been a steady decline
in the semiconductor chip manufacturing yield due to
various contributing factors, such as wearout and
defects due to complex processes. One of the strategies
to alleviate this issue is to recover and use faulty
hardware at gracefully degraded performance. A common,
though naive, recovery strategy followed in the context
of general purpose multicore systems is to disable the
cores with faults and use only the fully functional
cores. Such a coarse-granular solution is suboptimal,
as the disabled cores would have many working modules
which go un-utilized. The Resurrecting Operating SYstem
(ROSY) presented in this paper is a step towards the
development of an operating system that can work on
faulty cores by adapting itself to hardware faults
using software workarounds, and utilize their working
components.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rodrigues:2012:SWL,
author = "Luis Rodrigues and Divy Agrawal and Ymir Vigfusson and
Gregory Chockler",
title = "Summary of the {5th Workshop on Large-Scale
Distributed Systems and Middleware (LADIS 2011)}",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "1--3",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146384",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tatemura:2012:MDA,
author = "Junichi Tatemura and Oliver Po and Hakan
Hacg{\"u}m{\"u}s",
title = "Microsharding: a declarative approach to support
elastic {OLTP} workloads",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "4--11",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146385",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The paper proposes microsharding, a relational
alternative for the recent procedural approaches with
large-scale data stores to support OLTP workloads
elastically. It employs a declarative specification,
called transaction classes, of constraints applied on
the transactions in a workload. The declarative
specification enables a principled approach to design
and analyze OLTP workloads. We discuss the current
framework as well as identify research directions.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rusu:2012:GSF,
author = "Florin Rusu and Alin Dobra",
title = "{GLADE}: a scalable framework for efficient
analytics",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "12--18",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146386",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we introduce GLADE, a scalable
distributed framework for large scale data analytics.
GLADE consists of a simple user-interface to define
Generalized Linear Aggregates (GLA), the fundamental
abstraction at the core of GLADE, and a distributed
runtime environment that executes GLAs by using
parallelism extensively. GLAs are derived from
User-Defined Aggregates (UDA), a relational database
extension that allows the user to add specialized
aggregates to be executed inside the query processor.
GLAs extend the UDA interface with methods to
Serialize/Deserialize the state of the aggregate
required for distributed computation. As a significant
departure from UDAs which can be invoked only through
SQL, GLAs give the user direct access to the state of
the aggregate, thus allowing for the computation of
significantly more complex aggregate functions.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tran:2012:TSA,
author = "Viet-Trung Tran and Bogdan Nicolae and Gabriel
Antoniu",
title = "Towards scalable array-oriented active storage: the
pyramid approach",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "19--25",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146387",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The recent explosion in data sizes manipulated by
distributed scientific applications has prompted the
need to develop specialized storage systems capable to
deal with specific access patterns in a scalable
fashion. In this context, a large class of applications
focuses on parallel array processing: small parts of
huge multi-dimensional arrays are concurrently accessed
by a large number of clients, both for reading and
writing. A specialized storage system that deals with
such an access pattern faces several challenges at the
level of data/metadata management. We introduce
Pyramid, an active array-oriented storage system that
addresses these challenges.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wolf:2012:CSO,
author = "Joel Wolf and Andrey Balmin and Deepak Rajan and
Kirsten Hildrum and Rohit Khandekar and Sujay Parekh
and Kun-Lung Wu and Rares Vernica",
title = "{CIRCUMFLEX}: a scheduling optimizer for {MapReduce}
workloads with shared scans",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "26--32",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146388",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We consider MapReduce clusters designed to support
multiple concurrent jobs, concentrating on environments
in which the number of distinct datasets is modest
relative to the number of jobs. Many datasets in such
scenarios wind up being scanned by multiple concurrent
Map phase jobs. As has been noticed previously, this
scenario provides an opportunity for Map phase jobs to
cooperate, sharing the scans of these datasets, and
thus reducing the costs of such scans. Our paper has
two main contributions. First, we present a novel and
highly general method for sharing scans and thus
amortizing their costs. This concept, which we call
cyclic piggybacking, has a number of advantages over
the more traditional batching scheme described in the
literature.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sen:2012:CCS,
author = "Siddhartha Sen and Michael J. Freedman",
title = "Commensal cuckoo: secure group partitioning for
large-scale services",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "33--39",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146389",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present commensal cuckoo,* a secure group
partitioning scheme for large-scale systems that
maintains the correctness of many small groups, despite
a Byzantine adversary that controls a constant (global)
fraction of all nodes. In particular, the adversary is
allowed to repeatedly rejoin faulty nodes to the system
in an arbitrary adaptive manner, e.g., to collocate
them in the same group. Commensal cuckoo addresses
serious practical limitations of the state-of-the-art
scheme, the cuckoo rule of Awerbuch and Scheideler,
tolerating $32x$--$41x$ more faulty nodes with groups
as small as 64 nodes (as compared to the hundreds
required by the cuckoo rule).",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Laden:2012:ADF,
author = "Guy Laden and Roie Melamed and Ymir Vigfusson",
title = "Adaptive and dynamic funnel replication in clouds",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "40--46",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146390",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We consider the problem of strongly consistent
replication in a multi data center cloud setting. This
environment is characterized by high latency
communication between data centers, significant
fluctuations in the performance of seemingly identical
virtual machines (VMs) and temporary disconnects of
data centers from the rest of the cloud. In this paper
we introduce the adaptive and dynamic Funnel
Replication (FR) protocol that is designed to achieve
high throughout and low latency for reads, to
accommodate arbitrary latency/throughput tradeoffs for
writes, to maximize performance in the face of VM
performance variations and to provide high availability
for read requests in the presence of network
partitions.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Malkhi:2012:PCF,
author = "Dahlia Malkhi and Mahesh Balakrishnan and John D.
Davis and Vijayan Prabhakaran and Ted Wobber",
title = "From {Paxos} to {CORFU}: a flash-speed shared log",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "47--51",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146391",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Frohlich:2012:BSC,
author = "Antonio Augusto Fr{\"o}hlich and Leandro Buss Becker
and George Lima and Stefan Petters and Dilma M. da
Silva and Edna N. Silva Barros",
title = "{Brazilian Symposium on Computing System
Engineering}",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "52--52",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146393",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vicente:2012:ECS,
author = "Elder Vicente and Rivalino Matias and L{\'u}cio Borges
and Autran Mac{\^e}do",
title = "Evaluation of compound system calls in the {Linux}
kernel",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "53--63",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146394",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The overhead caused by system calls in many
applications has motivated research works focusing on
reducing their execution costs. In this work we
implement different types of compound system calls, and
evaluate them taking into account their execution time
in a multicore computer. The experimental plan is
conducted for both physical and virtual machine
environments. The execution time dataset obtained
through experiments statistically controlled is
analysed and we show that all proposed compound calls
present statistically significant performance gains
when compared to their conventional counterparts, for
both physical and virtual machine environments.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muck:2012:ICH,
author = "Tiago Rogerio Muck and Antonio Augusto Frohlich and
Michael Gernoth and Wolfgang Schroder-Preikschat",
title = "Implementing {OS} components in hardware using {AOP}",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "64--72",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146395",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we propose a SystemC-based design
methodology focusing on the implementation of operating
system components in hardware by using Aspect-oriented
Programming concepts. As a case study to validate our
approach, we have designed and implemented a hardware
thread scheduler and a debugging aspect program. For
comparison purposes, a hand-made scheduler with
debugging capabilities was also implemented. The
hardware synthesis results shown that Aspect-oriented
Programming concepts and techniques can be efficiently
applied to digital hardware design in SystemC through
the proposed methodology. The observed overhead in
terms of area was less than 1\% and the increase in the
longest path delay for the circuit was less than 3\%.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wehrmeister:2012:SEV,
author = "Marco A. Wehrmeister and Joao G. Packer and Luis M.
Ceron",
title = "Support for early verification of embedded real-time
systems through {UML} models simulation",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "73--81",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146396",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Identifying errors in early design phases leads to a
decrease in the repairing cost compared to the
situation in which such problems are discovered only in
advanced design phases. This work is a first step
toward an automatic verification approach for embedded
and real-time systems' high-level specifications, such
as UML models. This paper presents a model-driven
framework to simulate system's behavior already in
early design phases, prior to the implementation phase.
More specifically, the mentioned framework simulates
the behavior specified within UML models, generating a
trace of executed actions for the selected behaviors.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nassiffe:2012:OQS,
author = "R{\'\i}ad Nassiffe and Eduardo Camponogara and George
Lima",
title = "Optimizing quality of service in real-time systems
under energy constraints",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "82--92",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146397",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Embedded real-time systems powered by batteries
require suitable support for energy-savings at the
operating system level. Mechanisms to do so must take
into consideration not only energy constraints but also
schedulability since, in this kind of system, tasks
must execute within predefined time windows. On top of
that, it is desired that application quality of service
(QoS) is optimized. In this paper we present a
framework capable of maximizing application QoS subject
to both schedulability and energy constraints. It is
assumed that application tasks may have multiple
operating modes, each of which exhibiting a specific
QoS level when running at a specific processor
operating frequency.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hayden:2012:RTW,
author = "Christopher M. Hayden and Iulian Neamtiu",
title = "Report on the {Third Workshop on Hot Topics in
Software Upgrades (HotSWUp'11)}",
journal = j-OPER-SYS-REV,
volume = "46",
number = "1",
pages = "93--99",
month = jan,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2146382.2146399",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Feb 17 19:19:11 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Report on the third workshop on hot topics in software
upgrades (HotSWUp'11). The workshop combined
presentations of peer-reviewed research papers with a
keynote speech on the practical issues related to
performing large-scale upgrades. The audience included
researchers and practitioners from academia, industry,
and government. In addition to the technical
presentations, the program allowed ample time for
discussions, which were driven by debate questions
provided in advance by the presenters. HotSWUp provides
a premier forum for discussing problems that are often
considered niche topics in the established research
communities.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hagimont:2012:SAE,
author = "Daniel Hagimont and Noel {De Palma}",
title = "A simulator to assess energy saving strategies and
policies in {HPC} workloads",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "2--9",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331578",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In recent years power consumption of high performance
computing (HPC) clusters has become a growing problem
due, e.g., to the economic cost of electricity, the
emission of carbon dioxide (with negative impact on the
environment), and the generation of heat (which reduces
hardware reliability). In past work, we developed
EnergySaving cluster, a software package that regulates
the number of active nodes in an HPC facility to match
the users' demands. In this paper, we extend this work
by presenting a simulator for this tool that allows the
evaluation and analysis of the benefits of applying
different energy-saving strategies and policies, under
realistic workloads, to different cluster
configurations.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oliveira:2012:SMC,
author = "Frederico Alvares de {Oliveira, Jr.} and Thomas
Ledoux",
title = "Self-management of cloud applications and
infrastructure for energy optimization",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "10--18",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331579",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As a direct consequence of the increasing popularity
of Cloud Computing solutions, data centers are
amazingly growing and hence have to urgently face with
the energy consumption issue. Available solutions rely
on Cloud Computing models and virtualization techniques
to scale up/down application based on their performance
metrics. Although those proposals can reduce the energy
footprint of applications and by transitivity of cloud
infrastructures, they do not consider the internal
characteristics of applications to finely define a
trade-off between applications Quality of Service and
energy footprint. In this paper, we propose a
self-adaptation approach that considers both
application internals and system to reduce the energy
footprint in cloud infrastructure. Each application and
the infrastructure are equipped with their own control
loop, which allows them to autonomously optimize their
executions. Simulations show that the approach may lead
to appreciable energy savings without interfering on
application provider revenues.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Takouna:2012:EES,
author = "Ibrahim Takouna and Wesam Dawoud and Christoph
Meinel",
title = "Energy efficient scheduling of {HPC}-jobs on
virtualize clusters using host and {VM} dynamic
configuration",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "19--27",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331580",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Energy efficient resource management has become a
significant concern in virtualized data centers to
reduce operational costs and extend systems' lifetime.
The opportunity of reducing energy can be achieved by
using Dynamic Voltage Frequency Scaling (DVFS) and
hosts consolidation.However, energy management of
emerging High Performance Computing (HPC) clouds that
host CPU-intensive jobs is more challenging. In this
work, we present an optimization solution to assuage
the trade-offs between energy and acceptance ratio of
jobs. To achieve this, we consider the current
multicore processor architecture, which supports DVFS
scheme. Furthermore, we tailored an energy model for
multicore processor based on the number of active
cores, the average running frequency, and memory. A
power-aware local VM scheduler is also implemented at
the host level. Importantly, we show the importance of
including static power in the energy model. Finally, we
compared our approach with pure DVFS and DVFS with live
migration. The results show that our approach
outperforms the other approaches in terms of energy,
SLA violation percentage, system utilization, and
number of finished jobs. As a future work, we will
implement this in a heterogeneous cluster and will
consider the cost of turning off and on the hosts.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kamga:2012:ESE,
author = "Christine Mayap Kamga and Giang Son Tran and Laurent
Broto",
title = "Extended scheduler for efficient frequency scaling in
virtualized systems",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "28--35",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331581",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This report summarizes the first edition of the
European Workshop on Dependable Cloud Computing. The
motivation of this new workshop series is to bring
together researchers and practitioners that face the
challenge of making cloud infrastructures and
associated services dependable and secure so even
critical applications can be safely deployed in clouds.
As a start, the initial edition met this target by
combining regular paper presentations, invited talks
and the project presentations of five large EU-funded
research projects. Thereby, especially the last group
of talks outlined examples for close interaction of
academia and industry in the context of cloud
computing.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bouti:2012:SCB,
author = "Adil Bouti and J{\"o}rg Keller",
title = "Securing cloud-based computations against malicious
providers",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "38--42",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331583",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Security in clouds often focuses on preventing clients
from gaining information about other clients'
computations. However, cloud providers might also be a
source for loss of confidentiality. We present a
protocol to delegate computations into clouds with
encrypted data. The protocol is based on homomorphic
properties of encryption algorithms. The protocol can
also be used to amend existing applications by software
patches of binaries. We evaluate the protocol by a
proof-of-concept implementation to investigate
practicability, and discuss variants and extensions to
increase the prototype's efficiency.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bessani:2012:LOW,
author = "Alysson Bessani and R{\"u}diger Kapitza and Dana Petcu
and Paolo Romano and Spyridon V. Gogouvitis and
Dimosthenis Kyriazis and Roberto G. Cascella",
title = "A look to the old-world\_sky: {EU}-funded
dependability cloud computing research",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "43--56",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331584",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud computing is currently the most important trend
in the Information and Communication Technology (ICT)
industry, and it has still not fully realized its
potential. Reasons for its popularity are the
opportunities to rapidly allocate vast amounts of
computing resources and the fact that resources are
accounted per use. While cloud computing was initiated
by major industry players, academia has rapidly caught
up; currently we see a vast number of cloud
computing-related research efforts. However, since
industry pushes development and many research aspects
of cloud computing demand for large compute resources
and real workloads, pure academic efforts have
difficulties to address the most important issues and
to have a major impact. On the other hand, academia
usually tends to explore disruptive ideas that would
not be addressed by industry alone. This paper
summarizes the approaches and methods of five EU-funded
research projects that focus on cloud computing in
general and address important issues such as security,
dependability, and interoperability. These aspects have
received limited attention by the industry so far. The
key to success of these large joint efforts is the
close collaboration between partners from academia and
industry spread all over Europe. The specific projects
are Cloud-TM, Contrail, mOASIC, TClouds and VISION
Cloud. Besides presenting the individual projects and
their key contributions, we provide a perspective on
future ICT research in Europe.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baset:2012:CSP,
author = "Salman A. Baset",
title = "Cloud {SLAs}: present and future",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "57--66",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331586",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The variability in the service level agreements (SLAs)
of cloud providers prompted us to ask the question how
do the SLAs compare and how should the SLAs be defined
for future cloud services. We break down a cloud SLA
into easy to understand components and use it to
compare SLAs of public cloud providers. Our study
indicates that none of the surveyed cloud providers
offer any performance guarantees for compute services
and leave SLA violation detection to the customer. We
then provide guidance on how SLAs should be defined for
future cloud services.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deOliveira:2012:MAM,
author = "Augusto Born de Oliveira and Ahmad Saif Ur Rehman and
Sebastian Fischmeister",
title = "{mTags}: augmenting microkernel messages with
lightweight metadata",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "67--79",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331587",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this work we propose mTags, an efficient mechanism
that augments microkernel interprocess messages with
lightweight metadata to enable the development of new,
system-wide functionality without requiring
modification of the application source code. As such it
is well suited for systems with a large legacy code
base or third-party applications like phone and tablet
applications. We explored mTags in a variety of
different contexts in local and distributed system
scenarios. For example, we detail use cases in areas
including messaging-induced deadlocks and mode
propagation. To demonstrate that mTags is technically
feasible and practical, we implemented it in a
commercial microkernel and executed multiple sets of
standard benchmarks on two different computing
architectures. The results clearly demonstrate that
mTags has only negligible overhead and strong potential
for many applications.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aviv:2012:ETE,
author = "Adam J. Aviv and Vin Mannino and Thanat Owlarn and
Seth Shannin and Kevin Xu and Boon Thau Loo",
title = "Experiences in teaching an educational user-level
operating systems implementation project",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "80--86",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331588",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The importance of a comprehensive implementation
component for undergraduate Operating Systems (OS)
courses cannot be understated. Students not only
develop deep insight and understanding of OS
fundamentals, but they also learn key software
engineering skills that only a large development
project, such as implementing an OS, can teach. There
are clear benefits to traditional OS projects where
students program or alter real (Linux) kernel source or
extend educational OS implementations; however, in our
experience, bootstrapping such a project is a huge
undertaking that may not be accessible in many
classrooms. In this paper, we describe a different
approach to the OS implementation assignment: A
user-level Operating System simulation based on UNIX
preemptive signaling and threading constructs called
ucontext. We believe that this variation of the
implementation assignment provides many of the same
educational benefits as traditional low-level projects
without many of the expensive start-up costs. This
project has been taught for a number of years at the
University of Pennsylvania and was recently overhauled
for the Fall 2011 semester. This paper describes the
current version of the project and our experiences
teaching it to a class of 54 students.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Couceiro:2012:WDT,
author = "Maria Couceiro and Paolo Romano",
title = "Where does transactional memory research stand and
what challenges lie ahead?: {WTM 2012, EuroTM Workshop
on Transactional Memory}",
journal = j-OPER-SYS-REV,
volume = "46",
number = "2",
pages = "87--92",
month = jul,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2331576.2331589",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jul 13 12:36:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Transactional Memory (TM) is a promising technology
that aims to simplify parallel programming by providing
a programmer friendly alternative to traditional
lock-based concurrency. The past ten years have seen
intense research work on software and hardware TM
proposals, and has recently led to the first hardware
TM implementation for a commodity high-performance
microprocessor, and to the inclusion of TM support in
the world's leading open source compiler. EuroTM (COST
Action IC1001), in collaboration with the CloudTM
project1, organized the second edition of the EuroTM
Workshop on Transactional Memory (WTM 2012). The
objective of WTM was to discuss new developments for
this era of maturing TM research. The workshop took
place on April 10, in Bern, Switzerland, in conjunction
with Eurosys 2012. Below we give highlights on the
topics discussed in the workshop.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dawkins:2012:SRI,
author = "Scott Dawkins and Kaladhar Voruganti and John D.
Strunk",
title = "Systems research and innovation in data {ONTAP}",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "1--3",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421650",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Over the last 20 years, there have been many changes
in the data storage industry. NetApp\reg{} products
have kept pace and pushed the boundary in various
areas. Staying at the forefront requires attentiveness
to emerging technology trends and a disciplined
approach to analyzing them. By understanding the trends
and how they affect our customers, we can focus our
efforts on delivering the best products possible. In
this issue of OSR, we highlight some of the research
and innovation that have helped us stay at the
forefront of these technological changes.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ellard:2012:GCV,
author = "Daniel Ellard and Craig Everhart and Theresa Raj",
title = "{Glitz}: cross-vendor federated file systems",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "4--10",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421651",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We propose Glitz, a system to integrate multiple file
server federation regimes. NFS version 4 is a
significant advance over prior versions of NFS, in
particular specifying how NFS clients can navigate a
large, multi-server namespace whose constituent parts
may be replicated or moved while in use, as specified
by NFS servers. This capability is essentially the same
as that of previous distributed file systems such as
AFS [7]. Sophisticated as this NFS capability is, it
does not address the larger problem of building a
usable system atop this basic capability. Multiple
single-architecture solutions have been proposed, but
each of these is based on an architecture for server
federation that does not easily admit other members [3,
16, 18]. Glitz allows those multiple-server federations
to interoperate and collaborate in a vendor-independent
fashion. We give a history of file system federation
efforts as well as a detailed tour of Glitz and its
benefits for vendors.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bisson:2012:DFF,
author = "Tim Bisson and Yuvraj Patel and Shankar Pasupathy",
title = "Designing a fast file system crawler with incremental
differencing",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "11--19",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421652",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Search engines for storage systems rely on crawlers to
gather the list of files that need to be indexed. The
recency of an index is determined by the speed at which
this list can be gathered. While there has been a
substantial amount of literature on building efficient
web crawlers, there is very little literature on file
system crawlers. In this paper we discuss the
challenges in building a file system crawler. We then
present the design of two file system crawlers: the
first uses the standard POSIX file system API but
carefully controls the amount of memory and CPU that it
uses. The second leverages modifications to the file
systems's internals, and a new API called SnapDiff, to
detect modified files rapidly. For both crawlers we
describe the incremental differencing design; the
method to produce a list of changes between a previous
crawl and the current point in time.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Basak:2012:MBD,
author = "Jayanta Basak and Kushal Wadhwani and Kaladhar
Voruganti and Srinivasan Narayanamurthy and Vipul
Mathur and Siddhartha Nandi",
title = "Model building for dynamic multi-tenant provider
environments",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "20--31",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421653",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Increasingly, storage vendors are finding it difficult
to leverage existing white-box and black-box modeling
techniques to build robust system models that can
predict system behavior in the emerging dynamic and
multi-tenant data centers. White-box models are
becoming brittle because the model builders are not
able to keep up with the innovations in the storage
system stack, and black-box models are becoming brittle
because it is increasingly difficult to a priori train
the model for the dynamic and multi-tenant data center
environment. Thus, there is a need for innovation in
system model building area. In this paper we present a
machine learning based blackbox modeling algorithm
called M-LISP that can predict system behavior in
untrained region for these emerging multitenant and
dynamic data center environments. We have implemented
and analyzed M-LISP in real environments and the
initial results look very promising. We also provide a
survey of some common machine learning algorithms and
how they fare with respect to satisfying the modeling
needs of the new data center environments.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bairavasundaram:2012:RRS,
author = "Lakshmi N. Bairavasundaram and Gokul Soundararajan and
Vipul Mathur and Kaladhar Voruganti and Kiran
Srinivasan",
title = "Responding rapidly to service level violations using
virtual appliances",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "32--40",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421654",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "One of the key goals in the data center today is
providing storage services with service-level
objectives (SLOs) for performance metrics such as
latency and throughput. Meeting such SLOs is
challenging due to the dynamism observed in these
environments. In this position paper, we propose
dynamic instantiation of virtual appliances, that is,
virtual machines with storage functionality, as a
mechanism to meet storage SLOs efficiently. In order
for dynamic instantiation to be realistic for
rapidly changing environments, it should be automated.
Therefore, an important goal of this paper is to show
that such automation is feasible. We do so through a
caching case study. Specifically, we build the
automation framework for dynamically instantiating
virtual caching appliances. This framework identifies
sets of interfering workloads that can benefit from
caching, determines the cache-size requirements of
workloads, non-disruptively migrates the application to
use the cache, and warms the cache to quickly return to
acceptable service levels. We show through an
experiment that this approach addresses SLO violations
while using resources efficiently.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Goel:2012:RTP,
author = "Atul Goel and Peter Corbett",
title = "{RAID} triple parity",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "41--49",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421655",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "RAID triple parity (RTP) is a new algorithm for
protecting against three-disk failures. It is an
extension of the double failure correction Row-Diagonal
Parity code. For any number of data disks, RTP uses
only three parity disks. This is optimal with respect
to the amount of redundant information required and
accessed. RTP uses XOR operations and stores all data
un-encoded. The algorithm's parity computation
complexity is provably optimal. The decoding complexity
is also much lower than that of existing comparable
codes. This paper also describes a symmetric variant of
the algorithm where parity computation is identical to
triple reconstruction.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Strunk:2012:HAC,
author = "John D. Strunk",
title = "Hybrid aggregates: combining {SSDs} and {HDDs} in a
single storage pool",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "50--56",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421656",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Relative to traditional hard disk drives (HDDs), solid
state drives (SSDs) provide a very large number of I/Os
per second, but they have limited capacity. From a
cost-effectiveness perspective, SSDs provide
significantly better random I/O throughput per dollar
than a typical disk, but the capacity provided per
dollar spent on SSDs limits them to the most demanding
of datasets. Traditionally, Data ONTAP\reg{} storage
aggregates have been provisioned using a single type of
disk. This restriction limits the cost effectiveness of
the storage pool to that of the underlying disks. The
Hybrid Aggregates project within the Advanced
Technology Group (ATG) explored the potential to
combine multiple disk types within a single aggregate.
One of the primary goals of the project was to
determine whether a hybrid aggregate, composed of SSDs
(for their cost-effective performance) and Serial-ATA
(SATA) disks (for their cost-effective capacity), could
simultaneously provide better cost/performance and
cost/throughput ratios than an all Fibre-Channel (FC)
solution. The project has taken a two-pronged approach
to building a prototype system capable of supporting
hybrid aggregates. The first part of the project
investigated the changes necessary for Data ONTAP RAID
and WAFL\reg{} layers to support a hybrid aggregate.
This included propagating disk-type information to
WAFL, modifying WAFL to support the allocation of
blocks from a particular storage class (i.e., disk
type), and repurposing the existing writeafter- read
and segment-cleaning infrastructure to support the
movement of data between storage classes. The second
part of the project examined potential policies for
allocating and moving data between storage classes
within a hybrid aggregate. Through proper policies, it
is possible to automatically segregate the data within
the aggregate such that the SSD-backed portion of the
aggregate absorbs a large fraction of the I/O requests,
leaving the SATA disks to contribute capacity for
colder data. This paper describes the implementation of
the Hybrid Aggregates prototype and the policies for
automatic data placement and movement that have been
evaluated. It also presents some performance results
from the prototype system.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yasa:2012:SSD,
author = "Giridhar Appaji Nag Yasa and P. C. Nagesh",
title = "Space savings and design considerations in variable
length deduplication",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "57--64",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421657",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Explosion of data growth and duplication of data in
enterprises has led to the deployment of a variety of
deduplication technologies. However not all
deduplication technologies serve the needs of every
workload. Most prior research in deduplication
concentrates on fixed block size (or variable block
size at a fixed block boundary) deduplication which
provides sub-optimal space efficiency in workloads
where the duplicate data is not block aligned.
Workloads also differ in the nature of operations and
their priorities thereby affecting the choice of the
right flavor of deduplication. Object workloads for
instance, hold multiple versions of archived documents
that have a high degree of duplicate data. They are
also write-once read-many in nature and follow a whole
object GET, PUT and DELETE model and would be better
served by a deduplication strategy that takes care of
nonblock aligned changes to data. In this paper, we
describe and evaluate a hybrid of a variable length and
block based deduplication that is hierarchical in
nature. We are motivated by the following insights from
real world data: (a) object workload applications do
not do in-place modification of data and hence new
versions of objects are written again as a whole (b)
significant amount of data among different versions of
the same object is shareable but the changes are
usually not block aligned. While the second point is
the basis for variable length technique, both the above
insights motivate our hierarchical deduplication
strategy. We show through experiments with production
data-sets from enterprise environments that this
provides up to twice the space savings compared to a
fixed block deduplication.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Desnoyers:2012:LMC,
author = "Mathieu Desnoyers and Michel R. Dagenais",
title = "Lockless multi-core high-throughput buffering scheme
for kernel tracing",
journal = j-OPER-SYS-REV,
volume = "46",
number = "3",
pages = "65--81",
month = dec,
year = "2012",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2421648.2421659",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Dec 22 19:22:21 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Studying execution of concurrent real-time online
systems, to identify far-reaching and hard to reproduce
latency and performance problems, requires a mechanism
able to cope with voluminous information extracted from
execution traces. Furthermore, the workload must not be
disturbed by tracing, thereby causing the problematic
behavior to become unreproducible. In order to satisfy
this low-disturbance constraint, we created the LTTng
kernel tracer. It is designed to enable safe and
race-free attachment of probes virtually anywhere in
the operating system, including sites executed in
non-maskable interrupt context. In addition to being
reentrant with respect to all kernel execution
contexts, LTTng offers good performance and
scalability, mainly due to its use of per-CPU data
structures, local atomic operations as main buffer
synchronization primitive, and RCU (Read-Copy Update)
mechanism to control tracing. Given that kernel
infrastructure used by the tracer could lead to
infinite recursion if traced, and typically requires
non-atomic synchronization, this paper proposes an
asynchronous mechanism to inform the kernel that a
buffer is ready to read. This ensures that tracing
sites do not require any kernel primitive, and
therefore protects from infinite recursion. This paper
presents the core of LTTng's buffering algorithms and
measures its performance.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Malkhi:2013:WRL,
author = "Dahlia Malkhi and Robbert van Renesse",
title = "Workshop report on {LADIS 2012}",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "1--2",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433142",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Costa:2013:BGB,
author = "Paolo Costa",
title = "Bridging the gap between applications and networks in
data centers",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "3--8",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433143",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Junqueira:2013:DB,
author = "Flavio P. Junqueira and Ivan Kelly and Benjamin Reed",
title = "Durability with {BookKeeper}",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "9--15",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433144",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Practical systems must often guarantee that changes to
the system state are durable. Examples of such systems
are databases, file systems, and messaging middleware
with guaranteed delivery. One common way of
implementing durability while keeping performance high
is to use a log to persist updates to the system state.
Such systems use the log to reconstruct the system
state in the event of a crash. When implementing such a
log, if the log is only stored locally, the system
state is permanently lost when the server writing the
log experiences a permanent hardware failure.
BookKeeper is a system that exposes a log abstraction
for building high performance, highly available
distributed systems. BookKeeper transparently
implements replication for high availability and
striping for high performance. A Book- Keeper
deployment comprises storage servers called bookies,
which are designed to serve a large number of
concurrent ledgers. BookKeeper is currently an
open-source project and is in production use at
Yahoo!",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shue:2013:FIM,
author = "David Shue and Michael J. Freedman and Anees Shaikh",
title = "Fairness and isolation in multi-tenant storage as
optimization decomposition",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "16--21",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433145",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Shared storage services enjoy wide adoption in
commercial clouds. But most systems today provide weak
performance isolation and fairness between tenants, if
at all. Most approaches to multi-tenant resource
allocation are based either on per-VM allocations or
hard rate limits that assume uniform workloads to
achieve high utilization. Instead, Pisces, our system
for shared key-value storage, achieves datacenterwide
per-tenant performance isolation and fairness. Pisces
achieves per-tenant weighted fair sharing of system
resources across the entire shared service, even when
partitions belonging to different tenants are
co-located and when demand for different partitions is
skewed or time-varying. The focus of this paper is to
highlight the optimization model that motivates the
decomposition of Pisces's fair sharing problem into
four complementary mechanisms--- partition placement,
weight allocation, replica selection, and weighted fair
queuing---that operate on different time-scales to
provide system-wide max-min fairness. An evaluation of
our Pisces storage prototype achieves nearly ideal
(0.98 Min- Max Ratio) fair sharing, strong performance
isolation, and robustness to skew and shifts in tenant
demand.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ghita:2013:TAP,
author = "Denisa Ghita and Katerina Argyraki and Patrick
Thiran",
title = "Toward accurate and practical network tomography",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "22--26",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433146",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Brazilian Symposium on Computing System
Engineering (SBESC) is an initiative of the research
community originally associated with three events: the
Brazilian Workshop on Real-Time Systems, created in
1998; the Brazilian Workshop on Operating Systems,
created in 2004; and the Brazilian Workshop on Embedded
Systems, created in 2010. The identification of a
strong synergy among these research areas added to the
fact that designing computing systems is an
increasingly multidisciplinary task has motivated the
workshops to move from their native conferences to form
an independent symposium. The broad term ``Computing
System Engineering'' emerged in the context of
contemporary Cyber-Physical Systems, which challenge
Engineers and Scientist as they shape a new reality for
modern societies. This year, the symposium was hosted
by the Federal University of Rio Grande do Norte (UFRN)
in the beautiful coastal city of Natal in Northeast
Brazil. The program spanned a whole week, from November
5 to 9, and was organized in two big blocks:
peer-reviewed paper sessions and tutorials. The event
was organized by UFRN's Computer Science Department
(DIMAP), sponsored by the Brazilian Computing Society
(SBC), and financed by CAPES, CNPq, and FAPERN. SBESC's
Technical Program Committee also selected two papers
from those presented at the symposium addressing
operating systems issues to appear in the Operating
Systems Review and thus offer ACM fellows a glimpse of
the event. Authors were invited to extend and improve
their manuscripts with recent research results. The
first paper, On the Formal Verification of
Component-based Embedded Operating Systems, by M.
Ludwich and A. Frohlich, introduces an approach to
formally verify the functional correctness and safety
properties of embedded operating system components
described at system-level. The convergence between
software and hardware in the domain of embedded systems
is pressing operating systems in the filed to deliver
their services both as software and as hardware. In
such a scenario, it is desirable to verify system
properties regardless of whether components are
instantiated as software or hardware. The approach
combines software model checking and programming by
contract concepts to address such issues. The second,
Adaptive Request Batching for Byzantine Replication, by
A. de Sa, A. Freitas, and R. Macedo, proposes an
adaptation of the Practical Byzantine Fault Tolerance
algorithm proposed by Liskov and Castro to increase its
performance. The original PBFT algorithm uses a batch
to store client requests on the primary replica.
Requests in a batch are handled together, aiming at
decreasing the time spent with message authentication.
The adaptation strategy dynamically varies the batch
size and the batch time-out according with application
activity.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ludwich:2013:FVC,
author = "Mateus Krepsky Ludwich and Ant{\^o}nio Augusto
Fr{\"o}hlich",
title = "On the formal verification of component-based embedded
operating systems",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "28--34",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433148",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The increasing complexity of embedded systems is
pushing their design to System-Level, thus leading to a
convergence between software and hardware.
Consequently, operating systems in this realm are also
being required to deliver their services both as
software and as hardware. In such a scenario, it is
desirable to verify system properties regardless of
whether its components are instantiated at software or
hardware. In this paper, we describe an approach to
formally verify functional correctness and safety
properties of such system-level component. The approach
is illustrated by a case study of EPOS' scheduler,
whose implementation can be driven to yield both a
software instance compiled by the GCC C++ compiler or a
hardware instance synthesized by the CatapultC ESL
tool. We demonstrate that the scheduler follows its
specification regardless of the domain for which it is
instantiated. We also demonstrate that the proposed
approach causes no run-time overhead, since the adopted
Software Model Checking techniques are deployed at
compile-time.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{deSa:2013:ARB,
author = "Al{\'\i}rio Santos de S{\'a} and Allan Edgard Silva
Freitas and Raimundo Jos{\'e} de Ara{\'u}jo
Mac{\^e}do",
title = "Adaptive request batching for {Byzantine} replication",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "35--42",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433149",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Castro and Liskov proposed in 1999 a successful
solution for byzantine fault-tolerant replication,
named PBFT, which overcame performance drawbacks of
earlier byzantine fault-tolerant replication protocols.
Other proposals extended PBFT with further
optimizations, improving PBFT performance in certain
conditions. One of the key optimizations of PBFT-based
protocols is the use a request batching mechanism. If
the target distributed system is dynamic, that is, if
its underlying characteristics change dynamically, such
as workload, channel QoS, network topology, etc., the
configuration of the request batching mechanism must
follow the dynamics of the system or it may not yield
the desired performance improvement. This paper
addresses this challenge by proposing an innovative
solution to the dynamic configuration of request
batching parameters inspired on feedback control
theory. In order to evaluate its efficiency, the
proposed solution is simulated in various scenarios and
compared with the original version used in the
PBFT-family protocols.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ezzati-Jivan:2013:FCS,
author = "Naser Ezzati-Jivan and Michel R. Dagenais",
title = "A framework to compute statistics of system parameters
from very large trace files",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "43--54",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433151",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we present a framework to compute,
store and retrieve statistics of various system metrics
from large traces in an efficient way. The proposed
framework allows for rapid interactive queries about
system metrics values for any given time interval. In
the proposed framework, efficient data structures and
algorithms are designed to achieve a reasonable query
time while utilizing less disk space. A parameter
termed granularity degree (GD) is defined to determine
the threshold of how often it is required to store the
precomputed statistics on disk. The solution supports
the hierarchy of system resources and also different
granularities of time ranges. We explain the
architecture of the framework and show how it can be
used to efficiently compute and extract the CPU usage
and other system metrics. The importance of the
framework and its different applications are shown and
evaluated in this paper.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Saur:2013:RFW,
author = "Karla Saur and Iulian Neamtiu",
title = "Report on the {Fourth Workshop on Hot Topics in
Software Upgrades (HotSWUp 2012)}",
journal = j-OPER-SYS-REV,
volume = "47",
number = "1",
pages = "55--62",
month = jan,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2433140.2433152",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 30 11:41:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Fourth Workshop on Hot Topics in Software Upgrades
(HotSWUp 2012) was held on June 3, 2012 in Zurich,
Switzerland. The workshop was co-located with ICSE
2012. The goal of HotSWUp is to identify, through
interdisciplinary collaboration, cutting-edge research
ideas for implementing software upgrades. The workshop
combined presentations of peer-reviewed research papers
with a keynote speech on how empirical software
engineering can help reduce update-induced failures.
The audience included researchers and practitioners
from academia and industry. In addition to the
technical presentations, the program allowed ample time
for discussions, which were driven by debate questions
provided in advance by the presenters. HotSWUp provides
a premier forum for discussing problems that are often
considered niche topics in the established research
communities. For example, the technical discussions at
HotSWUp'12 covered dynamic software updates, package
management tools, using model-checking and verification
to verify updates, empirical software engineering and
repository mining, and highlighted many synergies among
these and other topics.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shraer:2013:DSR,
author = "Alexander Shraer and R{\"u}diger Kapitza",
title = "{Dagstuhl} seminar report: security and dependability
for federated cloud platforms, 2012",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "4--5",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506166",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bouchenak:2013:VCS,
author = "Sara Bouchenak and Gregory Chockler and Hana Chockler
and Gabriela Gheorghe and Nuno Santos and Alexander
Shraer",
title = "Verifying cloud services: present and future",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "6--19",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506167",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As cloud-based services gain popularity in both
private and enterprise domains, cloud consumers are
still lacking in tools to verify that these services
work as expected. Such tools should consider properties
such as functional correctness, service availability,
reliability, performance and security guarantees. In
this paper we survey existing work in these areas and
identify gaps in existing cloud technology in terms of
the verification tools provided to users. We also
discuss challenges and new research directions that can
help bridge these gaps.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Correia:2013:DIC,
author = "Miguel Correia and Neeraj Mittal",
title = "Dependability issues in cloud computing: extended
papers from the {1st International Workshop on
Dependability Issues in Cloud Computing --- DISCCO}",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "20--22",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506169",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jiekak:2013:RCS,
author = "Steve Jiekak and Anne-Marie Kermarrec and Nicolas {Le
Scouarnec} and Gilles Straub and Alexandre {Van
Kempen}",
title = "Regenerating codes: a system perspective",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "23--32",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506170",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The explosion of the amount of data stored in cloud
systems calls for more efficient paradigms for
redundancy. While replication is widely used to ensure
data availability, erasure correcting codes provide a
much better trade-off between storage and availability.
Regenerating codes are good candidates for they also
offer low repair costs in term of network bandwidth.
While they have been proven optimal, they are difficult
to understand and parameterize. In this paper we
provide an analysis of regenerating codes for
practitioners to grasp the various trade-offs. More
specifically we make two contributions: (i) we study
the impact of the parameters by conducting an analysis
at the level of the system, rather than at the level of
a single device; (ii) we compare the computational
costs of various implementations of codes and highlight
the most efficient ones. Our goal is to provide system
designers with concrete information to help them choose
the best parameters and design for regenerating
codes.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yazd:2013:BEE,
author = "Sara Arbab Yazd and Subbarayan Venkatesan and Neeraj
Mittal",
title = "Boosting energy efficiency with mirrored data block
replication policy and energy scheduler",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "33--40",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506171",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Energy efficiency is one of the major challenges in
big datacenters. To facilitate processing of large data
sets in a distributed fashion, the MapReduce
programming model is employed in these datacenters.
Hadoop is an open-source implementation of MapReduce
which contains a distributed file system. Hadoop
Distributed File System provides a data block
replication scheme to preserve reliability and data
availability. The distribution of the data block
replicas over the nodes is performed randomly by
meeting some constraints (e.g., preventing storage of
two replicas of a data block on a single node). This
study makes use of flexibility in the data block
placement policy to increase energy efficiency in
datacenters. Furthermore, inspired by Zaharia et al.'s
delay scheduling algorithm, a scheduling algorithm is
introduced, which takes into account energy efficiency
in addition to fairness and data locality properties.
Computer simulations of the proposed method suggest its
superiority over Hadoop's standard settings.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Taifi:2013:BDB,
author = "Moussa Taifi",
title = "Banking on decoupling: budget-driven sustainability
for {HPC} applications on auction-based clouds",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "41--50",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506172",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud providers are auctioning their excess capacity
using dynamically priced virtual instances. These spot
instances provide significant savings compared to
on-demand or fixed price instances. The users willing
to use these resources are asked to provide a maximum
bid price per hour, and the cloud provider runs the
instances as long as the market price is below the
user's bid price. By using such resources, the users
are exposed explicitly to failures, and need to adapt
their applications to provide some level of fault
tolerance. In this paper, we expose the effect of
bidding in the case of virtual HPC clusters composed of
spot instances. We describe the interesting effect of
uniform versus non-uniform bidding in terms of both the
failure rate and the failure model. We propose an
initial attempt to deal with the problem of predicting
the runtime of a parallel application under various
bidding strategies and various system parameters. We
describe the relationship between bidding strategies
and programming models, and we build a preliminary
optimization model that uses real price traces from
Amazon Web Services as inputs, as well as instrumented
values related to the processing and network capacities
of cluster instances on the EC2 services. Our results
show preliminary insights into the relationship between
non-uniform bidding and application scaling
strategies.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Desnoyers:2013:MCS,
author = "Mathieu Desnoyers and Paul E. McKenney and Michel R.
Dagenais",
title = "Multi-core systems modeling for formal verification of
parallel algorithms",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "51--65",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506174",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modeling parallel algorithms at the architecture level
enables exploring side-effects of the weakly ordered
nature of modern processors. Formal verification of
such models with model-checking can ensure that
algorithm guarantees will hold even in the presence of
the most aggressive compiler and processor
optimizations. This paper proposes a virtual
architecture to model the effects of such
optimizations. It first presents the OoOmem framework
to model out-of-order memory accesses. It then presents
the OoOisched framework to model the effects of
out-of-order instruction scheduling. These two
frameworks are explained and tested using
weakly-ordered memory interaction scenarios known to be
affected by weak ordering. Then, modeling of user-level
RCU (Read-Copy Update) synchronization algorithms is
presented. It uses the virtual architecture proposed
to verify that the RCU guarantees are indeed
respected.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Harji:2013:OTL,
author = "Ashif S. Harji and Peter A. Buhr and Tim Brecht",
title = "Our troubles with {Linux Kernel} upgrades and why you
should care",
journal = j-OPER-SYS-REV,
volume = "47",
number = "2",
pages = "66--72",
month = jul,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2506164.2506175",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 27 07:58:11 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
abstract = "Linux and other open-source Unix variants (and their
distributors) provide researchers with full-fledged
operating systems that are widely used. However, due to
their complexity and rapid development, care should be
exercised when using these operating systems for
performance experiments, especially in systems
research. In particular, the size and continual
evolution of the Linux code-base makes it difficult to
understand, and as a result, decipher and explain the
reasons for performance improvements. In addition, the
rapid kernel development cycle means that experimental
results can be viewed as out of date, or meaningless,
very quickly. We demonstrate that this viewpoint is
incorrect because kernel changes can and have
introduced both bugs and performance degradations. This
paper describes some of our experiences using Linux and
FreeBSD as platforms for conducting performance
evaluations and some performance regressions we have
found. Our results show, these performance regressions
can be serious (e.g., repeating identical experiments
results in large variability in results) and long lived
despite having a large negative effect on performance
(one problem was present for more than 3 years). Based
on these experiences, we argue: it is sometimes
reasonable to use an older kernel version, experimental
results need careful analysis to explain why a
performance effect occurs, and publishing papers
validating prior research is essential.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Editors:2013:EES,
author = "{Editors}",
title = "An energy-efficient self-provisioning approach for
cloud resources management",
journal = j-OPER-SYS-REV,
volume = "47",
number = "3",
pages = "2--9",
month = dec,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2553070.2553072",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Nov 27 15:50:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In recent years, energy conservation has become a
major issue in information technology. Cloud computing
is an emerging model for distributed utility computing
and is being considered as an attractive opportunity
for saving energy through central management of
computational resources. Obviously, a substantial
reduction in energy consumption can be made by powering
down servers when they are not in use. This work
presents a resources provisioning approach based on an
unsupervised predictor model in the form of an
unsupervised, recurrent neural network based on a
self-organizing map. Another unique feature of our work
is a resources administration strategy for energy
saving in the cloud. Such a strategy is implemented as
a self-administration module. We show that the proposed
approach gives promising results.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gorti:2013:RAD,
author = "Naga Pavan Kumar Gorti and Arun K. Somani",
title = "Reliability aware dynamic voltage and frequency
scaling for improved microprocessor lifetime",
journal = j-OPER-SYS-REV,
volume = "47",
number = "3",
pages = "10--17",
month = dec,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2553070.2553073",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Nov 27 15:50:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Dynamic voltage and frequency scaling (DVFS) is
heavily used for power management in real-time
environments. Although the schemes leveraging DVFS
provide significant power reduction, adverse effects on
chip reliability are possible. Alternate increase and
decrease in operating voltage and frequency leads to
thermal cycling. Increasing transistor packing density
leads to a larger range of possible operating
temperatures, exacerbating the thermal cycling problem.
Also, the chip reliability quantification process does
not include and represent the effects of small scale
thermal cycles. A good number of in-field chip failures
are attributed to the consequences of these. Thus, it
is imperative to include their effects into the
processor voltage and frequency selection process. Our
work develops an integrated processor thermal and
performance management technique centered on novel
polynomial time scheduling algorithms that lead to
lowering of thermal cycles in soft real time
environments. Our technique leverages application
awareness and runtime monitoring for improving chip
lifetime, while achieving considerable energy savings.
We show that a significant reduction in thermal cycles
and peaks is possible, leading to longer chip life
expectations.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gueye:2013:CMA,
author = "Soguy M. K. Gueye and Noel {De Palma} and Eric Rutten
and Alain Tchana",
title = "Coordinating multiple administration loops using
discrete control",
journal = j-OPER-SYS-REV,
volume = "47",
number = "3",
pages = "18--25",
month = dec,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2553070.2553074",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Nov 27 15:50:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The increasing complexity of computer systems has led
to the automation of administration functions, in the
form of autonomic managers. One important aspect
requiring such management is the issue of energy
consumption of computing systems, in the perspective of
green computing. As these managers address each a
specific aspect, there is a need for using several
managers to cover all the domains of administration.
However, coordinating them is necessary for proper and
effective global administration. Such coordination is a
problem of synchronization and logical control of
administration operations that can be applied by
autonomous managers on the managed system at a given
time in response to events observed on the state of
this system. We therefore propose to investigate the
use of reactive models with events and states, and
discrete control techniques to solve this problem. In
this paper, we illustrate this approach by integrating
a controller obtained by synchronous programming, based
on Discrete Controller Synthesis, in an autonomic
system administration infrastructure. The role of this
controller is to orchestrate the execution of
reconfiguration operations of all administration
policies to satisfy properties of logical consistency.
We apply this approach to coordinate three managers :
two energy-aware ones, which control server
provisioning and processor frequency, and a repair
manager.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Koyano:2013:SML,
author = "Sou Koyano and Shingo Ata and Hisashi Iwamoto and Yuji
Yano and Yasuto Kuroda and Kazunari Inoue and Ikuo
Oka",
title = "A study on micro level traffic prediction for
energy-aware routers",
journal = j-OPER-SYS-REV,
volume = "47",
number = "3",
pages = "26--33",
month = dec,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2553070.2553075",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Nov 27 15:50:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "For green networking, Sliced Router Architecture was
proposed, which controls the power consumption of
routers by adjusting the routers' performance on the
basis of the volume of traffic. In this architecture,
traffic prediction is used for appropriate power
control of router. For obtaining the efficient gain of
power reduction, we need to consider the impact of
overestimation or underestimation. In this paper, we
propose a traffic prediction method by considering the
impact of overestimate and underestimate on power
efficiency and processing performance of Sliced Router
Architecture. We evaluate our method by trace-driven
simulations with real traffic, we show that our
approach can control the power consumption of Sliced
Router without significant performance degradation.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kamga:2013:CFE,
author = "Christine Mayap Kamga",
title = "{CPU} frequency emulation based on {DVFS}",
journal = j-OPER-SYS-REV,
volume = "47",
number = "3",
pages = "34--41",
month = dec,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2553070.2553076",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Nov 27 15:50:29 MST 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Nowadays, virtualization is present in almost all
computing infrastructures. Thanks to VM migration and
server consolidation, virtualization helps in reducing
power consumption in distributed environments. On
another side, Dynamic Voltage and Frequency Scaling
(DVFS) allows servers to dynamically modify the
processor frequency (according to the CPU load) in
order to achieve less energy consumption. We observe
that DVFS is mainly used, but still generates a waste
of energy. In fact, the DVFS frequency scaling policies
are based on advertised processor frequency. By default
and thanks to the on-demand governor, it scales up or
down the processor frequency according to the current
load and the different predefined threshold (up and
down). However, the set of frequencies constitutes a
discrete range of frequencies. In this case, the
frequency required for a specific load will almost be
scaled to a frequency more higher than expected; which
leads to a non-efficient use of energy. In this paper,
we analyze and address a way of emulating a precise CPU
frequency thanks to the DVFS management in virtualized
environments. We implemented and evaluated our
prototype in the Xen hypervisor.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Noureddine:2013:REM,
author = "Adel Noureddine and Romain Rouvoy and Lionel
Seinturier",
title = "A review of energy measurement approaches",
journal = j-OPER-SYS-REV,
volume = "47",
number = "3",
pages = "42--49",
month = dec,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2553070.2553077",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Nov 27 15:50:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Reducing the energy footprint of digital devices and
software is a task challenging the research in Green
IT. Researches have proposed approaches for energy
management, ranging from reducing usage of software and
hardware, compiler optimization, to server
consolidation and software migration. However,
optimizing the energy consumption requires knowledge of
that said consumption. In particular, measuring the
energy consumption of hardware and software is an
important requirement for efficient energy
strategies. In this review, we outline the different
categories of approaches in energy measurements, and
provide insights into example of each category. We draw
recommendations from our review on requirements on how
to efficiently measure energy consumption of devices
and software.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2013:PTD,
author = "Chengwel Wang and Soila P. Kavulya and Jiaqi Tan and
Liting Hu and Mahendra Kutare and Mike Kasick and
Karsten Schwan and Priya Narasimhan and Rajeev Gandhi",
title = "Performance troubleshooting in data centers: an
annotated bibliography?",
journal = j-OPER-SYS-REV,
volume = "47",
number = "3",
pages = "50--62",
month = dec,
year = "2013",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2553070.2553079",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Nov 27 15:50:29 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Leite:2014:BSC,
author = "Julius Leite and Raphael Guerra and Rivalino {Matias,
Jr.} and Ant{\^o}nio Augusto Fr{\"o}hlich",
title = "{Brazilian Symposium on Computer System Engineering,
November 4--8 2013, Niter{\'o}i, Brazil}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "1--1",
year = "2014",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:40:41 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pfitscher:2014:COD,
author = "Ricardo J. Pfitscher and Mauricio A. Pillon and Rafael
R. Obelheiro",
title = "Customer-oriented diagnosis of memory provisioning for
{IaaS} clouds",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "2--10",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626403",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Infrastructure-as-a-service clouds enable customers to
use computing resources in a flexible manner to satisfy
their needs, and pay only for the allocated resources.
One challenge for IaaS customers is the correct
provisioning of their resources. Many users end up
underprovisioning, hurting application performance, or
overprovisioning, paying for resources that are not
really necessary. Memory is an essential resource for
any computing system, and is frequently a
performance-limiting factor in cloud environments. In
this work, we propose a model that enables cloud
customers to determine whether the memory allocated to
their virtual machines is correctly provisioned,
underprovisioned, or overprovisioned. The model uses
two metrics collected inside a VM, resident and
committed memory, and defines thresholds for these
metrics that characterize each provisioning level.
Experimental results with Linux guests on Xen, running
four benchmarks with different workloads and varying
memory capacity, show that the model was able to
accurately diagnose memory provisioning in 98\% of the
scenarios evaluated.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Freitas:2014:PET,
author = "Allan Edgard Silva Freitas and Raimundo Jos{\'e} de
Ara{\'u}jo Mac{\^e}do",
title = "A performance evaluation tool for hybrid and dynamic
distributed systems",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "11--18",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626404",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Distributed systems are usually modeled by a set of
distributed processes spread over a number of networked
computers. Such processes communicate and synchronize
themselves by message passing through communication
channels. Processes and communication channels can be
characterized by synchronous or asynchronous timeliness
behavior, according to the characteristics of
underlying systems (operating system and communication
sub-system). Unlike conventional distributed systems,
the timeliness characteristics of dynamic and hybrid
distributed systems may vary over time, according to
the availability of resources and occurrence of
failures. Such systems are becoming common today
because of the increasing diversity and heterogeneity
of computer networks and associated devices. Due to
their high complexity, these systems are difficult to
test or verify. In this paper, we introduce a novel
simulation tool for such environments, where distinct
fault models and timeliness properties can be
dynamically assigned to processes and communication
channels. Such a tool is meant not only for protocol
evaluation but also for prototyping, allowing code
reuse in real applications.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cachin:2014:WRH,
author = "Christian Cachin and Robbert van Renesse",
title = "Workshop Report: {HotDep 2013 --- The 9th Workshop on
Hot Topics in Dependable Systems}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "19--20",
month = jan,
year = "2014",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vogt:2014:TEM,
author = "Dirk Vogt and Cristiano Giuffrida and Herbert Bos and
Andrew S. Tanenbaum",
title = "Techniques for efficient in-memory checkpointing",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "21--25",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626406",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Checkpointing is a pivotal technique in system
research, with applications ranging from crash recovery
to replay debugging. In this paper, we evaluate a
number of in-memory checkpointing techniques and
compare their properties. We also present a new
compiler-based checkpointing scheme which improves
state-of-the-art performance and memory guarantees in
the general case. Our solution relies on a shadow state
to efficiently store incremental in-memory checkpoints,
at the cost of a smaller user-addressable virtual
address space. Contrary to common belief, our results
show that in-memory checkpointing can be implemented
efficiently with moderate impact on production
systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pillai:2014:TEP,
author = "Thanumalayan Sankaranarayana Pillai and Vijay
Chidambaram and Joo-Young Hwang and Andrea C.
Arpaci-Dusseau and Remzi H. Arpaci-Dusseau",
title = "Towards efficient, portable application-level
consistency",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "26--31",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626407",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Applications employ complex protocols to ensure
consistency after system crashes. Such protocols are
affected by the exact behavior of file systems.
However, modern file systems vary widely in such
behavior, reducing the correctness and performance of
applications. In this paper, we study application-level
crash consistency. Through the detailed study of two
popular database libraries (SQLite, LevelDB), we show
that application performance and correctness heavily
depend on file-system properties previously ignored in
research. We define a number of such properties and
show that they vary widely among file systems. We
conclude with implications for future file-system and
dependability research.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vaid:2014:FFC,
author = "Kushagra Vaid and Lin Zhong",
title = "Fuel, fans, and cores --- an introduction to selected
papers from {HotPower 2013}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "32--33",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2627737",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Endo:2014:CCA,
author = "Hiroshi Endo and Hiroyoshi Kodama and Hiroyuki Fukuda
and Toshio Sugimoto and Takashi Horie and Masao Kondo",
title = "Cooperative control architecture of fan-less servers
and fresh-air cooling in container servers for low
power operation",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "34--38",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626409",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In order to minimize the container server power
consumption, a new cooling system that incorporates
fan-less servers and fresh-air cooling is proposed. In
a conventional container data center, the required air
flow for sever cooling is supplied by both server
built-in fans and container facility fans. Therefore,
this work has been carried out on fan-less servers to
reduce power consumption. Although fanless servers are
expected to reduce power consumption, facility fans
have to provide excessive air to secure a safe
operation of servers. In order to achieve optimized
air-flow from facility fans to cool fan-less servers, a
power saving control system incorporating the IT system
and cooling facilities is proposed. Here, facility fans
are controlled based on server information such as CPU
temperature, rack position and so on. Through this
study, we suggest that the minimum point in total power
consumption of the container server with no performance
penalty existed by the trade-off relationship between
the power consumption changes of servers and of
facility fans with CPU temperature. This enables us to
operate the server system with minimized power
consumption depending on the air temperature. To verify
the energy-saving effect of this technology, a
prototype container server with the proposed system was
constructed. As a result, 22.8\% energy saving was
achieved with this new system, compared with the
conventional container servers with built-in fans.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Riekstin:2014:NME,
author = "Ana Carolina Riekstin and Sean James and Aman Kansal
and Jie Liu and Eric Peterson",
title = "No more electrical infrastructure: towards fuel cell
powered data centers",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "39--43",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626410",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We consider the use of fuel cells for powering data
centers, based on benefits in reliability, capital and
operational costs, and reduced environmental emissions.
Using fuel cells effectively in data centers introduces
several challenges and we highlight key research
questions for designing a fuel cell based data center
power distribution system. We analyze a specific
configuration in the design space to quantify the cost
benefits for a large scale data center, for the most
mature and commonly deployed fuel cell technology,
achieving over 20\% reduction in costs using
conservative projections.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Carroll:2014:MMU,
author = "Aaron Carroll and Gernot Heiser",
title = "Mobile multicores: use them or waste them",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "44--48",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626411",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Energy management is a primary consideration in the
design of modern smartphones, made more interesting by
the recent proliferation of multi-core processors in
this space. We investigate how core offlining and DVFS
can be used together on these systems to reduce energy
consumption. We show that core offlining leads to very
modest savings in the best circumstances, with a heavy
penalty in others, and show the cause of this to be low
per-core idle power. We develop a policy in Linux that
exploits this fact, and show that it improves up to
25\% on existing implementations.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eriksen:2014:YSF,
author = "Marius Eriksen",
title = "Your server as a function",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "51--57",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626413",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Building server software in a large-scale setting,
where systems exhibit a high degree of concurrency and
environmental variability, is a challenging task to
even the most experienced programmer. Efficiency,
safety, and robustness are paramount-goals which have
traditionally conflicted with modularity, reusability,
and flexibility. We describe three abstractions which
combine to present a powerful programming model for
building safe, modular, and efficient server software:
Composable futures are used to relate concurrent,
asynchronous actions; services and filters are
specialized functions used for the modular composition
of our complex server software. Finally, we discuss our
experiences using these abstractions and techniques
throughout Twitter's serving infrastructure.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Keller:2014:FSD,
author = "Gabriele Keller and Toby Murray and Sidney Amani and
Liam O'Connor and Zilin Chen and Leonid Ryzhyk and
Gerwin Klein and Gernot Heiser",
title = "File systems deserve verification too!",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "58--64",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626414",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "File systems are too important, and current ones are
too buggy, to remain unverified. Yet the most
successful verification methods for functional
correctness remain too expensive for current file
system implementations-we need verified correctness but
at reasonable cost. This paper presents our vision and
ongoing work to achieve this goal for a new
high-performance flash file system, called BilbyFs.
BilbyFs is carefully designed to be highly modular, so
it can be verified against a high-level functional
specification one component at a time. This modular
implementation is captured in a set of domain specific
languages from which we produce the design-level
specification, as well as its optimised C
implementation. Importantly, we also automatically
generate the proof linking these two artefacts. The
combination of these features dramatically reduces
verification effort. Verified file systems are now
within reach for the first time.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Burtsev:2014:WSL,
author = "Anton Burtsev and Nikhil Mishrikoti and Eric Eide and
Robert Ricci",
title = "{Weir}: a streaming language for performance
analysis",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "65--70",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626415",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "For modern software systems, performance analysis can
be a challenging task. The software stack can be a
complex, multi-layer, multi-component, concurrent, and
parallel environment with multiple contexts of
execution and multiple sources of performance data.
Although much performance data is available, because
modern systems incorporate many mature data-collection
mechanisms, analysis algorithms suffer from the lack of
a unifying programming environment for processing the
collected performance data, potentially from multiple
sources, in a convenient and script-like manner. This
paper presents Weir, a streaming language for systems
performance analysis. Weir is based on the insight that
performance-analysis algorithms can be naturally
expressed as stream-processing pipelines. In Weir, an
analysis algorithm is implemented as a graph composed
of stages, where each stage operates on a stream of
events that represent collected performance
measurements. Weir is an imperative streaming language
with a syntax designed for the convenient construction
of stream pipelines that utilize composable and
reusable analysis stages. To demonstrate practical
application, this paper presents the authors'
experience in using Weir to analyze performance in
systems based on the Xen virtualization platform.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bhaskaran:2014:BCS,
author = "Meenakshi Sundaram Bhaskaran and Jian Xu and Steven
Swanson",
title = "{Bankshot}: caching slow storage in fast non-volatile
memory",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "73--81",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626417",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Emerging non-volatile storage (e.g., Phase Change
Memory, STTRAM) allow access to persistent data at
latencies an order of magnitude lower than SSDs. The
density and price gap between NVMs and denser storage
make NVM economically most suitable as a cache for
larger, more conventional storage (i.e., NAND
flash-based SSDs and disks). Existing storage caching
architectures (even those that use fast flash-based
SSDs) introduce significant software overhead that can
obscure the performance benefits of faster memories. We
propose Bankshot, a caching architecture that allows
cache hits to bypass the OS (and the associated
software overheads) entirely, while relying on the OS
for heavy-weight operations like servicing misses and
performing write backs. We evaluate several design
decisions in Bankshot including different cache
management policies and different levels of hardware,
software support for tracking dirty data and
maintaining meta-data. We find that with hardware
support Bankshot can offer up to 5x speedup over
conventional caching systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2014:PCM,
author = "Hyojun Kim and Sangeetha Seshadri and Clement L.
Dickey and Lawrence Chiu",
title = "Phase change memory in enterprise storage systems:
silver bullet or snake oil?",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "82--89",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626418",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Storage devices based on Phase Change Memory (PCM)
devices are beginning to generate considerable
attention in both industry and academic communities.
But whether the technology in its current state will be
a commercially and technically viable alternative to
entrenched technologies such as flash-based SSDs still
remains unanswered. To address this it is important to
consider PCM SSD devices not just from a device
standpoint, but also from a holistic perspective. This
paper presents the results of our performance
measurement study of a recent all-PCM SSD prototype.
The average latency for 4 KB random read is 6.7 $\mu$s,
which is about 16x faster than a comparable eMLC flash
SSD. The distribution of I/O response times is also
much narrower than the flash SSD for both reads and
writes. Based on real-world workload traces, we model a
hypothetical storage device which consists of flash,
HDD, and PCM to identify the combinations of device
types that offer the best performance within cost
constraints. Our results show that --- even at current
price points --- PCM storage devices show promise as a
new component in multi-tiered enterprise storage
systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oh:2014:IPL,
author = "Yongseok Oh and Jongmoo Choi and Donghee Lee and Sam
H. Noh",
title = "Improving performance and lifetime of the {SSD}
{RAID}-based host cache through a log-structured
approach",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "90--97",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626419",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper proposes a cost-effective and reliable SSD
host cache solution that we call SRC (SSD RAID Cache).
Cost-effectiveness is brought about by using multiple
low-cost SSDs and reliability is enhanced through
RAID-based data redundancy. RAID, however, is managed
in a log-structured manner on multiple SSDs effectively
eliminating the detrimental read-modify-write
operations found in conventional RAID-5. Within the
proposed framework, we also propose to eliminate parity
blocks for stripes that are composed of clean blocks as
the original data resides in primary storage. We also
propose the use of destaging, instead of garbage
collection, to make space in the cache when the SSD
cache is full. We show that the proposed techniques
have significant implications on the performance of the
cache and lifetime of the SSDs that comprise the cache.
Finally, we study various ways in which stripes can be
formed based on data and parity block allocation
policies. Our experimental results using different
realistic I/O workloads show using the SRC scheme is on
average 59\% better than the conventional SSD cache
scheme supporting RAID-5. In case of lifetime, our
results show that SRC reduces the erase count of the
SSD drives by an average of 47\% compared to the RAID-5
scheme.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{vanRenesse:2014:SBF,
author = "Robbert van Renesse",
title = "The story behind the first {SIGOPS Dennis M. Ritchie
Doctoral Dissertation Award}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "98--102",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626421",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stewart:2014:WDS,
author = "Christopher Stewart and Vishakha Gupta",
title = "The {Workshop on Diversity in Systems Research 2013}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "103--106",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626422",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Amani:2014:AVA,
author = "Sidney Amani and Peter Chubb and Alastair F. Donaldson
and Alexander Legg and Keng Chai Ong and Leonid Ryzhyk
and Yanjin Zhu",
title = "Automatic verification of active device drivers",
journal = j-OPER-SYS-REV,
volume = "48",
number = "1",
pages = "106--118",
month = jan,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2626401.2626424",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed May 21 12:22:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We develop a practical solution to the problem of
automatic verification of the interface between device
drivers and the operating system. Our solution relies
on a combination of improved driver architecture and
verification tools. Unlike previous proposals for
verification-friendly drivers, our methodology supports
drivers written in C and can be implemented in any
existing OS. Our Linux-based evaluation shows that this
methodology amplifies the power of existing model
checking tools in detecting driver bugs, making it
possible to verify properties that are beyond the reach
of traditional techniques.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Correia:2014:CCD,
author = "Miguel Correia and Neeraj Mittal",
title = "Cloud Computing Dependability: Report and Extended
Papers of the {Second International Workshop on
Dependability Issues in Cloud Computing}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "2",
pages = "1--2",
month = jul,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2694737.2694739",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Dec 5 19:05:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nostro:2014:ITA,
author = "Nicola Nostro and Andrea Ceccarelli and Andrea
Bondavalli and Francesco Brancati",
title = "Insider Threat Assessment: a Model-Based Methodology",
journal = j-OPER-SYS-REV,
volume = "48",
number = "2",
pages = "3--12",
month = jul,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2694737.2694740",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Dec 5 19:05:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Security is a major challenge for today's companies,
especially ICT ones which manage large scale
cyber-critical systems. Amongst the multitude of
attacks and threats to which a system is potentially
exposed, there are insider attackers i.e., users with
legitimate access which abuse or misuse of their power,
thus leading to unexpected security violation (e.g.,
acquire and disseminate sensitive information). These
attacks are very difficult to detect and mitigate due
to the nature of the attackers, which often are
company's employees motivated by socio-economical
reasons, and to the fact that attackers operate within
their granted restrictions. It is a consequence that
insider attackers constitute an actual threat for ICT
organizations. In this paper we present our
methodology, together with the application of existing
supporting libraries and tools from the
state-of-the-art, for insider threats assessment and
mitigation. The ultimate objective is to define the
motivations and the target of an insider, investigate
the likeliness and severity of potential violations,
and finally identify appropriate countermeasures. The
methodology also includes a maintenance phase during
which the assessment can be updated to reflect system
changes. As case study, we apply our methodology to the
crisis management system Secure!, which includes
different kinds of users and consequently is
potentially exposed to a large set of insider
threats.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bessani:2014:TPC,
author = "Alysson Bessani and Leucio A. Cutillo and Gianluca
Ramunno and Norbert Schirmer and Paolo Smiraglia",
title = "The {TClouds} Platform: From the Concept to the
Implementation of Benchmark Scenarios",
journal = j-OPER-SYS-REV,
volume = "48",
number = "2",
pages = "13--22",
month = jul,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2694737.2694741",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Dec 5 19:05:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "TClouds was an EU project (2010--2013) targeted at
improving the security and the dependability of cloud
infrastructures and services, especially for supporting
critical applications. During the project, the
participants of the consortium developed a platform
containing a portfolio of solutions for improving the
state of the art in cloud security and dependability.
Here we present an overview of these solutions and two
examples of how they can be integrated to provide
security for critical cloud-based applications.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tetzlaff:2014:SPT,
author = "William Tetzlaff",
title = "{SOSP Professional Travel Scholarship}: Reflections by
Recipient {William Tetzlaff}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "2",
pages = "23--23",
month = jul,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2694737.2694743",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Dec 5 19:05:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gray:2014:SPT,
author = "Cary Gray",
title = "{SOSP Professional Travel Scholarship}: Reflections by
Recipient {Cary Gray}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "2",
pages = "24--24",
month = jul,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2694737.2694744",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Dec 5 19:05:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Baruchi:2014:SPT,
author = "Artur Baruchi",
title = "{SOSP Professional Travel Scholarship}: Reflections by
Recipient {Artur Baruchi}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "2",
pages = "25--25",
month = jul,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2694737.2694745",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Dec 5 19:05:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Terry:2014:RFT,
author = "Doug Terry",
title = "A Report on the {First TRIOS Conference}",
journal = j-OPER-SYS-REV,
volume = "48",
number = "2",
pages = "26--34",
month = jul,
year = "2014",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2694737.2694746",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Dec 5 19:05:52 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Eide:2015:FSI,
author = "Eric Eide",
title = "Foreword: Special Issue on Repeatability and Sharing
of Experimental Artifacts",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "1--2",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723874",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Welcome to this special issue of Operating Systems
Review dedicated to the topics of repeatability and
sharing of experimental artifacts in systems research.
The twelve papers in this issue present a snapshot of
activities, results, and viewpoints on this theme. As
the guest editor of this issue, I hope that you find
these papers to be both inspiring and useful. I hope
that by reading them, you will be motivated to
carefully think about repeatability and artifact
sharing as you pursue your own systems experiments.
Several of the papers in this special issue present
tools or testbeds that support repeatability and
sharing, so I expect that you will discover one or more
``new tricks'' that will make it easier for you to
create and share high-quality, sound, and repeatable
experiments.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Feitelson:2015:RRC,
author = "Dror G. Feitelson",
title = "From Repeatability to Reproducibility and
Corroboration",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "3--11",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723875",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Being able to repeat experiments is considered a
hallmark of the scientific method, used to confirm or
refute hypotheses and previously obtained results. But
this can take many forms, from precise repetition using
the original experimental artifacts, to conceptual
reproduction of the main experimental idea using new
artifacts. Furthermore, the conclusions from previous
work can also be corroborated using a different
experimental methodology altogether. In order to
promote a better understanding and use of such
methodologies we propose precise definitions for
different terms, and suggest when and why each should
be used.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Howard:2015:RRD,
author = "Heidi Howard and Malte Schwarzkopf and Anil
Madhavapeddy and Jon Crowcroft",
title = "Raft Refloated: Do We Have Consensus?",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "12--21",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723876",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Paxos algorithm is famously difficult to reason
about and even more so to implement, despite having
been synonymous with distributed consensus for over a
decade. The recently proposed Raft protocol lays claim
to being a new, understandable consensus algorithm,
improving on Paxos without making compromises in
performance or correctness. In this study, we repeat
the Raft authors' performance analysis. We developed a
clean-slate implementation of the Raft protocol and
built an event-driven simulation framework for
prototyping it on experimental topologies. We propose
several optimizations to the Raft protocol and
demonstrate their effectiveness under contention.
Finally, we empirically validate the correctness of the
Raft protocol invariants and evaluate Raft's
understandability claims.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Varia:2015:AAS,
author = "Mayank Varia and Benjamin Price and Nicholas Hwang and
Ariel Hamlin and Jonathan Herzog and Jill Poland and
Michael Reschly and Sophia Yakoubov and Robert K.
Cunningham",
title = "Automated Assessment of Secure Search Systems",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "22--30",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723877",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This work presents the results of a three-year project
that assessed nine different privacy-preserving data
search systems. We detail the design of a software
assessment framework that focuses on low system
footprint, repeatability, and reusability. A unique
achievement of this project was the automation and
integration of the entire test process, from the
production and execution of tests to the generation of
human-readable evaluation reports. We synthesize our
experiences into a set of simple mantras that we
recommend following in the design of any assessment
framework.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aldaco:2015:LAN,
author = "Abraham N. Aldaco and Charles J. Colbourn and Violet
R. Syrotiuk",
title = "Locating Arrays: a New Experimental Design for
Screening Complex Engineered Systems",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "31--40",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723878",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The purpose of a screening experiment is to identify
significant factors and interactions on a response for
a system. Engineered systems are complex in part due to
their size. To apply traditional experimental designs
for screening in complex engineered systems requires
either restricting the factors considered, which
automatically restricts the interactions to those in
the set, or restricting interest to main effects, which
fails to consider any possible interactions. To address
this problem we propose a locating array (LA) as a
screening design. Locating arrays exhibit logarithmic
growth in the number of factors because their focus is
on identification rather than on measurement. This
makes practical the consideration of an order of
magnitude more factors in experimentation than
traditional screening designs. We present preliminary
results applying an LA for screening the response of
TCP throughput in a simulation model of a mobile
wireless network. The full-factorial design for this
system is infeasible (over 1043 design points!) yet an
LA has only 421 design points. We validate the
significance of the identified factors and interactions
independently using the statistical software JMP.
Screening using locating arrays is viable and yields
useful models.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abedi:2015:CRE,
author = "Ali Abedi and Andrew Heard and Tim Brecht",
title = "Conducting Repeatable Experiments and Fair Comparisons
using {802.11n MIMO} Networks",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "41--50",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723879",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A commonly used technique for evaluating and comparing
the performance of systems using 802.11 (WiFi) networks
is to conduct experiments. This approach is appealing
and important because it inherently captures critical
properties of wireless signal transmission that are
difficult to analytically model and simulate.
Unfortunately, obtaining consistent and statistically
meaningful empirical results using 802.11 networks,
even in well-controlled environments, can be quite
challenging and time consuming because channel
conditions can vary over time. In this paper, we use
2.4 and 5 GHz 802.11n MIMO networks to study different
methodologies that could be used to evaluate and
compare the performance of different alternatives used
in 802.11 systems (e.g., different systems,
configurations or algorithms). We first illustrate that
some of the more commonly used methods in existing
research are flawed and explain why. We then describe a
methodology called multiple interleaved trials that, to
our knowledge, has not been used for, or studied on,
802.11 networks. We evaluate this methodology and find
that it can be used to repeat experiments and to
compare the performance of different alternatives.
Finally, we discuss other possible applications of this
approach for comparative performance evaluations.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dietrich:2015:DVS,
author = "Christian Dietrich and Daniel Lohmann",
title = "The dataref versuchung: Saving Time through Better
Internal Repeatability",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "51--60",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723880",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Compared to more traditional disciplines, such as the
natural sciences, computer science is said to have a
somewhat sloppy relationship with the external
repeatability of published results. However, from our
experience the problem starts even earlier: In many
cases, authors are not even able to replicate their own
results a year later, or to explain how exactly that
number on page three of the paper was computed.
Because of constant time pressure and strict submission
deadlines, the successful researcher has to favor
timely results over experiment documentation and data
traceability. We consider internal repeatability to be
one of the most important prerequisites for external
replicability and the scientific process. We describe
our approach to foster internal repeatability in our
own research projects with the help of dedicated tools
for the automation of traceable experimental setups and
for data presentation in scientific papers. By
employing these tools, measures for ensuring internal
repeatability no longer waste valuable working time and
pay off quickly: They save time by eliminating
recurring, and therefore error-prone, manual work
steps, and at the same time increase confidence in
experimental results.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Stanisic:2015:EGO,
author = "Luka Stanisic and Arnaud Legrand and Vincent Danjean",
title = "An Effective Git and Org-Mode Based Workflow for
Reproducible Research",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "61--70",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723881",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper we address the question of developing a
lightweight and effective workflow for conducting
experimental research on modern parallel computer
systems in a reproducible way. Our approach builds on
two well-known tools (Git and Org-mode) and enables to
address, at least partially, issues such as running
experiments, provenance tracking, experimental setup
reconstruction or replicable analysis. We have been
using such a methodology for two years now and it
enabled us to recently publish a fully reproducible
article [12]. To fully demonstrate the effectiveness of
our proposal, we have opened our two year laboratory
notebook with all the attached experimental data. This
notebook and the underlying Git revision control system
enable to illustrate and to better understand the
workflow we used.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Boettiger:2015:IDR,
author = "Carl Boettiger",
title = "An introduction to {Docker} for reproducible
research",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "71--79",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723882",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As computational work becomes more and more integral
to many aspects of scientific research, computational
reproducibility has become an issue of increasing
importance to computer systems researchers and domain
scientists alike. Though computational reproducibility
seems more straight forward than replicating physical
experiments, the complex and rapidly changing nature of
computer environments makes being able to reproduce and
extend such work a serious challenge. In this paper, I
explore common reasons that code developed for one
research project cannot be successfully executed or
extended by subsequent researchers. I review current
approaches to these issues, including virtual machines
and workflow systems, and their limitations. I then
examine how the popular emerging technology Docker
combines several areas from systems research --- such
as operating system virtualization, cross-platform
portability, modular re-usable elements, versioning,
and a 'DevOps' philosophy, to address these challenges.
I illustrate this with several examples of Docker use
with a focus on the R statistical environment.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ruiz:2015:RSA,
author = "Cristian Ruiz and Salem Harrache and Michael Mercier
and Olivier Richard",
title = "Reconstructable Software Appliances with {Kameleon}",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "80--89",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723883",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A software appliance builder bundles together an
application with its needed middleware and an operating
system to allow easy deployment on Infrastructure as a
Service (IaaS) providers. These builders have the
potential to address a key need in our community: the
ability to reproduce an experiment. This paper reports
the experiences on developing a software appliance
builder called Kameleon that leverages popular and well
tested tools. Kameleon simplifies the creation of
complex software appliances that are targeted at
research on operating systems, HPC and distributed
computing. It does so by proposing a highly modular
description format that encourages collaboration and
reuse of procedures. Moreover, it provides debugging
mechanisms for improving experimenter's productivity.
To justify that our appliance builder stands above
others, we compare it with the most known tools used by
developers and researchers to automate the construction
of software environments for virtual machines and IaaS
infrastructures.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Edwards:2015:CRC,
author = "Sarah Edwards and Xuan Liu and Niky Riga",
title = "Creating Repeatable Computer Science and Networking
Experiments on Shared, Public Testbeds",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "90--99",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723884",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "There are many compelling reasons to use a shared,
public testbed such as GENI, Emulab, or PlanetLab to
conduct experiments in computer science and networking.
These testbeds support creating experiments with a
large and diverse set of resources. Moreover these
testbeds are constructed to inherently support the
repeatability of experiments as required for
scientifically sound research. Finally, the artifacts
needed for a researcher to repeat their own experiment
can be shared so that others can readily repeat the
experiment in the same environment. However using a
shared, public testbed is different from conducting
experiments on resources either owned by the
experimenter or someone the experimenter knows.
Experiments on shared, public testbeds are more likely
to use large topologies, use scarce resources, and need
to be tolerant to outages and maintenances in the
testbed. In addition, experimenters may not have access
to low-level debugging information. This paper
describes a methodology for new experimenters to write
and deploy repeatable and sharable experiments which
deal with these challenges by: having a clear plan;
automating the execution and analysis of an experiment
by following best practices from software engineering
and system administration; and building scalable
experiments. In addition, the paper describes a case
study run on the GENI testbed which illustrates the
methodology described.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ricci:2015:APR,
author = "Robert Ricci and Gary Wong and Leigh Stoller and Kirk
Webb and Jonathon Duerig and Keith Downie and Mike
Hibler",
title = "{Apt}: a Platform for Repeatable Research in Computer
Science",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "100--107",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723885",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Repeating research in computer science requires more
than just code and data: it requires an appropriate
environment in which to run experiments. In some cases,
this environment appears fairly straightforward: it
consists of a particular operating system and set of
required libraries. In many cases, however, it is
considerably more complex: the execution environment
may be an entire network, may involve complex and
fragile configuration of the dependencies, or may
require large amounts of resources in terms of
computation cycles, network bandwidth, or storage. Even
the ``straightforward'' case turns out to be
surprisingly intricate: there may be explicit or hidden
dependencies on compilers, kernel quirks, details of
the ISA, etc. The result is that when one tries to
repeat published results, creating an environment
sufficiently similar to one in which the experiment was
originally run can be troublesome; this problem only
gets worse as time passes. What the computer science
community needs, then, are environments that have the
explicit goal of enabling repeatable research. This
paper outlines the problem of repeatable research
environments, presents a set of requirements for such
environments, and describes one facility that attempts
to address them.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Childers:2015:RPA,
author = "Bruce R. Childers and Alex K. Jones and Daniel
Moss{\'e}",
title = "A Roadmap and Plan of Action for Community-Supported
Empirical Evaluation in Computer Architecture",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "108--117",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723886",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "A framework of open interoperable simulators for
computer architecture is long overdue. Today there are
many separate, uncoordinated efforts to develop
simulation and modeling artifacts (tools) for computer
architecture research. The artifacts are used to
empirically evaluate new computer architecture
innovations and compare them with the state of the art.
The artifacts are usually developed by individual
groups, often for a specific purpose, and may not be
publicly released. Consequently, it is difficult to
leverage investment in artifact development and to
repeat or reproduce experiments. In this position
paper, we present recommendations and a roadmap for
sharing and building open-source, interoperable
simulation and modeling artifacts. The recommendations
are the outcome of a community workshop involving
industry, government and academia to determine how to
coordinate effort, share tools and improve
methodology.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chockler:2015:LWL,
author = "Gregory Chockler and Flavio Junqueira and Rodrigo
Rodrigues and Ymir Vigfusson",
title = "{LADIS'14: 8th Workshop on Large-Scale Distributed
Systems and Middleware}",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "118--120",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723888",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Balegas:2015:TFI,
author = "Valter Balegas and S{\'e}rgio Duarte and Carla
Ferreira and Rodrigo Rodrigues and Nuno Pregui{\c{c}}a
and Mahsa Najafzadeh and Marc Shapiro",
title = "Towards Fast Invariant Preservation in Geo-replicated
Systems",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "121--125",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723889",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Today's global services and applications are expected
to be highly available, scale to an unprecedented
number of clients, and offer reliable, low-latency
operations. This can be achieved through
geo-replication, particularly when data consistency is
relaxed. There are, however, applications whose data
must obey global invariants at all times. Strong
consistency protocols easily address this issue, but
require global coordination among replicas and
inevitably degrade application throughput and latency.
While coordination is an inherent requirement for
maintaining global application invariants, there are
instances where coordination on a per operation basis
can be avoided. In particular, it has been shown that
either moving coordination outside the critical path
for executing operations, or having one coordination
round for multiple operations, are both effective ways
to maintain global invariants and avoid most of the
penalties of coordination. However, current
georeplication protocols still have not taken advantage
of these observations. In this paper, we review the
design space of current solutions for building
geo-replicated applications and present our guiding
vision towards a general technique for providing global
application invariants under eventual consistency, as a
much cheaper alternative to strong consistency.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Paiva:2015:DPD,
author = "Jo{\~a}o Paiva and Lu{\'\i}s Rodrigues",
title = "On Data Placement in Distributed Systems",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "126--130",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723890",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Data placement refers to the problem of deciding how
to assign data items to nodes in a distributed system
to optimize one or several of a number of performance
criteria such as reducing network congestion, improving
load balancing, among others. This document reports on
our experience when addressing this problem in
distributed systems of different scales, namely: medium
size datacenter-scale and internet-scale systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birman:2015:BSP,
author = "Ken Birman and M{\'a}rk Jelasity and Robert Kleinberg
and Edward Tremel",
title = "Building a Secure and Privacy-Preserving {Smart
Grid}",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "131--136",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723891",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "New technologies for computerized metering and data
collection in the electrical power grid promise to
create a more efficient, cost-effective, and adaptable
smart grid. However, naive implementations of smart
grid data collection could jeopardize the privacy of
consumers, and concerns about privacy are a significant
obstacle to the rollout of smart grid technology. Our
work proposes a design for a smart metering system that
will allow utilities to use the collected data
effectively while preserving the privacy of individual
consumers.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jia:2015:SOC,
author = "Qin Jia and Zhiming Shen and Weijia Song and Robbert
van Renesse and Hakim Weatherspoon",
title = "Supercloud: Opportunities and Challenges",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "137--141",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723892",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Infrastructure as a Service (IaaS) clouds couple
applications tightly with the underlying
infrastructures and services. This vendor lock-in
problem forces users to apply ad-hoc deployment
strategies in order to tolerate cloud failures, and
limits the ability of doing virtual machine (VM)
migration and resource scaling across different clouds.
This paper presents the Supercloud, a cloud service
comprising resources obtained from several diverse IaaS
cloud providers, and discusses opportunities,
limitations, and future research directions. Currently,
the Supercloud has been deployed using resources from
several major cloud providers, including Amazon EC2,
Rackspace, HP Cloud, and some private clouds. VMs run
in a virtual network and can be migrated seamlessly
across different clouds, with different hypervisors and
device models. Using case studies we demonstrate that,
being able to deploy applications to more regions and
granting more control to end-users, the Supercloud can
reduce latency and cost compared to the underlying
cloud providers.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sard:2015:PPC,
author = "Petter S{\"a}rd and Benoit Hudzia and Steve Walsh and
Johan Tordsson and Erik Elmroth",
title = "Principles and Performance Characteristics of
Algorithms for Live {VM} Migration",
journal = j-OPER-SYS-REV,
volume = "49",
number = "1",
pages = "142--155",
month = jan,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2723872.2723894",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jan 21 06:46:22 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Since first demonstrated by Clark et al. in 2005, live
migration of virtual machines has both become a
standard feature of hypervisors and created an active
field of research. However, the rich ongoing research
in live migration focus mainly on performance
improvements to well-known techniques, most of them
being variations of the Clark approach. In order to
advance live migration beyond incremental performance
improvements, it is important to gain a deeper
understanding of the live migration problem itself and
its underlying principles. To address this issue, this
contribution takes a step back and investigates the
essential characteristics of live migration. The paper
identifies five fundamental properties of live
migration and uses these to investigate, categorize,
and compare three approaches to live migration:
precopy, postcopy and hybrid. The evaluated algorithms
include well-known techniques derived from that of
Clark as well as novel RDMA in-kernel approaches. Our
analysis of the fundamental properties of the
algorithms is validated by a set of experiments. In
these, we migrate virtual machines with large memory
sizes hosting workloads with high page dirtying rates
to expose differences and limitations of the different
approaches. Finally, we provide guidelines for which
approach to use in different scenarios.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barreto:2015:BSC,
author = "Raimundo Barreto and Rafael Obelheiro and Leandro
Becker",
title = "{Brazilian Symposium on Computing System
Engineering}",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "1--2",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883593",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gracioli:2015:DER,
author = "Giovani Gracioli and Ant{\^o}nio Augusto
Fr{\"o}hlich",
title = "On the Design and Evaluation of a Real-Time Operating
System for Cache-Coherent Multicore Architectures",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "2--16",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883594",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The uncontrolled use of the cache hierarchy in a
multicore processor by real-time tasks may impact their
worst-case execution times. Several operating system
techniques have been recently proposed to deal with
caches in a multiprocessor in order to improve
predictability, such as cache partitioning, cache
locking, and real-time scheduling. However, the
contention caused by the cache coherence protocol and
its implication for real-time tasks is still an open
problem. In this paper, we present the design and
evaluation of a real-time operating system for
cache-coherent multicore architectures. The real-time
operating system infrastructure includes real-time
schedulers, cache partitioning, and cache coherence
contention detection through hardware performance
counters. We evaluate the real-time operating system in
terms of run-time overhead, schedulability of realtime
tasks, cache partitioning performance, and hardware
performance counters usability. Our results indicate
that: (i) a real-time operating system designed from
scratch reduces the run-time overhead, and thus
improves the realtime schedulability, when compared to
a patched operating system; (ii) cache partitioning
reduces the contention in the shared cache and provides
safe real-time bounds; and (iii) hardware performance
counters can detect when real-time tasks interfere with
each other at the shared cache level. Scheduling, cache
partitioning, and hardware performance counters
together are a step-forward to provide real-time bounds
in cache-coherent architectures.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Desnoyers:2015:ITW,
author = "Peter Desnoyers and Gokul Kandiraju",
title = "{INFLOW 2015}: The {Third Workshop on Interactions of
NVM\slash FLash with Operating systems and Workload}:
{INFLOW'15} Message from the {Chairs}",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "17--17",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883596",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Debnath:2015:RHT,
author = "Biplob Debnath and Alireza Haghdoost and Asim Kadav
and Mohammed G. Khatib and Cristian Ungureanu",
title = "Revisiting Hash Table Design for Phase Change Memory",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "18--26",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883597",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Phase Change Memory (PCM) is emerging as an attractive
alternative to Dynamic Random Access Memory (DRAM) in
building data-intensive computing systems. PCM offers
read/write performance asymmetry that makes it
necessary to revisit the design of in-memory
applications. In this paper, we focus on in-memory hash
tables, a family of data structures with wide
applicability. We evaluate several popular hash-table
designs to understand their performance under PCM. We
find that for write-heavy workloads the designs that
achieve best performance for PCM differ from the ones
that are best for DRAM, and that designs achieving a
high load factor also cause a high number of memory
writes. Finally, we propose PFHT, a PCM-Friendly Hash
Table which presents a cuckoo hashing variant that is
tailored to PCM characteristics, and offers a better
trade-off between performance, the amount of writes
generated, and the expected load factor than any of the
existing DRAM-based implementations.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Santana:2015:FSS,
author = "Ricardo Santana and Raju Rangaswami and Vasily Tarasov
and Dean Hildebrand",
title = "A Fast and Slippery Slope for File Systems",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "27--34",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883598",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
abstract = "There is a vast number and variety of file systems
currently available, each optimizing for an ever
growing number of storage devices and workloads. Users
have an unprecedented, and somewhat overwhelming,
number of data management options. At the same time,
the fastest storage devices are only getting faster,
and it is unclear on how well the existing file systems
will adapt. Using emulation techniques, we evaluate
five popular Linux file systems across a range of
storage device latencies typical to low-end hard
drives, latest high-performance persistent memory block
devices, and in between. Our findings are often
surprising. Depending on the workload, we find that
some file systems can clearly scale with faster storage
devices much better than others. Further, as storage
device latency decreases, we find unexpected
performance inversions across file systems. Finally,
file system scalability in the higher device latency
range is not representative of scalability in the
lower, submillisecond, latency range. We then focus on
Nilfs2 as an especially alarming example of an
unexpectedly poor scalability and present detailed
instructions for identifying bottlenecks in the I/O
stack.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Borchert:2015:HLM,
author = "Christoph Borchert and Olaf Spinczyk",
title = "Hardening an {L4} Microkernel Against Soft Errors by
Aspect-Oriented Programming and Whole-Program
Analysis",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "37--43",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883600",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Transient hardware faults in computer systems have
become widespread as shrinking structures and low
supply voltages reduce the amount of energy needed to
trigger a fault. This paper describes the latest
improvements of a software-based fault-tolerance
mechanism called Generic Object Protection (GOP). It is
based on Aspect-Oriented Programming in AspectC++ and
has been used in a case study to harden the
L4/Fiasco.OC microkernel. As a result, the improved GOP
avoids 60\% of kernel failures at an acceptable
overhead of 19\% code size and less than 1\% runtime.
The GOP improvements use static whole-program analysis
and have been implemented in a prototypical manner. As
an outlook, the paper presents envisioned language
extensions providing whole-program control-flow and
data-flow analyses in future AspectC++ versions.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jacobsen:2015:LCD,
author = "Charles Jacobsen and Muktesh Khole and Sarah Spall and
Scotty Bauer and Anton Burtsev",
title = "Lightweight Capability Domains: Towards Decomposing
the {Linux} Kernel",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "44--50",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883601",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
abstract = "Despite a number of radical changes in how computer
systems are used, the design principles behind the very
core of the systems stack --- an operating system
kernel --- has remained unchanged for decades. We run
monolithic kernels developed with a combination of an
unsafe programming language, global sharing of data
structures, opaque interfaces, and no explicit
knowledge of kernel protocols. Today, the monolithic
architecture of a kernel is the main factor undermining
its security, and even worse, limiting its evolution
towards a safer, more secure environment. Lack of
isolation across kernel subsystems allows attackers to
take control over the entire machine with a single
kernel vulnerability. Furthermore, complex,
semantically rich monolithic code with globally shared
data structures and no explicit interfaces is not
amenable to formal analysis and verification tools.
Even after decades of work to make monolithic kernels
more secure, over a hundred serious kernel
vulnerabilities are still reported every year. Modern
kernels need decomposition as a practical means of
confining the effects of individual attacks.
Historically, decomposed kernels were prohibitively
slow. Today, the complexity of a modern kernel prevents
a trivial decomposition effort. We argue, however, that
despite all odds modern kernels can be decomposed.
Careful choice of communication abstractions and
execution model, a general approach to decomposition, a
path for incremental adoption, and automation through
proper language tools can address complexity of
decomposition and performance overheads of decomposed
kernels. Our work on lightweight capability domains
(LCDs) develops principles, mechanisms, and tools that
enable incremental, practical decomposition of a modern
operating system kernel.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yanok:2015:TLV,
author = "Ilya Yanok and Nathaniel Nystrom",
title = "{Tapir}: a Language for Verified {OS} Kernel Probes",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "51--56",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883602",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Kernel probes allow code to be inserted into a running
operating system kernel to gather information for
debugging or profiling. Inserting code into the kernel
raises a number of safety issues. Current solutions
follow one of the two paths: a VM-based approach, where
safety properties are checked dynamically by an
interpreter, or a static-analysis approach, where probe
code is guaranteed to be safe statically. While more
attractive, existing static solutions depend on ad-hoc
and error-prone analysis. We propose to explore
enforcing safety properties using a type system, thus
building our analysis on top of the well-studied ground
of type theory.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yuan:2015:MLF,
author = "Xinhao Yuan and David Williams-King and Junfeng Yang
and Simha Sethumadhavan",
title = "Making Lock-free Data Structures Verifiable with
Artificial Transactions",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "57--63",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883603",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Among all classes of parallel programming
abstractions, lock-free data structures are considered
one of the most scalable and efficient thanks to their
fine-grained style of synchronization. However, they
are also challenging for developers and tools to verify
because of the huge number of possible interleavings
that result from finegrained synchronizations. This
paper addresses this fundamental problem between
performance and verifiability of lock-free data
structure implementations. We present TXIT, a system
that greatly reduces the set of possible interleavings
by inserting transactions into the implementation of a
lock-free data structure. We leverage hardware
transactional memory support from Intel Haswell
processors to enforce these artificial transactions.
Evaluation on six popular lock-free data structure
libraries shows that TXIT makes it easy to verify
lock-free data structures while incurring acceptable
runtime overhead. Further analysis shows that two
inefficiencies in Haswell are the largest contributors
to this overhead.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bhat:2015:HEE,
author = "Sharath K. Bhat and Ajithchandra Saya and Hemedra K.
Rawat and Antonio Barbalace and Binoy Ravindran",
title = "Harnessing Energy Efficiency of Heterogeneous-{ISA}
Platforms",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "65--69",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883605",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With the emergence of both power and performance as
primary design constraints, energy efficiency has
become the new design criteria. A platform with
heterogeneous-ISA processors can provide multiple
power-performance execution points needed for a varied
mix of workloads. We argue that a new system software
architecture is needed to obtain maximum energy
efficiency on such heterogeneous-ISA platforms. We
present our system software, a replicated-kernel
operating system and a compiler framework, and quantify
the advantages of such a system software on ARM-x86
using simulations. Based on our experimental
observations, we propose a scheduling approach which
considers system and application runtime
characteristics along with platform profiles to
maximize energy efficiency.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hoque:2015:SDB,
author = "Mohammad A. Hoque and Sasu Tarkoma",
title = "Sudden Drop in the Battery Level?: Understanding
{Smartphone} State of Charge Anomaly",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "70--74",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883606",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Battery State of Charge (SOC) estimation is a
fundamental component of today's smartphones that
affects the internal processes and observable behavior
of the devices. This article systematically
investigates and analyzes the SOC estimation techniques
in smartphones. First, we discover that the voltage
curve of a given smartphone implicitly captures the
usable capacity of the battery while charging the
mobile device. Second, we observe that today's SOC
estimation techniques do not model battery capacity
loss sufficiently to accurately capture the usable
capacity. Finally, we report findings based on battery
analytics of 2077 devices that validate the
relationship between battery voltage and the usable
capacity of a device. The presented results enable the
development of more accurate battery gauges and
metering solutions thus resulting in better
power-saving decisions, recommendations for the users,
and most importantly more reliable system.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2015:MCC,
author = "Qiuyun Wang and Benjamin C. Lee",
title = "Modeling Communication Costs in Blade Servers",
journal = j-OPER-SYS-REV,
volume = "49",
number = "2",
pages = "75--79",
month = dec,
year = "2015",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2883591.2883607",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 21 12:18:28 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Datacenters demand big memory servers for big data.
For blade servers, which disaggregate memory across
multiple blades, we derive technology and architectural
models to estimate communication delay and energy.
These models permit new case studies in refusal
scheduling to mitigate NUMA and improve the energy
efficiency of data movement. Preliminary results show
that our model helps researchers coordinate NUMA
mitigation and queueing dynamics. We find that
judiciously permitting NUMA reduces queueing time,
benefiting throughput, latency and energy efficiency
for datacenter workloads like Spark. These findings
highlight blade servers' strengths and opportunities
when building distributed shared memory machines for
data analytics.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heiser:2016:RAP,
author = "Gernot Heiser and Kenji Kono and KyoungSoo Park and
Robbert van Renesse",
title = "Report on the {Asia--Pacific Systems Workshop 2015
(APSys'15)}",
journal = j-OPER-SYS-REV,
volume = "50",
number = "1",
pages = "1--2",
month = jan,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2903267.2903269",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 14 18:42:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chick:2016:SKG,
author = "Oliver R. A. Chick and Lucian Carata and James Snee
and Nikilesh Balakrishnan and Ripduman Sohan",
title = "Shadow Kernels: a General Mechanism For Kernel
Specialization in Existing Operating Systems",
journal = j-OPER-SYS-REV,
volume = "50",
number = "1",
pages = "3--8",
month = jan,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2903267.2903270",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 14 18:42:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Existing operating systems share a common kernel text
section amongst all processes. It is not possible to
perform kernel specialization or tuning such that
different applications execute text optimized for their
kernel use despite the benefits of kernel
specialization for performance guided optimization,
exokernels, kernel fastpaths, and cheaper hardware
access. Current specialization primitives involve
system wide changes to kernel text, which can have
adverse effects on other processes sharing the kernel
due to the global side-effects. We present shadow
kernels: a primitive that allows multiple kernel text
sections to coexist in a contemporary operating system.
By remapping kernel virtual memory on a context-switch,
or for individual system calls, we specialize the
kernel on a fine-grained basis. Our implementation of
shadow kernels uses the Xen hypervisor so can be
applied to any operating system that runs on Xen.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kashyap:2016:OSA,
author = "Sanidhya Kashyap and Changwoo Min and Taesoo Kim",
title = "Opportunistic Spinlocks: Achieving Virtual Machine
Scalability in the Clouds",
journal = j-OPER-SYS-REV,
volume = "50",
number = "1",
pages = "9--16",
month = jan,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2903267.2903271",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 14 18:42:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "With increasing demand for big-data processing and
faster in-memory databases, cloud providers are moving
towards large virtualized instances besides focusing on
the horizontal scalability. However, our experiments
reveal that such instances in popular cloud services
(e.g., 32 vCPUs with 208 GB supported by Google Compute
Engine) do not achieve the desired scalability with
increasing core count even with a simple,
embarrassingly parallel job (e.g., Linux kernel
compile). On a serious note, the internal
synchronization scheme (e.g., paravirtualized ticket
spinlock) of the virtualized instance on a machine with
higher core count (e.g., 80-core) dramatically degrades
its overall performance. Our finding is different from
the previously well-known scalability problem (i.e.,
lock contention problem) and occurs because of the
sophisticated optimization techniques implemented in
the hypervisor---what we call sleepy spinlock anomaly.
To solve this problem, we design and implement OTICKET,
a variant of paravirtualized ticket spinlock that
effectively scales the virtualized instances in both
undersubscribed and oversubscribed environments.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Oyamada:2016:BSC,
author = "M{\'a}rcio Oyamada and Ant{\^o}nio Augusto
Fr{\"o}hlich and Leandro Becker",
title = "{5th Brazilian Symposium on Computing System
Engineering}",
journal = j-OPER-SYS-REV,
volume = "50",
number = "1",
pages = "17--17",
month = jan,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2903267.2903273",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 14 18:42:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{dosSantos:2016:EAF,
author = "Caio Augusto R. dos Santos and Rivalino {Matias,
Jr.}",
title = "Exploratory Analysis on Failure Causes in a
Mass-Market Operating System",
journal = j-OPER-SYS-REV,
volume = "50",
number = "1",
pages = "18--30",
month = jan,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2903267.2903274",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 14 18:42:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Empirical studies in software reliability have
predominantly focused on end-user applications. Given
the intrinsic dependency of user programs on the
operating system (OS) software, OS failures can
severely impact even the most reliable applications.
Therefore, it is a major requirement to understand how
OS failures occur in order to improve software
reliability as a whole. In this paper, we present an
exploratory study on OS failure causes, based on 7,007
real failure records collected from different computers
running a mass-market operating system. We performed
quantitative and qualitative analyses to investigate
different properties of the OS failures analyzed. The
findings indicate that OS services failed more than any
other OS failure category. Empirical evidences
confirmed the presence of failure correlation in the
sample, where both cross-correlation and
autocorrelation were found; in particular, causal
relationship between different operating system
failures was observed.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Delabrida:2016:BWG,
author = "Saul Delabrida and Thiago D'Angelo and Ricardo A. R.
Oliveira and Antonio A. F. Loureiro",
title = "Building Wearables for Geology: an Operating System
Approach",
journal = j-OPER-SYS-REV,
volume = "50",
number = "1",
pages = "31--45",
month = jan,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2903267.2903275",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Mar 14 18:42:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Wearable devices have emerged in the last years with
new applications that provide user convenience.
Healthcare, sports, safety are some examples of
applications embedded in thousands of devices released
in the last years. Wearable operating systems with
different focus emerged together with wearable
applications in order to make adjustments and
optimizations of software and hardware. This paper
presents a wearable operating systems discussion and
shows the current challenges and wearable operating
system influence. We developed a wearable appliance for
geology. The wearable contains a Head Mounted Display
(HMD) assembled with Google Cardboard API and sensors
connected to developments boards. For each system
component was used different operating systems
according to hardware and software available. The
results indicate some trends for wearable operating
systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhou:2016:PUH,
author = "Yuanyuan Zhou",
title = "Programming Uncertain {$<$T$>$ hings}",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "1--2",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872416",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Innovation flourishes with good abstractions. For
instance, codification of the IEEE Floating Point
standard in 1985 was critical to the subsequent success
of scientific computing. Programming languages
currently lack appropriate abstractions for uncertain
data. Applications already use estimates from sensors,
machine learning, big data, humans, and approximate
algorithms, but most programming languages do not help
developers address correctness, programmability, and
optimization problems due to estimates. To address
these problems, we propose a new programming
abstraction called Uncertain We encourage the community
to develop and use abstractions for estimates.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Abadal:2016:WAF,
author = "Sergi Abadal and Albert Cabellos-Aparicio and Eduard
Alarcon and Josep Torrellas",
title = "{WiSync}: an Architecture for Fast Synchronization
through On-Chip Wireless Communication",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "3--17",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872396",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In shared-memory multiprocessing, fine-grain
synchronization is challenging because it requires
frequent communication. As technology scaling delivers
larger manycore chips, such pattern is expected to
remain costly to support. In this paper, we propose to
address this challenge by using on-chip wireless
communication. Each core has a transceiver and an
antenna to communicate with all the other cores. This
environment supports very low latency global
communication. Our architecture, called WiSync, uses a
per-core Broadcast Memory (BM). When a core writes to
its BM, all the other 100+ BMs get updated in less than
10 processor cycles. We also use a second wireless
channel with cheaper transfers to execute barriers
efficiently. WiSync supports multiprogramming, virtual
memory, and context switching. Our evaluation with
simulations of 128-threaded kernels and 64-threaded
applications shows that WiSync speeds-up
synchronization substantially. Compared to using
advanced conventional synchronization, WiSync attains
an average speedup of nearly one order of magnitude for
the kernels, and 1.12 for PARSEC and SPLASH-2.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2016:RTE,
author = "Xiaodong Wang and Jos{\'e} F. Mart{\'\i}nez",
title = "{ReBudget}: Trading Off Efficiency vs. Fairness in
Market-Based Multicore Resource Allocation via Runtime
Budget Reassignment",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "19--32",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872382",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Efficiently allocating shared resources in computer
systems is critical to optimizing execution. Recently,
a number of market-based solutions have been proposed
to attack this problem. Some of them provide provable
theoretical bounds to efficiency and/or fairness losses
under market equilibrium. However, they are limited to
markets with potentially important constraints, such as
enforcing equal budget for all players, or
curve-fitting players' utility into a specific function
type. Moreover, they do not generally provide an
intuitive ``knob'' to control efficiency vs. fairness.
In this paper, we introduce two new metrics, Market
Utility Range (MUR) and Market Budget Range (MBR),
through which we provide for the first time theoretical
bounds on efficiency and fairness of market equilibria
under arbitrary budget assignments. We leverage this
result and propose ReBudget, an iterative budget
re-assignment algorithm that can be used to control
efficiency vs. fairness at run-time. We apply our
algorithm to a multi-resource allocation problem in
multicore chips. Our evaluation using detailed
execution-driven simulations shows that our budget
re-assignment technique is intuitive, effective, and
efficient.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhu:2016:DEQ,
author = "Haishan Zhu and Mattan Erez",
title = "Dirigent: Enforcing {QoS} for Latency-Critical Tasks
on Shared Multicore Systems",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "33--47",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872394",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Latency-critical applications suffer from both average
performance degradation and reduced completion time
predictability when collocated with batch tasks. Such
variation forces the system to overprovision resources
to ensure Quality of Service (QoS) for latency-critical
tasks, degrading overall system throughput. We explore
the causes of this variation and exploit the
opportunities of mitigating variation directly to
simultaneously improve both QoS and utilization. We
develop, implement, and evaluate Dirigent, a
lightweight performance-management runtime system that
accurately controls the QoS of latency-critical
applications at fine time scales, leveraging existing
architecture mechanisms. We evaluate Dirigent on a real
machine and show that it is significantly more
effective than configurations representative of prior
schemes.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kuperman:2016:PR,
author = "Yossi Kuperman and Eyal Moscovici and Joel Nider and
Razya Ladelsky and Abel Gordon and Dan Tsafrir",
title = "Paravirtual Remote {I/O}",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "49--65",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872378",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "The traditional ``trap and emulate'' I/O
paravirtualization model conveniently allows for I/O
interposition, yet it inherently incurs costly
guest-host context switches. The newer ``sidecore''
model eliminates this overhead by dedicating host
(side)cores to poll the relevant guest memory regions
and react accordingly without context switching. But
the dedication of sidecores on each host might be
wasteful when I/O activity is low, or it might not
provide enough computational power when I/O activity is
high. We propose to alleviate this problem at rack
scale by consolidating the dedicated sidecores spread
across several hosts onto one server. The hypervisor is
then effectively split into two parts: the local
hypervisor that hosts the VMs, and the remote
hypervisor that processes their paravirtual I/O. We
call this model vRIO---paraVirtual Remote I/O. We find
that by increasing the latency somewhat, it provides
comparable throughput with fewer sidecores and superior
throughput with the same number of sidecores as
compared to the state of the art. vRIO additionally
constitutes a new, cost-effective way to consolidate
I/O devices (on the remote hypervisor) while supporting
efficient programmable I/O interposition.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kaufmann:2016:HPP,
author = "Antoine Kaufmann and SImon Peter and Naveen Kr. Sharma
and Thomas Anderson and Arvind Krishnamurthy",
title = "High Performance Packet Processing with {FlexNIC}",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "67--81",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872367",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The recent surge of network I/O performance has put
enormous pressure on memory and software I/O processing
sub systems. We argue that the primary reason for high
memory and processing overheads is the inefficient use
of these resources by current commodity network
interface cards (NICs). We propose FlexNIC, a flexible
network DMA interface that can be used by operating
systems and applications alike to reduce packet
processing overheads. FlexNIC allows services to
install packet processing rules into the NIC, which
then executes simple operations on packets while
exchanging them with host memory. Thus, our proposal
moves some of the packet processing traditionally done
in software to the NIC, where it can be done flexibly
and at high speed. We quantify the potential benefits
of FlexNIC by emulating the proposed FlexNIC
functionality with existing hardware or in software. We
show that significant gains in application performance
are possible, in terms of both latency and throughput,
for several widely used applications, including a
key-value store, a stream processing system, and an
intrusion detection system.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bornholt:2016:SCF,
author = "James Bornholt and Antoine Kaufmann and Jialin Li and
Arvind Krishnamurthy and Emina Torlak and Xi Wang",
title = "Specifying and Checking File System Crash-Consistency
Models",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "83--98",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872406",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Applications depend on persistent storage to recover
state after system crashes. But the POSIX file system
interfaces do not define the possible outcomes of a
crash. As a result, it is difficult for application
writers to correctly understand the ordering of and
dependencies between file system operations, which can
lead to corrupt application state and, in the worst
case, catastrophic data loss. This paper presents
crash-consistency models, analogous to memory
consistency models, which describe the behavior of a
file system across crashes. Crash-consistency models
include both litmus tests, which demonstrate allowed
and forbidden behaviors, and axiomatic and operational
specifications. We present a formal framework for
developing crash-consistency models, and a toolkit,
called Ferrite, for validating those models against
real file system implementations. We develop a
crash-consistency model for ext4, and use Ferrite to
demonstrate unintuitive crash behaviors of the ext4
implementation. To demonstrate the utility of
crash-consistency models to application writers, we use
our models to prototype proof-of-concept verification
and synthesis tools, as well as new library interfaces
for crash-safe applications.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Prasad:2016:PMR,
author = "Aravinda Prasad and K. Gopinath",
title = "Prudent Memory Reclamation in Procrastination-Based
Synchronization",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "99--112",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872405",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Procrastination is the fundamental technique used in
synchronization mechanisms such as Read-Copy-Update
(RCU) where writers, in order to synchronize with
readers, defer the freeing of an object until there are
no readers referring to the object. The synchronization
mechanism determines when the deferred object is safe
to reclaim and when it is actually reclaimed. Hence,
such memory reclamations are completely oblivious of
the memory allocator state. This induces poor memory
allocator performance, for instance, when the
reclamations are ill-timed. Furthermore, deferred
objects provide hints about the future that inform
memory regions that are about to be freed. Although
useful, hints are not exploited as deferred objects are
not visible to memory allocators. We introduce
Prudence, a dynamic memory allocator, that is tightly
integrated with the synchronization mechanism to ensure
visibility of deferred objects to the memory allocator.
Such an integration enables Prudence to (i) identify
the safe time to reclaim deferred objects' memory, (ii)
have an inclusive view of the allocated, free and
about-to-be-freed objects, and (iii) exploit
optimizations based on the hints about the future
during important state transitions. Our evaluation in
the Linux kernel shows that Prudence integrated with
RCU performs 3.9X to 28X better in micro-benchmarks
compared to SLUB, a recent memory allocator in the
Linux kernel. It also improves the overall performance
perceptibly (4\%-18\%) for a mix of widely used
synthetic and application benchmarks. Further, it
performs better (up to 98\%) in terms of object hits in
caches, object cache churns, slab churns, peak memory
usage and total fragmentation, when compared with the
SLUB allocator.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mukkara:2016:WID,
author = "Anurag Mukkara and Nathan Beckmann and Daniel
Sanchez",
title = "{Whirlpool}: Improving Dynamic Cache Management with
Static Data Classification",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "113--127",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872363",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cache hierarchies are increasingly non-uniform and
difficult to manage. Several techniques, such as
scratchpads or reuse hints, use static information
about how programs access data to manage the memory
hierarchy. Static techniques are effective on regular
programs, but because they set fixed policies, they are
vulnerable to changes in program behavior or available
cache space. Instead, most systems rely on dynamic
caching policies that adapt to observed program
behavior. Unfortunately, dynamic policies spend
significant resources trying to learn how programs use
memory, and yet they often perform worse than a static
policy. We present Whirlpool, a novel approach that
combines static information with dynamic policies to
reap the benefits of each. Whirlpool statically
classifies data into pools based on how the program
uses memory. Whirlpool then uses dynamic policies to
tune the cache to each pool. Hence, rather than setting
policies statically, Whirlpool uses static analysis to
guide dynamic policies. We present both an API that
lets programmers specify pools manually and a profiling
tool that discovers pools automatically in unmodified
binaries. We evaluate Whirlpool on a state-of-the-art
NUCA cache. Whirlpool significantly outperforms prior
approaches: on sequential programs, Whirlpool improves
performance by up to 38\% and reduces data movement
energy by up to 53\%; on parallel programs, Whirlpool
improves performance by up to 67\% and reduces data
movement energy by up to 2.6x.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jeon:2016:TTD,
author = "Myeongjae Jeon and Yuxiong He and Hwanju Kim and Sameh
Elnikety and Scott Rixner and Alan L. Cox",
title = "{TPC}: Target-Driven Parallelism Combining Prediction
and Correction to Reduce Tail Latency in Interactive
Services",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "129--141",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872370",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In interactive services such as web search,
recommendations, games and finance, reducing the tail
latency is crucial to provide fast response to every
user. Using web search as a driving example, we
systematically characterize interactive workload to
identify the opportunities and challenges for reducing
tail latency. We find that the workload consists of
mainly short requests that do not benefit from
parallelism, and a few long requests which
significantly impact the tail but exhibit high
parallelism speedup. This motivates estimating request
execution time, using a predictor, to identify long
requests and to parallelize them. Prediction, however,
is not perfect; a long request mispredicted as short is
likely to contribute to the server tail latency,
setting a ceiling on the achievable tail latency. We
propose TPC, an approach that combines prediction
information judiciously with dynamic correction for
inaccurate prediction. Dynamic correction increases
parallelism to accelerate a long request that is
mispredicted as short. TPC carefully selects the
appropriate target latencies based on system load and
parallelism efficiency to reduce tail latency. We
implement TPC and several prior approaches to compare
them experimentally on a single search server and on a
cluster of 40 search servers. The experimental results
show that TPC reduces the 99th- and 99.9th-percentile
latency by up to 40\% compared with the best prior
work. Moreover, we evaluate TPC on a finance server,
demonstrating its effectiveness on reducing tail
latency of interactive services beyond web search.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brown:2016:HBS,
author = "Fraser Brown and Andres N{\"o}tzli and Dawson Engler",
title = "How to Build Static Checking Systems Using Orders of
Magnitude Less Code",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "143--157",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872364",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/java2010.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modern static bug finding tools are complex. They
typically consist of hundreds of thousands of lines of
code, and most of them are wedded to one language (or
even one compiler). This complexity makes the systems
hard to understand, hard to debug, and hard to retarget
to new languages, thereby dramatically limiting their
scope. This paper reduces checking system complexity by
addressing a fundamental assumption, the assumption
that checkers must depend on a full-blown language
specification and compiler front end. Instead, our
program checkers are based on drastically incomplete
language grammars (``micro-grammars'') that describe
only portions of a language relevant to a checker. As a
result, our implementation is tiny --- roughly 2500
lines of code, about two orders of magnitude smaller
than a typical system. We hope that this dramatic
increase in simplicity will allow people to use more
checkers on more systems in more languages. We
implement our approach in $ \mu $chex, a
language-agnostic framework for writing static bug
checkers. We use it to build micro-grammar based
checkers for six languages (C, the C preprocessor, C++,
Java, JavaScript, and Dart) and find over 700 errors in
real-world projects.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2016:TED,
author = "Tong Zhang and Dongyoon Lee and Changhee Jung",
title = "{TxRace}: Efficient Data Race Detection Using
Commodity Hardware Transactional Memory",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "159--173",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872384",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Detecting data races is important for debugging
shared-memory multithreaded programs, but the high
runtime overhead prevents the wide use of dynamic data
race detectors. This paper presents TxRace, a new
software data race detector that leverages commodity
hardware transactional memory (HTM) to speed up data
race detection. TxRace instruments a multithreaded
program to transform synchronization-free regions into
transactions, and exploits the conflict detection
mechanism of HTM for lightweight data race detection at
runtime. However, the limitations of the current
best-effort commodity HTMs expose several challenges in
using them for data race detection: (1) lack of ability
to pinpoint racy instructions, (2) false positives
caused by cache line granularity of conflict detection,
and (3) transactional aborts for non-conflict reasons
(e.g., capacity or unknown). To overcome these
challenges, TxRace performs lightweight HTM-based data
race detection at first, and occasionally switches to
slow yet precise data race detection only for the small
fraction of execution intervals in which potential
races are reported by HTM. According to the
experimental results, TxRace reduces the average
runtime overhead of dynamic data race detection from
11.68x to 4.65x with only a small number of false
negatives.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Amani:2016:CVH,
author = "Sidney Amani and Alex Hixon and Zilin Chen and
Christine Rizkallah and Peter Chubb and Liam O'Connor
and Joel Beeren and Yutaka Nagashima and Japheth Lim
and Thomas Sewell and Joseph Tuong and Gabriele Keller
and Toby Murray and Gerwin Klein and Gernot Heiser",
title = "{CoGENT}: Verifying High-Assurance File System
Implementations",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "175--188",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872404",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present an approach to writing and formally
verifying high-assurance file-system code in a
restricted language called COGENT, supported by a
certifying compiler that produces C code, high-level
specification of COGENT, and translation correctness
proofs. The language is strongly typed and guarantees
absence of a number of common file system
implementation errors. We show how verification effort
is drastically reduced for proving higher-level
properties of the file system implementation by
reasoning about the generated formal specification
rather than its low-level C code. We use the framework
to write two Linux file systems, and compare their
performance with their native C implementations.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Asmussen:2016:MHO,
author = "Nils Asmussen and Marcus V{\"o}lp and Benedikt
N{\"o}then and Hermann H{\"a}rtig and Gerhard
Fettweis",
title = "{M3}: a Hardware\slash Operating-System Co-Design to
Tame Heterogeneous Manycores",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "189--203",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872371",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In the last decade, the number of available cores
increased and heterogeneity grew. In this work, we ask
the question whether the design of the current
operating systems (OSes) is still appropriate if these
trends continue and lead to abundantly available but
heterogeneous cores, or whether it forces a fundamental
rethinking of how systems are designed. We argue that:
1. hiding heterogeneity behind a common hardware
interface unifies, to a large extent, the control and
coordination of cores and accelerators in the OS, 2.
isolating at the network-on-chip rather than with
processor features (like privileged mode, memory
management unit, ...), allows running untrusted code on
arbitrary cores, and 3. providing OS services via
protocols over the network-on-chip, instead of via
system calls, makes them accessible to arbitrary types
of cores as well. In summary, this turns accelerators
into first-class citizens and enables a single and
convenient programming environment for all cores
without the need to trust any application. In this
paper, we introduce network-on-chip-level isolation,
present the design of our microkernel-based OS, M3, and
the common hardware interface, and evaluate the
performance of our prototype in comparison to Linux. A
bit surprising, without using accelerators, M3
outperforms Linux in some application-level benchmarks
by more than a factor of five.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liaqat:2016:SEE,
author = "Daniyal Liaqat and Silviu Jingoi and Eyal de Lara and
Ashvin Goel and Wilson To and Kevin Lee and Italo {De
Moraes Garcia} and Manuel Saldana",
title = "{Sidewinder}: an Energy Efficient and Developer
Friendly Heterogeneous Architecture for Continuous
Mobile Sensing",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "205--215",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872398",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Applications that perform continuous sensing on mobile
phones have the potential to revolutionize everyday
life. Examples range from medical and health monitoring
applications, such as pedometers and fall detectors, to
participatory sensing applications, such as noise
pollution, traffic and seismic activity monitoring.
Unfortunately, current mobile devices are a poor match
for continuous sensing applications as they require the
device to remain awake for extended periods of time,
resulting in poor battery life. This paper presents
Sidewinder, a new approach towards offloading sensor
data processing to a low-power processor and waking up
the main processor when events of interest occur. This
approach differs from other heterogeneous architectures
in that developers are presented with a programming
interface that lets them construct application specific
wake-up conditions by linking together and
parameterizing predefined sensor data processing
algorithms. Our experiments indicate performance that
is comparable to approaches that provide fully
programmable offloading, but do so with a much simpler
programming interface that facilitates deployment and
portability.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Balkind:2016:OOS,
author = "Jonathan Balkind and Michael McKeown and Yaosheng Fu
and Tri Nguyen and Yanqi Zhou and Alexey Lavrov and
Mohammad Shahrad and Adi Fuchs and Samuel Payne and
Xiaohua Liang and Matthew Matl and David Wentzlaff",
title = "{OpenPiton}: an Open Source Manycore Research
Framework",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "217--232",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872414",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Industry is building larger, more complex, manycore
processors on the back of strong institutional
knowledge, but academic projects face difficulties in
replicating that scale. To alleviate these difficulties
and to develop and share knowledge, the community needs
open architecture frameworks for simulation, synthesis,
and software exploration which support extensibility,
scalability, and configurability, alongside an
established base of verification tools and supported
software. In this paper we present OpenPiton, an open
source framework for building scalable architecture
research prototypes from 1 core to 500 million cores.
OpenPiton is the world's first open source,
general-purpose, multithreaded manycore processor and
framework. OpenPiton leverages the industry hardened
OpenSPARC T1 core with modifications and builds upon it
with a scratch-built, scalable uncore creating a
flexible, modern manycore design. In addition,
OpenPiton provides synthesis and backend scripts for
ASIC and FPGA to enable other researchers to bring
their designs to implementation. OpenPiton provides a
complete verification infrastructure of over 8000
tests, is supported by mature software tools, runs
full-stack multiuser Debian Linux, and is written in
industry standard Verilog. Multiple implementations of
OpenPiton have been created including a taped-out
25-core implementation in IBM's 32nm process and
multiple Xilinx FPGA prototypes.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lustig:2016:CVM,
author = "Daniel Lustig and Geet Sethi and Margaret Martonosi
and Abhishek Bhattacharjee",
title = "{COATCheck}: Verifying Memory Ordering at the
Hardware-{OS} Interface",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "233--247",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872399",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modern computer systems include numerous compute
elements, from CPUs to GPUs to accelerators. Harnessing
their full potential requires well-defined,
properly-implemented memory consistency models (MCMs),
and low-level system functionality such as virtual
memory and address translation (AT). Unfortunately, it
is difficult to specify and implement hardware-OS
interactions correctly; in the past, many hardware and
OS specification mismatches have resulted in
implementation bugs in commercial processors. In an
effort to resolve this verification gap, this paper
makes the following contributions. First, we present
COATCheck, an address translation-aware framework for
specifying and statically verifying memory ordering
enforcement at the microarchitecture and operating
system levels. We develop a domain-specific language
for specifying ordering enforcement, for including
ordering-related OS events and hardware
micro-operations, and for programmatically enumerating
happens-before graphs. Using a fast and automated
static constraint solver, COATCheck can efficiently
analyze interesting and important memory ordering
scenarios for modern, high-performance, out-of-order
processors. Second, we show that previous work on
Virtual Address Memory Consistency (VAMC) does not
capture every translation-related ordering scenario of
interest, and that some such cases even fall outside
the traditional scope of consistency. We therefore
introduce the term transistency model to describe the
superset of consistency which captures all
translation-aware sets of ordering rules.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Markuze:2016:TIP,
author = "Alex Markuze and Adam Morrison and Dan Tsafrir",
title = "True {IOMMU} Protection from {DMA} Attacks: When Copy
is Faster than Zero Copy",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "249--262",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872379",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Malicious I/O devices might compromise the OS using
DMAs. The OS therefore utilizes the IOMMU to map and
unmap every target buffer right before and after its
DMA is processed, thereby restricting DMAs to their
designated locations. This usage model, however, is not
truly secure for two reasons: (1) it provides
protection at page granularity only, whereas DMA
buffers can reside on the same page as other data; and
(2) it delays DMA buffer unmaps due to performance
considerations, creating a vulnerability window in
which devices can access in-use memory. We propose that
OSes utilize the IOMMU differently, in a manner that
eliminates these two flaws. Our new usage model
restricts device access to a set of shadow DMA buffers
that are never unmapped, and it copies DMAed data
to/from these buffers, thus providing sub-page
protection while eliminating the aforementioned
vulnerability window. Our key insight is that the cost
of interacting with, and synchronizing access to the
slow IOMMU hardware---required for zero-copy protection
against devices---make copying preferable to
zero-copying. We implement our model in Linux and
evaluate it with standard networking benchmarks
utilizing a 40,Gb/s NIC. We demonstrate that despite
being more secure than the safest preexisting usage
model, our approach provides up to 5x higher
throughput. Additionally, whereas it is inherently less
scalable than an IOMMU-less (unprotected) system, our
approach incurs only 0\%--25\% performance degradation
in comparison.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Awad:2016:SSZ,
author = "Amro Awad and Pratyusa Manadhata and Stuart Haber and
Yan Solihin and William Horne",
title = "Silent Shredder: Zero-Cost Shredding for Secure
Non-Volatile Main Memory Controllers",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "263--276",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872377",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As non-volatile memory (NVM) technologies are expected
to replace DRAM in the near future, new challenges have
emerged. For example, NVMs have slow and
power-consuming writes, and limited write endurance. In
addition, NVMs have a data remanence vulnerability,
i.e., they retain data for a long time after being
powered off. NVM encryption alleviates the
vulnerability, but exacerbates the limited endurance by
increasing the number of writes to memory. We observe
that, in current systems, a large percentage of main
memory writes result from data shredding in operating
systems, a process of zeroing out physical pages before
mapping them to new processes, in order to protect
previous processes' data. In this paper, we propose
Silent Shredder, which repurposes initialization
vectors used in standard counter mode encryption to
completely eliminate the data shredding writes. Silent
Shredder also speeds up reading shredded cache lines,
and hence reduces power consumption and improves
overall performance. To evaluate our design, we run
three PowerGraph applications and 26 multi-programmed
workloads from the SPEC 2006 suite, on a gem5-based
full system simulator. Silent Shredder eliminates an
average of 48.6\% of the writes in the initialization
and graph construction phases. It speeds up main memory
reads by 3.3 times, and improves the number of
instructions per cycle (IPC) by 6.4\% on average.
Finally, we discuss several use cases, including
virtual machines' data isolation and user-level large
data initialization, where Silent Shredder can be used
effectively at no extra cost.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kwon:2016:SPT,
author = "Youngjin Kwon and Alan M. Dunn and Michael Z. Lee and
Owen S. Hofmann and Yuanzhong Xu and Emmett Witchel",
title = "{Sego}: Pervasive Trusted Metadata for Efficiently
Verified Untrusted System Services",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "277--290",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872372",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Sego is a hypervisor-based system that gives strong
privacy and integrity guarantees to trusted
applications, even when the guest operating system is
compromised or hostile. Sego verifies operating system
services, like the file system, instead of replacing
them. By associating trusted metadata with user data
across all system devices, Sego verifies system
services more efficiently than previous systems,
especially services that depend on data contents. We
extensively evaluate Sego's performance on real
workloads and implement a kernel fault injector to
validate Sego's file system-agnostic crash consistency
and recovery protocol.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tsafrir:2016:SAW,
author = "Dan Tsafrir",
title = "Synopsis of the {ASPLOS '16 Wild and Crazy Ideas
(WACI)} Invited-Speakers Session",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "291--294",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2876512",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Wild and Crazy Ideas (WACI) session is a
longstanding tradition at ASPLOS, soliciting talks that
consist of forward-looking, visionary, inspiring,
creative, far out or just plain amazing ideas presented
in an exciting way. (Amusing elements in the
presentations are tolerated ;-) but are in fact
optional.) The first WACI session took place in 1998.
Back then, the call for talks included a problem
statement, which contended that ``papers usually do not
get admitted to [such conferences as] ISCA or ASPLOS
unless the systems that they describe are mature enough
to run [some standard benchmark suites, which] has a
chilling effect on the idea generation
process---encouraging incremental research'' [1]. The
1998 WACI session turned out to be a great success. Its
webpage states that ``there were 42 submissions
[competing over] only eight time slots, [which resulted
in] this session [having] a lower acceptance rate than
the conference itself'' [2]. But the times they are
a-changin' [3], and the WACI session no longer enjoys
that many submissions (Figure 1), perhaps because
nowadays there exist many forums for researchers to
describe/discuss their preliminary ideas, including:
the ``hot topics in'' workshops [4--7]; a journal like
CAL, dedicated to early results [8]; main conferences
soliciting short submissions describing ``original or
unconventional ideas at a preliminary stage'' in
addition to regular papers [9]; and the many workshops
co-located with main conferences, like ISCA '15, which
hosted thirteen such workshops [10]. Regardless of the
reason for the declining number of submissions, this
time we've decided to organize the WACI session
differently to ensure its continued high quality.
Instead of soliciting talks via an open call and hoping
for the best, we proactively invited speakers whom we
believe are capable of delivering excellent WACI
presentations. That is, this year's WACI session
consists exclusively of invited speakers. Filling up
the available slots turned out to be fairly easy, as
most of the researchers we invited promptly accepted
our invitation. The duration of each talk was set to be
eight minutes (exactly as in the first WACI session
from 1998) plus two minutes for questions. The talks
are outlined below. We believe they are interesting and
exciting, and we hope the attendees of the session will
find them stimulating and insightful.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Williams:2016:BIC,
author = "R. Stanley Williams",
title = "Brain Inspired Computing",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "295--295",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872417",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Phothilimthana:2016:SS,
author = "Phitchaya Mangpo Phothilimthana and Aditya Thakur and
Rastislav Bodik and Dinakar Dhurjati",
title = "Scaling up Superoptimization",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "297--310",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872387",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Developing a code optimizer is challenging, especially
for new, idiosyncratic ISAs. Superoptimization can, in
principle, discover machine-specific optimizations
automatically by searching the space of all instruction
sequences. If we can increase the size of code
fragments a superoptimizer can optimize, we will be
able to discover more optimizations. We develop LENS, a
search algorithm that increases the size of code a
superoptimizer can synthesize by rapidly pruning away
invalid candidate programs. Pruning is achieved by
selectively refining the abstraction under which
candidates are considered equivalent, only in the
promising part of the candidate space. LENS also uses a
bidirectional search strategy to prune the candidate
space from both forward and backward directions. These
pruning strategies allow LENS to solve twice as many
benchmarks as existing enumerative search algorithms,
while LENS is about 11-times faster. Additionally, we
increase the effective size of the superoptimized
fragments by relaxing the correctness condition using
contexts (surrounding code). Finally, we combine LENS
with complementary search techniques into a cooperative
superoptimizer, which exploits the stochastic search to
make random jumps in a large candidate space, and a
symbolic (SAT-solver-based) search to synthesize
arbitrary constants. While existing superoptimizers
consistently solve 9--16 out of 32 benchmarks, the
cooperative superoptimizer solves 29 benchmarks. It can
synthesize code fragments that are up to 82\% faster
than code generated by gcc -O3 from WiBench and
MiBench.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hasabnis:2016:LAI,
author = "Niranjan Hasabnis and R. Sekar",
title = "Lifting Assembly to Intermediate Representation: a
Novel Approach Leveraging Compilers",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "311--324",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872380",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Translating low-level machine instructions into
higher-level intermediate language (IL) is one of the
central steps in many binary analysis and
instrumentation systems. Existing systems build such
translators manually. As a result, it takes a great
deal of effort to support new architectures. Even for
widely deployed architectures, full instruction sets
may not be modeled, e.g., mature systems such as
Valgrind still lack support for AVX, FMA4 and SSE4.1
for x86 processors. To overcome these difficulties, we
propose a novel approach that leverages knowledge about
instruction set semantics that is already embedded into
modern compilers such as GCC. In particular, we present
a learning-based approach for automating the
translation of assembly instructions to a compiler's
architecture-neutral IL. We present an experimental
evaluation that demonstrates the ability of our
approach to easily support many architectures (x86, ARM
and AVR), including their advanced instruction sets.
Our implementation is available as open-source
software.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Muralidharan:2016:AAC,
author = "Saurav Muralidharan and Amit Roy and Mary Hall and
Michael Garland and Piyush Rai",
title = "Architecture-Adaptive Code Variant Tuning",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "325--338",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872411",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Code variants represent alternative implementations of
a computation, and are common in high-performance
libraries and applications to facilitate selecting the
most appropriate implementation for a specific
execution context (target architecture and input
dataset). Automating code variant selection typically
relies on machine learning to construct a model during
an offline learning phase that can be quickly queried
at runtime once the execution context is known. In this
paper, we define a new approach called
architecture-adaptive code variant tuning, where the
variant selection model is learned on a set of source
architectures, and then used to predict variants on a
new target architecture without having to repeat the
training process. We pose this as a multi-task learning
problem, where each source architecture corresponds to
a task; we use device features in the construction of
the variant selection model. This work explores the
effectiveness of multi-task learning and the impact of
different strategies for device feature selection. We
evaluate our approach on a set of benchmarks and a
collection of six NVIDIA GPU architectures from three
distinct generations. We achieve performance results
that are mostly comparable to the previous approach of
tuning for a single GPU architecture without having to
repeat the learning phase.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2016:SKT,
author = "Xiaofeng Lin and Yu Chen and Xiaodong Li and Junjie
Mao and Jiaquan He and Wei Xu and Yuanchun Shi",
title = "Scalable Kernel {TCP} Design and Implementation for
Short-Lived Connections",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "339--352",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872391",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With the rapid growth of network bandwidth, increases
in CPU cores on a single machine, and application API
models demanding more short-lived connections, a
scalable TCP stack is performance-critical. Although
many clean-state designs have been proposed, production
environments still call for a bottom-up parallel TCP
stack design that is backward-compatible with existing
applications. We present Fastsocket, a BSD
Socket-compatible and scalable kernel socket design,
which achieves table-level connection partition in TCP
stack and guarantees connection locality for both
passive and active connections. Fastsocket architecture
is a ground up partition design, from NIC interrupts
all the way up to applications, which naturally
eliminates various lock contentions in the entire
stack. Moreover, Fastsocket maintains the full
functionality of the kernel TCP stack and
BSD-socket-compatible API, and thus applications need
no modifications. Our evaluations show that Fastsocket
achieves a speedup of 20.4x on a 24-core machine under
a workload of short-lived connections, outperforming
the state-of-the-art Linux kernel TCP implementations.
When scaling up to 24 CPU cores, Fastsocket increases
the throughput of Nginx and HAProxy by 267\% and 621\%
respectively compared with the base Linux kernel. We
also demonstrate that Fastsocket can achieve
scalability and preserve BSD socket API at the same
time. Fastsocket is already deployed in the production
environment of Sina WeiBo, serving 50 million daily
active users and billions of requests per day.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{ElHajj:2016:SPM,
author = "Izzat {El Hajj} and Alexander Merritt and Gerd
Zellweger and Dejan Milojicic and Reto Achermann and
Paolo Faraboschi and Wen-mei Hwu and Timothy Roscoe and
Karsten Schwan",
title = "{SpaceJMP}: Programming with Multiple Virtual Address
Spaces",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "353--368",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872366",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Memory-centric computing demands careful organization
of the virtual address space, but traditional methods
for doing so are inflexible and inefficient. If an
application wishes to address larger physical memory
than virtual address bits allow, if it wishes to
maintain pointer-based data structures beyond process
lifetimes, or if it wishes to share large amounts of
memory across simultaneously executing processes,
legacy interfaces for managing the address space are
cumbersome and often incur excessive overheads. We
propose a new operating system design that promotes
virtual address spaces to first-class citizens,
enabling process threads to attach to, detach from, and
switch between multiple virtual address spaces. Our
work enables data-centric applications to utilize vast
physical memory beyond the virtual range, represent
persistent pointer-rich data structures without special
pointer representations, and share large amounts of
memory between processes efficiently. We describe our
prototype implementations in the DragonFly BSD and
Barrelfish operating systems. We also present
programming semantics and a compiler transformation to
detect unsafe pointer usage. We demonstrate the
benefits of our work on data-intensive applications
such as the GUPS benchmark, the SAMTools genomics
workflow, and the Redis key-value store.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lin:2016:MTP,
author = "Felix Xiaozhu Lin and Xu Liu",
title = "{\tt memif}: Towards Programming Heterogeneous Memory
Asynchronously",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "369--383",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872401",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "To harness a heterogeneous memory hierarchy, it is
advantageous to integrate application knowledge in
guiding frequent memory move, i.e., replicating or
migrating virtual memory regions. To this end, we
present memif, a protected OS service for asynchronous,
hardware-accelerated memory move. Compared to the state
of the art --- page migration in Linux, memif incurs
low overhead and low latency; in order to do so, it not
only redefines the semantics of kernel interface but
also overhauls the underlying mechanisms, including
request/completion management, race handling, and DMA
engine configuration. We implement memif in Linux for a
server-class system-on-chip that features heterogeneous
memories. Compared to the current Linux page migration,
memif reduces CPU usage by up to 15\% for small pages
and by up to 38x for large pages; in continuously
serving requests, memif has no need for request
batching and reduces latency by up to 63\%. By crafting
a small runtime atop memif, we improve the throughputs
for a set of streaming workloads by up to 33\%.
Overall, memif has opened the door to software
management of heterogeneous memory.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2016:NEN,
author = "Wook-Hee Kim and Jinwoong Kim and Woongki Baek and
Beomseok Nam and Youjip Won",
title = "{NVWAL}: Exploiting {NVRAM} in Write-Ahead Logging",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "385--398",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872392",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Emerging byte-addressable non-volatile memory is
considered an alternative storage device for database
logs that require persistency and high performance. In
this work, we develop NVWAL (NVRAM Write-Ahead Logging)
for SQLite. The contribution of NVWAL consists of three
elements: (i) byte-granularity differential logging
that effectively eliminates the excessive I/O overhead
of filesystem-based logging or journaling, (ii)
transaction-aware lazy synchronization that reduces
cache synchronization overhead by two-thirds, and (iii)
user-level heap management of the NVRAM persistent WAL
structure, which reduces the overhead of managing
persistent objects. We implemented NVWAL in SQLite and
measured the performance on a Nexus 5 smartphone and an
NVRAM emulation board --- Tuna. Our performance study
shows the following: (i) the overhead of enforcing
strict ordering of NVRAM writes can be reduced via
NVRAM-aware transaction management. (ii) From the
application performance point of view, the overhead of
guaranteeing failure atomicity is negligible; the cache
line flush overhead accounts for only 0.8~4.6\% of
transaction execution time. Therefore, application
performance is much less sensitive to the NVRAM
performance than we expected. Decreasing the NVRAM
latency by one-fifth (from 1942 nsec to 437 nsec),
SQLite achieves a mere 4\% performance gain (from 2517
ins/sec to 2621 ins/sec). (iii) Overall, when the write
latency of NVRAM is 2 usec, NVWAL increases SQLite
performance by at least 10x compared to that of WAL on
flash memory (from 541 ins/sec to 5812 ins/sec).",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kolli:2016:HPT,
author = "Aasheesh Kolli and Steven Pelley and Ali Saidi and
Peter M. Chen and Thomas F. Wenisch",
title = "High-Performance Transactions for Persistent
Memories",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "399--411",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872381",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Emerging non-volatile memory (NVRAM) technologies
offer the durability of disk with the
byte-addressability of DRAM. These devices will allow
software to access persistent data structures directly
in NVRAM using processor loads and stores, however,
ensuring consistency of persistent data across power
failures and crashes is difficult. Atomic, durable
transactions are a widely used abstraction to enforce
such consistency. Implementing transactions on NVRAM
requires the ability to constrain the order of NVRAM
writes, for example, to ensure that a transaction's log
record is complete before it is marked committed. Since
NVRAM write latencies are expected to be high,
minimizing these ordering constraints is critical for
achieving high performance. Recent work has proposed
programming interfaces to express NVRAM write ordering
constraints to hardware so that NVRAM writes may be
coalesced and reordered while preserving necessary
constraints. Unfortunately, a straightforward
implementation of transactions under these interfaces
imposes unnecessary constraints. We show how to remove
these dependencies through a variety of techniques,
notably, deferring commit until after locks are
released. We present a comprehensive analysis
contrasting two transaction designs across three NVRAM
programming interfaces, demonstrating up to 2.5x
speedup.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Guo:2016:HDI,
author = "Qing Guo and Karin Strauss and Luis Ceze and Henrique
S. Malvar",
title = "High-Density Image Storage Using Approximate Memory
Cells",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "413--426",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872413",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper proposes tailoring image encoding for an
approximate storage substrate. We demonstrate that
indiscriminately storing encoded images in approximate
memory generates unacceptable and uncontrollable
quality degradation. The key finding is that errors in
the encoded bit streams have non-uniform impact on the
decoded image quality. We develop a methodology to
determine the relative importance of encoded bits and
store them in an approximate storage substrate. The
storage cells are optimized to reduce error rate via
biasing and are tuned to meet the desired reliability
requirement via selective error correction. In a case
study with the progressive transform codec (PTC), a
precursor to JPEG XR, the proposed approximate image
storage system exhibits a 2.7x increase in density of
pixels per silicon volume under bounded error rates,
and this achievement is additive to the storage savings
of PTC compression.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Izraelevitz:2016:FAP,
author = "Joseph Izraelevitz and Terence Kelly and Aasheesh
Kolli",
title = "Failure-Atomic Persistent Memory Updates via {JUSTDO}
Logging",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "427--442",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872410",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Persistent memory invites applications to manipulate
persistent data via load and store instructions.
Because failures during updates may destroy transient
data (e.g., in CPU registers), preserving data
integrity in the presence of failures requires
failure-atomic bundles of updates. Prior failure
atomicity approaches for persistent memory entail
overheads due to logging and CPU cache flushing.
Persistent caches can eliminate the need for flushing,
but conventional logging remains complex and memory
intensive. We present the design and implementation of
JUSTDO logging, a new failure atomicity mechanism that
greatly reduces the memory footprint of logs,
simplifies log management, and enables fast parallel
recovery following failure. Crash-injection tests
confirm that JUSTDO logging preserves application data
integrity and performance evaluations show that it
improves throughput 3x or more compared with a
state-of-the-art alternative for a spectrum of
data-intensive algorithms.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Han:2016:IMD,
author = "Jaeung Han and Seungheun Jeon and Young-ri Choi and
Jaehyuk Huh",
title = "Interference Management for Distributed Parallel
Applications in Consolidated Clusters",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "443--456",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872388",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Consolidating multiple applications on a system can
improve the overall resource utilization of data center
systems. However, such consolidation can adversely
affect the performance of some applications due to
interference caused by resource contention. Despite
many prior studies on the interference effects in
single-node systems, the interference behaviors of
distributed parallel applications have not been
investigated thoroughly. With distributed applications,
a local interference in a node can affect the whole
execution of an application spanning many nodes. This
paper studies an interference modeling methodology for
distributed applications to predict their performance
under interference effects in consolidated clusters.
This study first characterizes the effects of
interference for various distributed applications over
different interference settings, and analyzes how
diverse interference intensities on multiple nodes
affect the overall performance. Based on the
characterization, this study proposes a static
profiling-based model for interference propagation and
heterogeneity behaviors. In addition, this paper
presents use case studies of the modeling method, two
interference-aware placement techniques for
consolidated virtual clusters, which attempt to
maximize the overall throughput or to guarantee the
quality-of-service.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Maas:2016:THL,
author = "Martin Maas and Krste Asanovi{\'c} and Tim Harris and
John Kubiatowicz",
title = "{Taurus}: a Holistic Language Runtime System for
Coordinating Distributed Managed-Language
Applications",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "457--471",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872386",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many distributed workloads in today's data centers are
written in managed languages such as Java or Ruby.
Examples include big data frameworks such as Hadoop,
data stores such as Cassandra or applications such as
the SOLR search engine. These workloads typically run
across many independent language runtime systems on
different nodes. This setup represents a source of
inefficiency, as these language runtime systems are
unaware of each other. For example, they may perform
Garbage Collection at times that are locally reasonable
but not in a distributed setting. We address these
problems by introducing the concept of a Holistic
Runtime System that makes runtime-level decisions for
the entire distributed application rather than locally.
We then present Taurus, a Holistic Runtime System
prototype. Taurus is a JVM drop-in replacement,
requires almost no configuration and can run unmodified
off-the-shelf Java applications. Taurus enforces
user-defined coordination policies and provides a DSL
for writing these policies. By applying Taurus to
Garbage Collection, we demonstrate the potential of
such a system and use it to explore coordination
strategies for the runtime systems of real-world
distributed applications, to improve application
performance and address tail-latencies in
latency-sensitive workloads.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Delimitrou:2016:HRE,
author = "Christina Delimitrou and Christos Kozyrakis",
title = "{HCloud}: Resource-Efficient Provisioning in Shared
Cloud Systems",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "473--488",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872365",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud computing promises flexibility and high
performance for users and cost efficiency for
operators. To achieve this, cloud providers offer
instances of different sizes, both as long-term
reservations and short-term, on-demand allocations.
Unfortunately, determining the best provisioning
strategy is a complex, multi-dimensional problem that
depends on the load fluctuation and duration of
incoming jobs, and the performance unpredictability and
cost of resources. We first compare the two main
provisioning strategies (reserved and on-demand
resources) on Google Compute Engine (GCE) using three
representative workload scenarios with batch and
latency-critical applications. We show that either
approach is suboptimal for performance or cost. We then
present HCloud, a hybrid provisioning system that uses
both reserved and on-demand resources. HCloud
determines which jobs should be mapped to reserved
versus on-demand resources based on overall load, and
resource unpredictability. It also determines the
optimal instance size an application needs to satisfy
its Quality of Service (QoS) constraints. We
demonstrate that hybrid configurations improve
performance by 2.1x compared to fully on-demand
provisioning, and reduce cost by 46\% compared to fully
reserved systems. We also show that hybrid strategies
are robust to variation in system and job parameters,
such as cost and system load.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yu:2016:CWM,
author = "Xiao Yu and Pallavi Joshi and Jianwu Xu and Guoliang
Jin and Hui Zhang and Guofei Jiang",
title = "{CloudSeer}: Workflow Monitoring of Cloud
Infrastructures via Interleaved Logs",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "489--502",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872407",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud infrastructures provide a rich set of management
tasks that operate computing, storage, and networking
resources in the cloud. Monitoring the executions of
these tasks is crucial for cloud providers to promptly
find and understand problems that compromise cloud
availability. However, such monitoring is challenging
because there are multiple distributed service
components involved in the executions. CloudSeer
enables effective workflow monitoring. It takes a
lightweight non-intrusive approach that purely works on
interleaved logs widely existing in cloud
infrastructures. CloudSeer first builds an automaton
for the workflow of each management task based on
normal executions, and then it checks log messages
against a set of automata for workflow divergences in a
streaming manner. Divergences found during the checking
process indicate potential execution problems, which
may or may not be accompanied by error log messages.
For each potential problem, CloudSeer outputs necessary
context information including the affected task
automaton and related log messages hinting where the
problem occurs to help further diagnosis. Our
experiments on OpenStack, a popular open-source cloud
infrastructure, show that CloudSeer's efficiency and
problem-detection capability are suitable for online
monitoring.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kwon:2016:LCI,
author = "Yonghwi Kwon and Dohyeong Kim and William Nick Sumner
and Kyungtae Kim and Brendan Saltaformaggio and Xiangyu
Zhang and Dongyan Xu",
title = "{LDX}: Causality Inference by Lightweight Dual
Execution",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "503--515",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872395",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Causality inference, such as dynamic taint analysis,
has many applications (e.g., information leak
detection). It determines whether an event e is
causally dependent on a preceding event c during
execution. We develop a new causality inference engine
LDX. Given an execution, it spawns a slave execution,
in which it mutates c and observes whether any change
is induced at e. To preclude non-determinism, LDX
couples the executions by sharing syscall outcomes. To
handle path differences induced by the perturbation, we
develop a novel on-the-fly execution alignment scheme
that maintains a counter to reflect the progress of
execution. The scheme relies on program analysis and
compiler transformation. LDX can effectively detect
information leak and security attacks with an average
overhead of 6.08\% while running the master and the
slave concurrently on separate CPUs, much lower than
existing systems that require instruction level
monitoring. Furthermore, it has much better accuracy in
causality inference.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Leesatapornwongsa:2016:TTN,
author = "Tanakorn Leesatapornwongsa and Jeffrey F. Lukman and
Shan Lu and Haryadi S. Gunawi",
title = "{TaxDC}: a Taxonomy of Non-Deterministic Concurrency
Bugs in Datacenter Distributed Systems",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "517--530",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872374",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present TaxDC, the largest and most comprehensive
taxonomy of non-deterministic concurrency bugs in
distributed systems. We study 104 distributed
concurrency (DC) bugs from four widely-deployed
cloud-scale datacenter distributed systems, Cassandra,
Hadoop MapReduce, HBase and ZooKeeper. We study DC-bug
characteristics along several axes of analysis such as
the triggering timing condition and input
preconditions, error and failure symptoms, and fix
strategies, collectively stored as 2,083 classification
labels in TaxDC database. We discuss how our study can
open up many new research directions in combating DC
bugs.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mao:2016:RFR,
author = "Junjie Mao and Yu Chen and Qixue Xiao and Yuanchun
Shi",
title = "{RID}: Finding Reference Count Bugs with Inconsistent
Path Pair Checking",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "531--544",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872389",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Reference counts are widely used in OS kernels for
resource management. However, reference counts are not
trivial to be used correctly in large scale programs
because it is left to developers to make sure that an
increment to a reference count is always paired with a
decrement. This paper proposes inconsistent path pair
checking, a novel technique that can statically
discover bugs related to reference counts without
knowing how reference counts should be changed in a
function. A prototype called RID is implemented and
evaluations show that RID can discover more than 80
bugs which were confirmed by the developers in the
latest Linux kernel. The results also show that RID
tends to reveal bugs caused by developers'
misunderstanding on API specifications or error
conditions that are not handled properly.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2016:MPU,
author = "Huazhe Zhang and Henry Hoffmann",
title = "Maximizing Performance Under a Power Cap: a Comparison
of Hardware, Software, and Hybrid Techniques",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "545--559",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872375",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Power and thermal dissipation constrain multicore
performance scaling. Modern processors are built such
that they could sustain damaging levels of power
dissipation, creating a need for systems that can
implement processor power caps. A particular challenge
is developing systems that can maximize performance
within a power cap, and approaches have been proposed
in both software and hardware. Software approaches are
flexible, allowing multiple hardware resources to be
coordinated for maximum performance, but software is
slow, requiring a long time to converge to the power
target. In contrast, hardware power capping quickly
converges to the the power cap, but only manages
voltage and frequency, limiting its potential
performance. In this work we propose PUPiL, a hybrid
software/hardware power capping system. Unlike previous
approaches, PUPiL combines hardware's fast reaction
time with software's flexibility. We implement PUPiL on
real Linux/x86 platform and compare it to Intel's
commercial hardware power capping system for both
single and multi-application workloads. We find PUPiL
provides the same reaction time as Intel's hardware
with significantly higher performance. On average,
PUPiL outperforms hardware by from 1:18-2:4 depending
on workload and power target. Thus, PUPiL provides a
promising way to enforce power caps with greater
performance than current state-of-the-art hardware-only
approaches.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fan:2016:CSG,
author = "Songchun Fan and Seyed Majid Zahedi and Benjamin C.
Lee",
title = "The Computational Sprinting Game",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "561--575",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872383",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Computational sprinting is a class of mechanisms that
boost performance but dissipate additional power. We
describe a sprinting architecture in which many,
independent chip multiprocessors share a power supply
and sprints are constrained by the chips' thermal
limits and the rack's power limits. Moreover, we
present the computational sprinting game, a multi-agent
perspective on managing sprints. Strategic agents
decide whether to sprint based on application phases
and system conditions. The game produces an equilibrium
that improves task throughput for data analytics
workloads by 4-6$ \times $ over prior greedy heuristics
and performs within 90\% of an upper bound on
throughput from a globally optimized policy.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Colin:2016:EIF,
author = "Alexei Colin and Graham Harvey and Brandon Lucia and
Alanson P. Sample",
title = "An Energy-interference-free Hardware-Software Debugger
for Intermittent Energy-harvesting Systems",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "577--589",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872409",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Energy-autonomous computing devices have the potential
to extend the reach of computing to a scale beyond
either wired or battery-powered systems. However, these
devices pose a unique set of challenges to application
developers who lack both hardware and software support
tools. Energy harvesting devices experience power
intermittence which causes the system to reset and
power-cycle unpredictably, tens to hundreds of times
per second. This can result in code execution errors
that are not possible in continuously-powered systems
and cannot be diagnosed with conventional debugging
tools such as JTAG and/or oscilloscopes. We propose the
Energy-interference-free Debugger, a hardware and
software platform for monitoring and debugging
intermittent systems without adversely effecting their
energy state. The Energy-interference-free Debugger
re-creates a familiar debugging environment for
intermittent software and augments it with debugging
primitives for effective diagnosis of intermittence
bugs. Our evaluation of the Energy-interference-free
Debugger quantifies its energy-interference-freedom and
shows its value in a set of debugging tasks in complex
test programs and several real applications, including
RFID code and a machine-learning-based activity
recognition system.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Witchel:2016:PPW,
author = "Emmett Witchel",
title = "Programmer Productivity in a World of Mushy
Interfaces: Challenges of the Post-{ISA} Reality",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "591--591",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2876511",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Since 1964, we had the notion that the instruction set
architecture (ISA) is a useful and fairly opaque
abstraction layer between hardware and software.
Software rode hardware's performance wave while
remaining gloriously oblivious to hardware's growing
complexity. Unfortunately, the jig is up. We still have
ISAs, but the abstraction no longer offers seamless
portability---parallel software needs to be tuned for
different core counts, and heterogeneous processing
elements (CPUs, GPUs, accelerators) further complicate
programmability. We are better at building large-scale
heterogeneous processors than we are at programming
them. Maintaining software across multiple current
platforms is difficult and porting to future platforms
is also difficult. There have been many technical
responses: virtual ISAs (e.g., NVIDIA's PTX),
higher-level programming interfaces (e.g., CUDA or
OpenCL), and late-stage compilation and
platform-specific tailoring (e.g., Android ART), etc. A
team of opinionated experts, drawn from the three
ASPLOS communities will examine the problem of
programmer productivity in the post-ISA world, first
from the perspective of their area of expertise and
then noting the contributions from the other two
communities. What research will save us and how? This
wide-ranging debate will frame important research areas
for future work while being grounded in frank
discussion about what has succeeded in the past.
Attendees can expect actionable insight into important
research issues as well an entertaining discussion.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Angstadt:2016:RPP,
author = "Kevin Angstadt and Westley Weimer and Kevin Skadron",
title = "{RAPID} Programming of Pattern-Recognition
Processors",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "593--605",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872393",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present RAPID, a high-level programming language
and combined imperative and declarative model for
programming pattern-recognition processors, such as
Micron's Automata Processor (AP). The AP is a novel,
non-von Neumann architecture for direct execution of
non-deterministic finite automata (NFAs), and has been
demonstrated to provide substantial speedup for a
variety of data-processing applications. RAPID is
clear, maintainable, concise, and efficient both at
compile and run time. Language features, such as code
abstraction and parallel control structures, map well
to pattern-matching problems, providing clarity and
maintainability. For generation of efficient runtime
code, we present algorithms to convert RAPID programs
into finite automata. Further, we introduce a
tessellation technique for configuring the AP, which
significantly reduces compile time, increases
programmer productivity, and improves maintainability.
We evaluate five RAPID programs against custom,
baseline implementations previously demonstrated to be
significantly accelerated by the AP. We find that RAPID
programs are much shorter in length, are expressible at
a higher level of abstraction than their handcrafted
counterparts, and yield generated code that is often
more compact. In addition, our tessellation technique
for configuring the AP has comparable device
utilization to, and results in compilation that is up
to four orders of magnitude faster than, current
solutions.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sui:2016:PCA,
author = "Xin Sui and Andrew Lenharth and Donald S. Fussell and
Keshav Pingali",
title = "Proactive Control of Approximate Programs",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "607--621",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872402",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Approximate computing trades off accuracy of results
for resources such as energy or computing time. There
is a large and rapidly growing literature on
approximate computing that has focused mostly on
showing the benefits of approximate computing. However,
we know relatively little about how to control
approximation in a disciplined way. In this paper, we
address the problem of controlling approximation for
non-streaming programs that have a set of ``knobs''
that can be dialed up or down to control the level of
approximation of different components in the program.
We formulate this control problem as a constrained
optimization problem, and describe a system called
Capri that uses machine learning to learn cost and
error models for the program, and uses these models to
determine, for a desired level of approximation, knob
settings that optimize metrics such as running time or
energy usage. Experimental results with complex
benchmarks from different problem domains demonstrate
the effectiveness of this approach.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Park:2016:ATC,
author = "Jongse Park and Emmanuel Amaro and Divya Mahajan and
Bradley Thwaites and Hadi Esmaeilzadeh",
title = "{AxGames}: Towards Crowdsourcing Quality Target
Determination in Approximate Computing",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "623--636",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872376",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Approximate computing trades quality of application
output for higher efficiency and performance.
Approximation is useful only if its impact on
application output quality is acceptable to the users.
However, there is a lack of systematic solutions and
studies that explore users' perspective on the effects
of approximation. In this paper, we seek to provide one
such solution for the developers to probe and discover
the boundary of quality loss that most users will deem
acceptable. We propose AxGames, a crowdsourced solution
that enables developers to readily infer a statistical
common ground from the general public through three
entertaining games. The users engage in these games by
betting on their opinion about the quality loss of the
final output while the AxGames framework collects
statistics about their perceptions. The framework then
statistically analyzes the results to determine the
acceptable levels of quality for a pair of
(application, approximation technique). The three games
are designed such that they effectively capture quality
requirements with various tradeoffs and contexts. To
evaluate AxGames, we examine seven diverse applications
that produce user perceptible outputs and cover a wide
range of domains, including image processing, optical
character recognition, speech to text conversion, and
audio processing. We recruit 700 participants/users
through Amazon's Mechanical Turk to play the games that
collect statistics about their perception on different
levels of quality. Subsequently, the AxGames framework
uses the Clopper-Pearson exact method, which computes a
binomial proportion confidence interval, to analyze the
collected statistics for each level of quality. Using
this analysis, AxGames can statistically project the
quality level that satisfies a given percentage of
users. The developers can use these statistical
projections to tune the level of approximation based on
the user experience. We find that the level of
acceptable quality loss significantly varies across
applications. For instance, to satisfy 90\% of users,
the level of acceptable quality loss is 2\% for one
application (image processing) and 26\% for another
(audio processing). Moreover, the pattern with which
the crowd responds to approximation takes significantly
different shape and form depending on the class of
applications. These results confirm the necessity of
solutions that systematically explore the effect of
approximation on the end user experience.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bornholt:2016:DBA,
author = "James Bornholt and Randolph Lopez and Douglas M.
Carmean and Luis Ceze and Georg Seelig and Karin
Strauss",
title = "A {DNA}-Based Archival Storage System",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "637--649",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872397",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Demand for data storage is growing exponentially, but
the capacity of existing storage media is not keeping
up. Using DNA to archive data is an attractive
possibility because it is extremely dense, with a raw
limit of 1 exabyte/mm$^3$ (109 GB/mm$^3$ ), and
long-lasting, with observed half-life of over 500
years. This paper presents an architecture for a
DNA-based archival storage system. It is structured as
a key-value store, and leverages common biochemical
techniques to provide random access. We also propose a
new encoding scheme that offers controllable
redundancy, trading off reliability for density. We
demonstrate feasibility, random access, and robustness
of the proposed encoding with wet lab experiments
involving 151 kB of synthesized DNA and a 42 kB
random-access subset, and simulation experiments of
larger sets calibrated to the wet lab experiments.
Finally, we highlight trends in biotechnology that
indicate the impending practicality of DNA storage for
much larger datasets.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Prabhakar:2016:GCH,
author = "Raghu Prabhakar and David Koeplinger and Kevin J.
Brown and HyoukJoong Lee and Christopher {De Sa} and
Christos Kozyrakis and Kunle Olukotun",
title = "Generating Configurable Hardware from Parallel
Patterns",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "651--665",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872415",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In recent years the computing landscape has seen an
increasing shift towards specialized accelerators.
Field programmable gate arrays (FPGAs) are particularly
promising for the implementation of these accelerators,
as they offer significant performance and energy
improvements over CPUs for a wide class of applications
and are far more flexible than fixed-function ASICs.
However, FPGAs are difficult to program. Traditional
programming models for reconfigurable logic use
low-level hardware description languages like Verilog
and VHDL, which have none of the productivity features
of modern software languages but produce very efficient
designs, and low-level software languages like C and
OpenCL coupled with high-level synthesis (HLS) tools
that typically produce designs that are far less
efficient. Functional languages with parallel patterns
are a better fit for hardware generation because they
provide high-level abstractions to programmers with
little experience in hardware design and avoid many of
the problems faced when generating hardware from
imperative languages. In this paper, we identify two
important optimizations for using parallel patterns to
generate efficient hardware: tiling and metapipelining.
We present a general representation of tiled parallel
patterns, and provide rules for automatically tiling
patterns and generating metapipelines. We demonstrate
experimentally that these optimizations result in
speedups up to 39.4$ \times $ on a set of benchmarks
from the data analytics domain.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chang:2016:DLD,
author = "Li-Wen Chang and Hee-Seok Kim and Wen-mei W. Hwu",
title = "{DySel}: Lightweight Dynamic Selection for
Kernel-based Data-parallel Programming Model",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "667--680",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872373",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The rising pressure for simultaneously improving
performance and reducing power is driving more
diversity into all aspects of computing devices. An
algorithm that is well-matched to the target hardware
can run multiple times faster and more energy
efficiently than one that is not. The problem is
complicated by the fact that a program's input also
affects the appropriate choice of algorithm. As a
result, software developers have been faced with the
challenge of determining the appropriate algorithm for
each potential combination of target device and data.
This paper presents DySel, a novel runtime system for
automating such determination for kernel-based data
parallel programming models such as OpenCL, CUDA,
OpenACC, and C++AMP. These programming models cover
many applications that demand high performance in
mobile, cloud and high-performance computing. DySel
systematically deploys candidate kernels on a small
portion of the actual data to determine which achieves
the best performance for the hardware-data combination.
The test-deployment, referred to as micro-profiling,
contributes to the final execution result and incurs
less than 8\% of overhead in the worst observed case
when compared to an oracle. We show four major use
cases where DySel provides significantly more
consistent performance without tedious effort from the
developer.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:2016:BQA,
author = "Quan Chen and Hailong Yang and Jason Mars and Lingjia
Tang",
title = "Baymax: {QoS} Awareness and Increased Utilization for
Non-Preemptive Accelerators in Warehouse Scale
Computers",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "681--696",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872368",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modern warehouse-scale computers (WSCs) are being
outfitted with accelerators to provide the significant
compute required by emerging intelligent personal
assistant (IPA) workloads such as voice recognition,
image classification, and natural language processing.
It is well known that the diurnal user access pattern
of user-facing services provides a strong incentive to
co-locate applications for better accelerator
utilization and efficiency, and prior work has focused
on enabling co-location on multicore processors.
However, interference when co-locating applications on
non-preemptive accelerators is fundamentally different
than contention on multi-core CPUs and introduces a new
set of challenges to reduce QoS violation. To address
this open problem, we first identify the underlying
causes for QoS violation in accelerator-outfitted
servers. Our experiments show that queuing delay for
the compute resources and PCI-e bandwidth contention
for data transfer are the main two factors that
contribute to the long tails of user-facing
applications. We then present Baymax, a runtime system
that orchestrates the execution of compute tasks from
different applications and mitigates PCI-e bandwidth
contention to deliver the required QoS for user-facing
applications and increase the accelerator utilization.
Using DjiNN, a deep neural network service, Sirius, an
end-to-end IPA workload, and traditional applications
on a Nvidia K40 GPU, our evaluation shows that Baymax
improves the accelerator utilization by 91.3\% while
achieving the desired 99\%-ile latency target for for
user-facing applications. In fact, Baymax reduces the
99\%-ile latency of user-facing applications by up to
195x over default execution.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nowatzki:2016:ABS,
author = "Tony Nowatzki and Karthikeyan Sankaralingam",
title = "Analyzing Behavior Specialized Acceleration",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "697--711",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872412",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Hardware specialization has become a promising
paradigm for overcoming the inefficiencies of general
purpose microprocessors. Of significant interest are
Behavioral Specialized Accelerators (BSAs), which are
designed to efficiently execute code with only certain
properties, but remain largely configurable or
programmable. The most important strength of BSAs ---
their ability to target a wide variety of codes ---
also makes their interactions and analysis complex,
raising the following questions: can multiple BSAs be
composed synergistically, what are their interactions
with the general purpose core, and what combinations
favor which workloads? From a methodological
standpoint, BSAs are also challenging, as they each
require ISA development, compiler and assembler
extensions, and either simulator or RTL models. To
study the potential of BSAs, we propose a novel
modeling technique called the Transformable Dependence
Graph (TDG) --- a higher level alternative to the
time-consuming traditional compiler+simulator approach,
while still enabling detailed microarchitectural models
for both general cores and accelerators. We then
propose a multi-BSA organization, called ExoCore, which
we model and study using the TDG. A design space
exploration reveals that an ExoCore organization can
push designs beyond the established energy-performance
frontiers for general purpose cores. For example, a
2-wide OOO processor with three BSAs matches the
performance of a conventional 6-wide OOO core, has 40\%
lower area, and is 2.6x more energy efficient.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yoon:2016:PPI,
author = "Man-Ki Yoon and Negin Salajegheh and Yin Chen and
Mihai Christodorescu",
title = "{PIFT}: Predictive Information-Flow Tracking",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "713--725",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872403",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Phones today carry sensitive information and have a
great number of ways to communicate that data. As a
result, malware that steal money, information, or
simply disable functionality have hit the app stores.
Current security solutions for preventing undesirable
data leaks are mostly high-overhead and have not been
practical enough for smartphones. In this paper, we
show that simply monitoring just some instructions
(only memory loads and stores) it is possible to
achieve low overhead, highly accurate information flow
tracking. Our method achieves 98\% accuracy (0\% false
positive and 2\% false negative) over DroidBench and
was able to successfully catch seven real-world malware
instances that steal phone number, location, and device
ID using SMS messages and HTTP connections.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Venkat:2016:HHI,
author = "Ashish Venkat and Sriskanda Shamasunder and Hovav
Shacham and Dean M. Tullsen",
title = "{HIPStR}: Heterogeneous-{ISA} Program State
Relocation",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "727--741",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872408",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Heterogeneous Chip Multiprocessors have been shown to
provide significant performance and energy efficiency
gains over homogeneous designs. Recent research has
expanded the dimensions of heterogeneity to include
diverse Instruction Set Architectures, called
Heterogeneous-ISA Chip Multiprocessors. This work
leverages such an architecture to realize substantial
new security benefits, and in particular, to thwart
Return-Oriented Programming. This paper proposes a
novel security defense called HIPStR ---
Heterogeneous-ISA Program State Relocation --- that
performs dynamic randomization of run-time program
state, both within and across ISAs. This technique
outperforms the state-of-the-art just-in-time code
reuse (JIT-ROP) defense by an average of 15.6\%, while
simultaneously providing greater security guarantees
against classic return-into-libc, ROP, JOP, brute
force, JIT-ROP, and several evasive variants.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Aweke:2016:ASB,
author = "Zelalem Birhanu Aweke and Salessawi Ferede Yitbarek
and Rui Qiao and Reetuparna Das and Matthew Hicks and
Yossi Oren and Todd Austin",
title = "{ANVIL}: Software-Based Protection Against
Next-Generation Rowhammer Attacks",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "743--755",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872390",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Ensuring the integrity and security of the memory
system is critical. Recent studies have shown serious
security concerns due to ``rowhammer'' attacks, where
repeated accesses to a row of memory cause bit flips in
adjacent rows. Recent work by Google's Project Zero has
shown how to leverage rowhammer-induced bit-flips as
the basis for security exploits that include malicious
code injection and memory privilege escalation. Being
an important security concern, industry has attempted
to defend against rowhammer attacks. Deployed defenses
employ two strategies: (1) doubling the system DRAM
refresh rate and (2) restricting access to the CLFLUSH
instruction that attackers use to bypass the cache to
increase memory access frequency (i.e., the rate of
rowhammering). We demonstrate that such defenses are
inadequate: we implement rowhammer attacks that both
avoid using the CLFLUSH instruction and cause bit flips
with a doubled refresh rate. Our next-generation
CLFLUSH-free rowhammer attack bypasses the cache by
manipulating cache replacement state to allow frequent
misses out of the last-level cache to DRAM rows of our
choosing. To protect existing systems from more
advanced rowhammer attacks, we develop a software-based
defense, ANVIL, which thwarts all known rowhammer
attacks on existing systems. ANVIL detects rowhammer
attacks by tracking the locality of DRAM accesses using
existing hardware performance counters. Our detector
identifies the rows being frequently accessed (i.e.,
the aggressors), then selectively refreshes the nearby
victim rows to prevent hammering. Experiments running
on real hardware with the SPEC2006 benchmarks show that
ANVIL has less than a 1\% false positive rate and an
average slowdown of 1\%. ANVIL is low-cost and robust,
and our experiments indicate that it is an effective
approach for protecting existing and future systems
from even advanced rowhammer attacks.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Didona:2016:PAM,
author = "Diego Didona and Nuno Diegues and Anne-Marie Kermarrec
and Rachid Guerraoui and Ricardo Neves and Paolo
Romano",
title = "{ProteusTM}: Abstraction Meets Performance in
Transactional Memory",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "757--771",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872385",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The Transactional Memory (TM) paradigm promises to
greatly simplify the development of concurrent
applications. This led, over the years, to the creation
of a plethora of TM implementations delivering wide
ranges of performance across workloads. Yet, no
universal implementation fits each and every workload.
In fact, the best TM in a given workload can reveal to
be disastrous for another one. This forces developers
to face the complex task of tuning TM implementations,
which significantly hampers their wide adoption. In
this paper, we address the challenge of automatically
identifying the best TM implementation for a given
workload. Our proposed system, ProteusTM, hides behind
the TM interface a large library of implementations.
Underneath, it leverages a novel multi-dimensional
online optimization scheme, combining two popular
learning techniques: Collaborative Filtering and
Bayesian Optimization. We integrated ProteusTM in GCC
and demonstrate its ability to switch between TMs and
adapt several configuration parameters (e.g., number of
threads). We extensively evaluated ProteusTM, obtaining
average performance {$<$3}\% from optimal, and gains up
to 100x over static alternatives.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shalev:2016:CCS,
author = "Noam Shalev and Eran Harpaz and Hagar Porat and Idit
Keidar and Yaron Weinsberg",
title = "{CSR}: Core Surprise Removal in Commodity Operating
Systems",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "773--787",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872369",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "One of the adverse effects of shrinking transistor
sizes is that processors have become increasingly prone
to hardware faults. At the same time, the number of
cores per die rises. Consequently, core failures can no
longer be ruled out, and future operating systems for
many-core machines will have to incorporate fault
tolerance mechanisms. We present CSR, a strategy for
recovery from unexpected permanent processor faults in
commodity operating systems. Our approach overcomes
surprise removal of faulty cores, and also tolerates
cascading core failures. When a core fails in user
mode, CSR terminates the process executing on that core
and migrates the remaining processes in its run-queue
to other cores. We further show how hardware
transactional memory may be used to overcome failures
in critical kernel code. Our solution is scalable,
incurs low overhead, and is designed to integrate into
modern operating systems. We have implemented it in the
Linux kernel, using Haswell's Transactional
Synchronization Extension, and tested it on a real
system.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gangwani:2016:CBS,
author = "Tanmay Gangwani and Adam Morrison and Josep
Torrellas",
title = "{CASPAR}: Breaking Serialization in Lock-Free
Multicore Synchronization",
journal = j-OPER-SYS-REV,
volume = "50",
number = "2",
pages = "789--804",
month = jun,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/2954680.2872400",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jun 9 17:03:34 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In multicores, performance-critical synchronization is
increasingly performed in a lock-free manner using
atomic instructions such as CAS or LL/SC. However, when
many processors synchronize on the same variable,
performance can still degrade significantly. Contending
writes get serialized, creating a non-scalable
condition. Past proposals that build hardware queues of
synchronizing processors do not fundamentally solve
this problem---at best, they help to efficiently
serialize the contending writes. This paper proposes a
novel architecture that breaks the serialization of
hardware queues and enables the queued processors to
perform lock-free synchronization in parallel. The
architecture, called CASPAR, is able to (1) execute the
CASes in the queued-up processors in parallel through
eager forwarding of expected values, and (2) validate
the CASes in parallel and dequeue groups of processors
at a time. The result is highly-scalable
synchronization. We evaluate CASPAR with simulations of
a 64-core chip. Compared to existing proposals with
hardware queues, CASPAR improves the throughput of
kernels by 32\% on average, and reduces the execution
time of the sections considered in lock-free versions
of applications by 47\% on average. This makes these
sections 2.5x faster than in the original
applications.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Acquaviva:2016:PSS,
author = "Jean-Thomas Acquaviva",
title = "Performance and Scalability of Storage Systems, a view
from the {WOPSSS Workshop}",
journal = j-OPER-SYS-REV,
volume = "50",
number = "3",
pages = "2--2",
month = dec,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3041710.3041712",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 9 10:38:58 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Papagiannis:2016:IOS,
author = "Anastasios Papagiannis and Giorgos Saloustros and
Manolis Marazakis and Angelos Bilas",
title = "{Iris}: an optimized {I/O} stack for low-latency
storage devices",
journal = j-OPER-SYS-REV,
volume = "50",
number = "3",
pages = "3--11",
month = dec,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3041710.3041713",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 9 10:38:58 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "System software overheads in the I/O path, including
VFS and file system code, become more pronounced with
emerging low-latency storage devices. Currently, these
overheads constitute the main bottleneck in the I/O
path and they limit efficiency of modern storage
systems. In this paper we present a taxonomy of the
current state-of-the-art systems on accelerating
accesses to fast storage devices. Furthermore, we
present Iris, a new I/O path for applications, that
minimizes overheads from system software in the common
I/O path. The main idea is the separation of the
control and data planes. The control plane consists of
an unmodified Linux kernel and is responsible for
handling data plane initialization and the normal
processing path through the kernel for non-file related
operations. The data plane is a lightweight mechanism
to provide direct access to storage devices with
minimum overheads and without sacrificing strong
protection semantics. Iris requires neither hardware
support from the storage devices nor changes in user
applications. We evaluate our early prototype and we
find that it achieves on a single core up to 1:7x and
2:2x better read and write random IOPS, respectively,
compared to the XFS and EXT4 file systems. It also
scales with the number of cores; using 4 cores Iris
achieves 1:84x and 1:96x better read and write random
IOPS, respectively. In sequential reads we provide
similar performance and in sequential writes we are
about 20\% better compared to other file systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Schenck:2016:EPM,
author = "Wolfram Schenck and Salem {El Sayed} and Maciej
Foszczynski and Wilhelm Homberg and Dirk Pleiter",
title = "Evaluation and Performance Modeling of a Burst Buffer
Solution",
journal = j-OPER-SYS-REV,
volume = "50",
number = "3",
pages = "12--26",
month = dec,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3041710.3041714",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 9 10:38:58 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Hierarchical storage architectures are required to
meet both, capacity and bandwidth requirements for
future high-end storage architectures. In this paper we
present the results of an evaluation of an emerging
technology, DataDirect Networks' (DDN) Infinite Memory
Engine (IME). IME allows to realize a fast buffer in
front of a large capacity storage system. We collected
benchmarking data with IOR and with the HPC application
NEST. The IOR bandwidth results show how well network
bandwidth towards such fast buffer can be exploited
compared to the external storage system. The NEST
benchmarks clearly demonstrate that IME can reduce
I/O-induced load imbalance between MPI ranks to a
minimum while speeding up I/O as a whole by a
considerable factor. In addition to these direct
measurements, a performance model for NEST is
developed. In combination with a generic and abstract
burst buffer architecture, this model generates
predictions about appropriate burst buffer and I/O
parameters to achieve specific performance goals for
NEST on HPC clusters of varying size. Specifically, it
is investigated in which parameter range burst buffers
are able to counteract the widening performance gap
between compute and I/O.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ouarnoughi:2016:ICP,
author = "Hamza Ouarnoughi and Jalil Boukhobza and Frank
Singhoff and St{\'e}phane Rubini",
title = "Integrating {I/Os} in {Cloudsim} for Performance and
Energy Estimation",
journal = j-OPER-SYS-REV,
volume = "50",
number = "3",
pages = "27--36",
month = dec,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3041710.3041715",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 9 10:38:58 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This article presents an extension of the IaaS Cloud
simulator CloudSim. This extension takes into account
the processing of i/o workload generated by virtual
machines within a data center, and evaluates the
overall performance and energy consumption. Indeed,
according to state-of-the-art mstudies, storage systems
energy consumption may account for as much as 40\% in a
data center. So, we modified the time computation model
of CloudSim to consider i/o operations. Additionally,
we designed several models of storage system devices
including Hard Disk Drives and Solid-State Drives. We
also modeled cpu utilization to compute the energy
consumptions related to i/o request processing. This
was achieved through machine learning techniques. Our
storage system extensions have been evaluated using
video encoding traces. The simulation results show that
a significant amount of energy, around 25\%, is
consumed due to i/o workload execution. This
corroborates the soundness of our CloudSim
extensions.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{ElSayed:2016:UFS,
author = "Salem {El Sayed} and Matthias Bolten and Dirk
Pleiter",
title = "Using file system counters in modelling parallel {I/O}
architectures",
journal = j-OPER-SYS-REV,
volume = "50",
number = "3",
pages = "37--46",
month = dec,
year = "2016",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3041710.3041716",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Feb 9 10:38:58 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Keeping compute and I/O performance balanced is a
major challenge for future cost-efficient HPC systems.
Several architectural concepts and new technologies
allow to address this challenge, however at the price
of higher complexity. As a result, the need emerges to
simulate these architectural concepts and new
technologies to predict their impact on the overall
performance. In this paper we propose a particular
approach to explore the design space using event
simulation models that take I/O server-side performance
counters as input. In this way large quantities of
real-life data measured over a large number of
applications can be used to explore architectural
modifications. We apply our approach using data
collected by a GPFS file system serving a petascale
Blue Gene/P installation.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tennenhouse:2017:RV,
author = "David Tennenhouse",
title = "Research at {VMware}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "1--4",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139647",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "VMware has its roots in the academic research
community, starting with the commercialization of the
work on x86 virtualization of Prof. Mendel Rosenblum
and his team at Stanford University [1]. Developers
embraced VMware's original workstation product and the
ensuing work on server virtualization led to today's
vSphere platform, which has enabled significant server
consolidation, numerous operational benefits, and
isolation-based security. In addition, the vast
improvements in server utilization provide VMware's
customers with significant cost savings and is a key
contributor to the environmental sustainability of
modern data centers [2]. VMware has remained true to
its research roots, with a strong engineering culture
that emphasizes grassroots innovation through
hackathons, incubation projects, open source
activities, seminars and RADIO, an annual R\&D
innovation offsite that brings together a substantial
fraction of the company's developers. Just a few
examples of current activities are open vSwitch (OVS),
the virtualization and exploration of non-volatile
memory (NVM), securing and managing the Internet of
Things (IoT), and support for Containers. Over time,
there has been a dramatic increase in the scope for
innovation at VMware. This paper provides an overview
of how that scope has grown and how it has expanded the
range of relevant research opportunities along with a
description of VMware's recently formed research group,
including its mission, composition and significant
research thrusts.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Budiu:2017:PPL,
author = "Mihai Budiu and Chris Dodd",
title = "The {P416} Programming Language",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "5--14",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139648",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "P4 is a language for expressing how packets are
processed by the data-plane of a programmable network
element such as a hardware or software switch, network
interface card, router or network function appliance.
This document describes the most recent version of the
language, P416, and the reference implementation of the
P416 compiler.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xu:2017:HAE,
author = "Xin Xu and Bhavesh Davda",
title = "A Hypervisor Approach to Enable Live Migration with
Passthrough {SR-IOV} Network Devices",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "15--23",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139649",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Single-Root I/O Virtualization (SR-IOV) is a
specification that allows a single PCI Express (PCIe)
device (physical function or PF) to be used as multiple
PCIe devices (virtual functions or VF). In a
virtualization system, each VF can be directly assigned
to a virtual machine (VM) in passthrough mode to
significantly improve the network performance. However,
VF passthrough mode is not compatible with live
migration, which is an essential capability that
enables many advanced virtualization features such as
high availability and resource provisioning. To solve
this problem, we design SRVM which provides hypervisor
support to ensure the VF device can be correctly used
by the migrated VM and the applications. SRVM is
implemented in the hypervisor without modification in
guest operating systems or guest VM drivers. SRVM does
not increase VM downtime. It only costs limited
resources (an extra CPU core only during the live
migration pre-copy phase), and there is no significant
runtime overhead in VM network performance.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Calciu:2017:HIC,
author = "Irina Calciu and Siddhartha Sen and Mahesh
Balakrishnan and Marcos K. Aguilera",
title = "How to implement any concurrent data structure for
modern servers",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "24--32",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139650",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In this paper, we propose a method to implement any
concurrent data structure. Our method produces
implementations that work particularly well in
non-uniform memory access (NUMA) machines. Due to
recent architecture trends, highly concurrent servers
today are NUMA machines, where the cost of accessing a
memory location is not the same across every core. To
fully leverage these machines, programmers need
efficient concurrent data structures that are aware of
the NUMA performance artifacts.We propose Node
Replication (NR), a black-box approach to obtaining
such data structures. NR takes an arbitrary sequential
data structure and automatically transforms it into a
NUMA-aware concurrent data structure satisfying
linearizability. Using NR requires no expertise in
concurrent data structure design, and the result is
free of concurrency bugs. NR draws ideas from two
disciplines: shared-memory algorithms and distributed
systems. Briefly, NR implements a NUMA-aware shared
log, and then uses the log to replicate data structures
consistently across NUMA nodes. The cost of NR is
additional memory for its log and replicas.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Fink:2017:VMD,
author = "Bryan Fink and Eric Knauft and Gene Zhang",
title = "{vSAN}: Modern Distributed Storage",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "33--37",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139651",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Hyper-converged storage is the state-of-the-art for
enterprise deployments. VMware's vSAN is the industry
leader in this space. This article takes a look at some
of vSAN's internal architecture and analysis frameworks
to illustrate how modern distributed storage is
designed and debugged.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Merrifield:2017:PIE,
author = "Timothy Merrifield and H. Reza Taheri",
title = "Performance Implications of Extended Page Tables on
Virtualized x86 Processors",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "38--47",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139652",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Managing virtual memory is an expensive operation, and
becomes even more expensive on virtualized servers.
Processing TLB misses on a virtualized x86 server
requires a two-dimensional page walk that can have 6x
more page table lookups, hence 6x more memory
references, than a native page table walk. Thus much of
the recent research on the subject starts from the
assumption that TLB miss processing in virtual
environments is significantly more expensive than on
native servers. However, we will show that with the
latest software stack on modern x86 processors, most of
these page table lookups are satisfied by internal
paging structure caches and the L1/L2 data caches, and
the actual virtualization overhead of TLB miss
processing is a modest fraction of the overall time
spent processing TLB misses. We show that even for the
heaviest workloads, a well-tuned application that uses
large pages on a recent OS release with a modern
hypervisor running on the latest x86 processors sees
only minimal degradation from the additional overhead
of the two-dimensional page walks in a virtualized
server.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gupta:2017:HCS,
author = "Abhishek Gupta and Rick Spillane and Wenguang Wang and
Maxime Austruy and Vahid Fereydouny and Christos
Karamanolis",
title = "Hybrid Cloud Storage: Bridging the Gap between Compute
Clusters and Cloud Storage",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "48--53",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139653",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Thanks to the compelling economics of public cloud
storage, the trend in the IT industry is to move the
bulk of analytics and application data to services such
as AWS S3 and Google Cloud Storage. At the same time,
customers want to continue accessing and analyzing much
of that data using applications that run on compute
clusters that may reside either on public clouds or
on-premise. For VMware customers, those clusters run
vSphere (sometimes with vSAN) on-premise and in the
future may utilize SDDCaaS. Cloud storage exhibits high
latencies and it is not appropriate for direct use by
applications. A key challenge for these use cases is
determining the subset of the typically huge data sets
that need to be moved into the primary storage tier of
the compute clusters. This paper introduces a novel
approach for creating a hybrid cloud storage that
allows customers to utilize the fast primary storage of
their compute clusters as a caching tier in front of a
slow secondary storage tier. This approach can be
completely transparent requiring no changes to the
application. To achieve this, we extended VDFS [16], a
POSIX-compliant scale-out filesystem, with the concept
of caching-tier volumes. VDFS caching-tier volumes
resemble regular file system volumes, but they fault-in
data from a cloud storage back-end on first access.
Cached data are persisted on fast primary storage,
close to the compute cluster, like VMware's vSAN.
Caching-tier volumes use a write-back approach. The
enterprise features of the primary storage ensure the
persistence and fault tolerance of new or updated data.
Write-back from the primary to cloud storage is managed
using an efficient change-tracking mechanism built into
VDFS called exo-clones [18]. This paper outlines the
architecture and implementation of caching tier volumes
on VDFS and reports on an initial evaluation of the
current prototype.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Amit:2017:H,
author = "Nadav Amit and Michael Wei and Cheng-Chun Tu",
title = "Hypercallbacks",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "54--59",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139654",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Soundararajan:2017:SFC,
author = "Vijayaraghavan Soundararajan and Joshua Schnee",
title = "Sustainability as a first-class metric for developers
and end-users",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "60--66",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139655",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Sustainability is increasingly important as
datacenters continue to consume vast quantities of
resources worldwide. VMware is already well-positioned
to reduce power consumption by increasing server
consolidation, as a recent IDC report attests. However,
improved server consolidation is only one piece of the
sustainability puzzle, and individual engineers may be
hard-pressed to understand how they can individually
contribute to improving sustainability. The
conventional methods for demonstrating sustainability
do not provide a true measure of the amount of impact
an individual engineer can make. In this paper, we
explore the sustainability life cycle of our products,
not just from the perspective of an end consumer, but
also from an internal developer perspective. We take
three simple use cases and explore how optimizations
can implicitly lead to improved sustainability. From
these use cases, we discuss various ways in which
sustainability can be quantified. We argue that VMware
should start recording and publishing sustainability
metrics and use these metrics to help drive customer
adoption and help drive internal productivity
improvements.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Howard:2017:RPF,
author = "Heidi Howard and Dahlia Malkhi and Sasha Spiegelman",
title = "Revisiting the {Paxos Foundations}: a Look at Summer
Internship Work at {VMware Research}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "67--71",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139656",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tu:2017:BEO,
author = "Cheng-Chun Tu and Joe Stringer and Justin Pettit",
title = "Building an Extensible {Open vSwitch} Datapath",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "72--77",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139657",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "The virtual switch is the cornerstone of the today's
virtualized data center. As all traffic to and from
virtual machines or containers must pass through a
vSwitch, it is the ideal location for network
configuration and policy enforcement. The bulk of Open
vSwitch functionality is platform-agnostic and
portable. However the datapath, which touches every
packet, is unique to each supported platform.
Maintaining each datapath requires duplicated effort
and the result has been inconsistent support of
features across platforms. Even on a single platform,
the features supported by a particular kernel version
can vary. Further, datapath functionality must be
broadly useful which prevents having
application-specific features in the fast path. eBPF,
extended Berkeley Packet Filter, enables userspace
applications to customize and extend the Linux kernel's
functionality. It provides flexible platform
abstractions for network functions, and is being ported
to a variety of platforms. This paper describes the
design, implementation, and evaluation of an eBPF-based
extensible OVS datapath. The eBPF OVS datapath delivers
the equivalent functionality of the existing OVS kernel
datapath, while significantly reducing development pain
points around maintainability and extensibility. We
demonstrate that these benefits don't necessarily have
a trade off in regards to performance, with the
eBPFbased datapath showing negligible overhead compared
to the existing kernel datapath.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dhawan:2017:CCA,
author = "Medhavi Dhawan and Gurprit Johal and Jim Stabile and
Vjekoslav Brajkovic and James Chang and Kapil Goyal and
Kevin James and Zeeshan Lokhandwala and Anny Martinez
Manzanilla and Roger Michoud and Maithem Munshed and
Srinivas Neginhal and Konstantin Spirov and Michael Wei
and Scott Fritchie and Chris Rossbach and Ittai Abraham
and Dahlia Malkhi",
title = "Consistent Clustered Applications with {Corfu}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "78--82",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139658",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "The NSX R\&D team and VMware Research team are using
Corfu to build breakthrough, auto-configurable,
auto-managed clustering management tools.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kwon:2017:IHP,
author = "Youngjin Kwon and Hangchen Yu and Simon Peter and
Christopher J. Rossbach and Emmett Witchel",
title = "{Ingens}: Huge Page Support for the {OS} and
Hypervisor",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "83--93",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139659",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Memory capacity and demand have grown hand in hand in
recent years. However, overheads for memory
virtualization, in particular for address translation,
grow with memory capacity as well, motivating hardware
manufacturers to provide TLBs with thousands of entries
for larger pages, or huge pages. Current OSes and
hypervisors support huge pages with a hodge-podge of
best-effort algorithms and spot fixes that make less
and less sense as architectural support for huge pages
matures. The time has come for a more fundamental
redesign. Ingens is a framework for providing
transparent huge page support in a coordinated way.
Ingens manages contiguity as a first-class resource,
and tracks utilization and access frequency of memory
pages, enabling it to eliminate pathologies that plague
current systems. Experiments with a Linux/KVM-based
prototype show improved fairness and performance, and
reduced tail latency and memory bloat for important
applications such as Web services and Redis. We report
early experiences with our in-progress port of Ingens
to the ESX Hypervisor.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Balasubramanian:2017:SPR,
author = "Abhiram Balasubramanian and Marek S. Baranowski and
Anton Burtsev and Aurojit Panda and Zvonimir Rakamari
and Leonid Ryzhyk",
title = "System Programming in {Rust}: Beyond Safety",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "94--99",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139660",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Rust is a new system programming language that offers
a practical and safe alternative to C. Rust is unique
in that it enforces safety without runtime overhead,
most importantly, without the overhead of garbage
collection. While zero-cost safety is remarkable on its
own, we argue that the superpowers of Rust go beyond
safety. In particular, Rust's linear type system
enables capabilities that cannot be implemented
efficiently in traditional languages, both safe and
unsafe, and that dramatically improve security and
reliability of system software. We show three examples
of such capabilities: zero-copy software fault
isolation, efficient static information flow analysis,
and automatic checkpointing. While these capabilities
have been in the spotlight of systems research for a
long time, their practical use is hindered by high cost
and complexity. We argue that with the adoption of Rust
these mechanisms will become commoditized.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Brito:2017:BSC,
author = "Alisson {Brito, Jr.} and Leandro Becker Rivalino
Matias",
title = "{6th Brazilian Symposium on Computing System
Engineering}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "100--100",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139662",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Reis:2017:SAC,
author = "Jo{\~a}o Gabriel Reis and Ant{\^o}nio Augusto
Fr{\"o}hlich",
title = "{OS} Support for Adaptive Components in Self-aware
Systems",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "101--112",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139663",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The current pace of innovation in computing makes it
difficult to assume a fixed set of requirements for the
whole life span of a system. Aggressive technology
scaling also imposes additional constraints to modern
hardware platforms. An answer to this question are
self-aware systems, which are capable of autonomously
sensing and actuating upon themselves to cope with
varying requirements. In this paper, we discuss the
design and implementation of adaptive components in
this scenario from the perspective of the OS.
Components can exist in multiple flavors that can by
dynamically chosen according to current demands. The
proposed framework supports this variability for
components while preserving their interface contracts,
even if flavors exist in different domains (software,
hardware, remote). The synthesis process delivers
tailored wrapper for components according to their
flavors . Besides reconfiguration, we also support
adaptations through dynamic power management and task
remapping. The framework also supports component
designers in terms of sensing via an event-based
mechanism. The framework is validated through a case
with three adaptive components in a telecommunication
switch (AES, ADPCM, and DTMF) with little overhead both
in terms of execution time and memory/silicon
consumption.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2017:EML,
author = "Cha V. Li and Vinicius Petrucci and Daniel Moss{\'e}",
title = "Exploring Machine Learning for Thread Characterization
on Heterogeneous Multiprocessors",
journal = j-OPER-SYS-REV,
volume = "51",
number = "1",
pages = "113--123",
month = aug,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3139645.3139664",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Sep 15 10:37:05 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/multithreading.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We introduce a thread characterization method that
explores hardware performance counters and machine
learning techniques to automate estimating workload
execution on heterogeneous processors. We show that our
characterization scheme achieves higher accuracy when
predicting performance indicators, such as instructions
per cycle and last-level cache misses, commonly used to
determine the mapping of threads to processor types at
runtime. We also show that support vector regression
achieves higher accuracy when compared to linear
regression, and has very low (1\%) overhead. The
results presented in this paper can provide a
foundation for advanced investigations and interesting
new directions in intelligent thread scheduling and
power management on multiprocessors.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:2017:BDA,
author = "Yunji Chen",
title = "Big Data Analytics and Intelligence at {Alibaba
Cloud}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "1--1",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037699",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As China's largest cloud service provider, Alibaba
Cloud has been one of the fastest growing cloud
computing platforms in the world. In this talk, I'll
present an overview of Big Data and AI computing
platform at Alibaba Cloud, which consists of a wide
range of products and services to enable fast and
efficient big data development and intelligent
analysis. The underlying computing infrastructure
supports a variety of computation scenarios, including
batch, interactive, stream, and graph computation, as
well as large-scale machine learning on heterogeneous
cloud-scale data centers. Several big data products,
such as rule-based engine, recommendation system, BI
tools, etc., are provided to address different business
needs. The platform not only supports Alibaba's
internal businesses but also provides solid services to
enterprise customers. In addition, I'll describe key
techniques and system internals, and outline
outstanding research and engineering challenges.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cherupalli:2017:DAS,
author = "Hari Cherupalli and Henry Duwe and Weidong Ye and
Rakesh Kumar and John Sartori",
title = "Determining Application-specific Peak Power and Energy
Requirements for Ultra-low Power Processors",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "3--16",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037711",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Many emerging applications such as IoT, wearables,
implantables, and sensor networks are power- and
energy-constrained. These applications rely on
ultra-low-power processors that have rapidly become the
most abundant type of processor manufactured today. In
the ultra-low-power embedded systems used by these
applications, peak power and energy requirements are
the primary factors that determine critical system
characteristics, such as size, weight, cost, and
lifetime. While the power and energy requirements of
these systems tend to be application-specific,
conventional techniques for rating peak power and
energy cannot accurately bound the power and energy
requirements of an application running on a processor,
leading to over-provisioning that increases system size
and weight. In this paper, we present an automated
technique that performs hardware-software co-analysis
of the application and ultra-low-power processor in an
embedded system to determine application-specific peak
power and energy requirements. Our technique provides
more accurate, tighter bounds than conventional
techniques for determining peak power and energy
requirements, reporting 15\% lower peak power and 17\%
lower peak energy, on average, than a conventional
approach based on profiling and guardbanding. Compared
to an aggressive stressmark-based approach, our
technique reports power and energy bounds that are 26\%
and 26\% lower, respectively, on average. Also, unlike
conventional approaches, our technique reports
guaranteed bounds on peak power and energy independent
of an application's input set. Tighter bounds on peak
power and energy can be exploited to reduce system
size, weight, and cost.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chen:2017:PPQ,
author = "Quan Chen and Hailong Yang and Minyi Guo and Ram
Srivatsa Kannan and Jason Mars and Lingjia Tang",
title = "{Prophet}: Precise {QoS} Prediction on Non-Preemptive
Accelerators to Improve Utilization in Warehouse-Scale
Computers",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "17--32",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037700",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Guaranteeing Quality-of-Service (QoS) of
latency-sensitive applications while improving server
utilization through application co-location is
important yet challenging in modern datacenters. The
key challenge is that when applications are co-located
on a server, performance interference due to resource
contention can be detrimental to the application QoS.
Although prior work has proposed techniques to identify
``safe'' co-locations where application QoS is
satisfied by predicting the performance interference on
multicores, no such prediction technique on
accelerators such as GPUs. In this work, we present
Prophet, an approach to precisely predict the
performance degradation of latency-sensitive
applications on accelerators due to application
co-location. We analyzed the performance interference
on accelerators through a real system investigation and
found that unlike on multicores where the key
contentious resources are shared caches and main memory
bandwidth, the key contentious resources on
accelerators are instead processing elements,
accelerator memory bandwidth and PCIe bandwidth. Based
on this observation, we designed interference models
that enable the precise prediction for processing
element, accelerator memory bandwidth and PCIe
bandwidth contention on real hardware. By using a novel
technique to forecast solo-run execution traces of the
co-located applications using interference models,
Prophet can accurately predict the performance
degradation of latency-sensitive applications on
non-preemptive accelerators. Using Prophet, we can
identify ``safe'' co-locations on accelerators to
improve utilization without violating the QoS target.
Our evaluation shows that Prophet can predict the
performance degradation with an average prediction
error 5.47\% on real systems. Meanwhile, based on the
prediction, Prophet achieves accelerator utilization
improvements of 49.9\% on average while maintaining the
QoS target of latency-sensitive applications.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kanev:2017:MAM,
author = "Svilen Kanev and Sam Likun Xi and Gu-Yeon Wei and
David Brooks",
title = "{Mallacc}: Accelerating Memory Allocation",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "33--45",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037736",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Recent work shows that dynamic memory allocation
consumes nearly 7\% of all cycles in Google
datacenters. With the trend towards increased
specialization of hardware, we propose Mallacc, an
in-core hardware accelerator designed for broad use
across a number of high-performance, modern memory
allocators. The design of Mallacc is quite different
from traditional throughput-oriented hardware
accelerators. Because memory allocation requests tend
to be very frequent, fast, and interspersed inside
other application code, accelerators must be optimized
for latency rather than throughput and area overheads
must be kept to a bare minimum. Mallacc accelerates the
three primary operations of a typical memory allocation
request: size class computation, retrieval of a free
memory block, and sampling of memory usage. Our results
show that malloc latency can be reduced by up to 50\%
with a hardware cost of less than 1500 um2 of silicon
area, less than 0.006\% of a typical high-performance
processor core.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wen:2017:REV,
author = "Shasha Wen and Milind Chabbi and Xu Liu",
title = "{REDSPY}: Exploring Value Locality in Software",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "47--61",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037729",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Complex code bases with several layers of abstractions
have abundant inefficiencies that affect the execution
time. Value redundancy is a kind of inefficiency where
the same values are repeatedly computed, stored, or
retrieved over the course of execution. Not all
redundancies can be easily detected or eliminated with
compiler optimization passes due to the inherent
limitations of the static analysis. Microscopic
observation of whole executions at instruction- and
operand-level granularity breaks down abstractions and
helps recognize redundancies that masquerade in complex
programs. We have developed REDSPY---a fine-grained
profiler to pinpoint and quantify redundant operations
in program executions. Value redundancy may happen over
time at same locations or in adjacent locations, and
thus it has temporal and spatial locality. REDSPY
identifies both temporal and spatial value locality.
Furthermore, REDSPY is capable of identifying values
that are approximately the same, enabling optimization
opportunities in HPC codes that often use floating
point computations. REDSPY provides intuitive
optimization guidance by apportioning redundancies to
their provenance---source lines and execution calling
contexts. REDSPY pinpointed dramatically high volume of
redundancies in programs that were optimization targets
for decades, such as SPEC CPU2006 suite, Rodinia
benchmark, and NWChem---a production computational
chemistry code. Guided by REDSPY, we were able to
eliminate redundancies that resulted in significant
speedups.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bhattacharjee:2017:TTP,
author = "Abhishek Bhattacharjee",
title = "Translation-Triggered Prefetching",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "63--76",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037705",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We propose translation-enabled memory prefetching
optimizations or TEMPO, a low-overhead hardware
mechanism to boost memory performance by exploiting the
operating system's (OS) virtual memory subsystem. We
are the first to make the following observations: (1) a
substantial fraction (20-40\%) of DRAM references in
modern big- data workloads are devoted to accessing
page tables; and (2) when memory references require
page table lookups in DRAM, the vast majority of them
(98\%+) also look up DRAM for the subsequent data
access. TEMPO exploits these observations to enable
DRAM row-buffer and on-chip cache prefetching of the
data that page tables point to. TEMPO requires trivial
changes to the memory controller (under 3\% additional
area), no OS or application changes, and improves
performance by 10-30\% and energy by 1-14\%.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2017:TAA,
author = "Channoh Kim and Jaehyeok Kim and Sungmin Kim and
Dooyoung Kim and Namho Kim and Gitae Na and Young H. Oh
and Hyeon Gyu Cho and Jae W. Lee",
title = "Typed Architectures: Architectural Support for
Lightweight Scripting",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "77--90",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037726",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Dynamic scripting languages are becoming more and more
widely adopted not only for fast prototyping but also
for developing production-grade applications. They
provide high-productivity programming environments
featuring high levels of abstraction with powerful
built-in functions, automatic memory management,
object-oriented programming paradigm and dynamic
typing. However, their flexible, dynamic type systems
easily become the source of inefficiency in terms of
instruction count, memory footprint, and energy
consumption. This overhead makes it challenging to
deploy these high-productivity programming technologies
on emerging single-board computers for IoT
applications. Addressing this challenge, this paper
introduces Typed Architectures, a high-efficiency,
low-cost execution substrate for dynamic scripting
languages, where each data variable retains high-level
type information at an ISA level. Typed Architectures
calculate and check the dynamic type of each variable
implicitly in hardware, rather than explicitly in
software, hence significantly reducing instruction
count for dynamic type checking. Besides, Typed
Architectures introduce polymorphic instructions (e.g.,
xadd), which are bound to the correct native
instruction at runtime within the pipeline (e.g., add
or fadd) to efficiently implement polymorphic
operators. Finally, Typed Architectures provide
hardware support for flexible yet efficient type tag
extraction and insertion, capturing common data layout
patterns of tag-value pairs. Our evaluation using a
fully synthesizable RISC-V RTL design on FPGA shows
that Typed Architectures achieve geomean speedups of
11.2\% and 9.9\% with maximum speedups of 32.6\% and
43.5\% for two production-grade scripting engines for
JavaScript and Lua, respectively. Moreover, Typed
Architectures improve the energy-delay product (EDP) by
19.3\% for JavaScript and 16.5\% for Lua with an area
overhead of 1.6\% at a 40nm technology node.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Seo:2017:FAS,
author = "Jihye Seo and Wook-Hee Kim and Woongki Baek and
Beomseok Nam and Sam H. Noh",
title = "Failure-Atomic Slotted Paging for Persistent Memory",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "91--104",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037737",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The slotted-page structure is a database page format
commonly used for managing variable-length records. In
this work, we develop a novel ``failure-atomic slotted
page structure'' for persistent memory that leverages
byte addressability and durability of persistent memory
to minimize redundant write operations used to maintain
consistency in traditional database systems.
Failure-atomic slotted paging consists of two key
elements: (i) in-place commit per page using hardware
transactional memory and (ii) slot header logging that
logs the commit mark of each page. The proposed scheme
is implemented in SQLite and compared against NVWAL,
the current state-of-the-art scheme. Our performance
study shows that our failure-atomic slotted paging
shows optimal performance for database transactions
that insert a single record. For transactions that
touch more than one database page, our proposed
slot-header logging scheme minimizes the logging
overhead by avoiding duplicating pages and logging only
the metadata of the dirty pages. Overall, we find that
our failure-atomic slotted-page management scheme
reduces database logging overhead to 1/6 and improves
query response time by up to 33\% compared to NVWAL.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nguyen:2017:WSP,
author = "Donald Nguyen and Keshav Pingali",
title = "What Scalable Programs Need from Transactional
Memory",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "105--118",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037750",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Transactional memory (TM) has been the focus of
numerous studies, and it is supported in processors
such as the IBM Blue Gene/Q and Intel Haswell. Many
studies have used the STAMP benchmark suite to evaluate
their designs. However, the speedups obtained for the
STAMP benchmarks on all TM systems we know of are quite
limited; for example, with 64 threads on the IBM Blue
Gene/Q, we observe a median speedup of 1.4X using the
Blue Gene/Q hardware transactional memory (HTM), and a
median speedup of 4.1X using a software transactional
memory (STM). What limits the performance of these
benchmarks on TMs? In this paper, we argue that the
problem lies with the programming model and data
structures used to write them. To make this point, we
articulate two principles that we believe must be
embodied in any scalable program and argue that STAMP
programs violate both of them. By modifying the STAMP
programs to satisfy both principles, we produce a new
set of programs that we call the Stampede suite. Its
median speedup on the Blue Gene/Q is 8.0X when using an
STM. The two principles also permit us to simplify the
TM design. Using this new STM with the Stampede
benchmarks, we obtain a median speedup of 17.7X with 64
threads on the Blue Gene/Q and 13.2X with 32 threads on
an Intel Westmere system. These results suggest that
HTM and STM designs will benefit if more attention is
paid to the division of labor between application
programs, systems software, and hardware.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Trippel:2017:TMM,
author = "Caroline Trippel and Yatin A. Manerkar and Daniel
Lustig and Michael Pellauer and Margaret Martonosi",
title = "{TriCheck}: Memory Model Verification at the
Trisection of Software, Hardware, and {ISA}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "119--133",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037719",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Memory consistency models (MCMs) which govern
inter-module interactions in a shared memory system,
are a significant, yet often under-appreciated, aspect
of system design. MCMs are defined at the various
layers of the hardware-software stack, requiring
thoroughly verified specifications, compilers, and
implementations at the interfaces between layers.
Current verification techniques evaluate segments of
the system stack in isolation, such as proving compiler
mappings from a high-level language (HLL) to an ISA or
proving validity of a microarchitectural implementation
of an ISA. This paper makes a case for full-stack MCM
verification and provides a toolflow, TriCheck, capable
of verifying that the HLL, compiler, ISA, and
implementation collectively uphold MCM requirements.
The work showcases TriCheck's ability to evaluate a
proposed ISA MCM in order to ensure that each layer and
each mapping is correct and complete. Specifically, we
apply TriCheck to the open source RISC-V ISA [55],
seeking to verify accurate, efficient, and legal
compilations from C11. We uncover under-specifications
and potential inefficiencies in the current RISC-V ISA
documentation and identify possible solutions for each.
As an example, we find that a RISC-V-compliant
microarchitecture allows 144 outcomes forbidden by C11
to be observed out of 1,701 litmus tests examined.
Overall, this paper demonstrates the necessity of
full-stack verification for detecting MCM-related bugs
in the hardware-software stack.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Nalli:2017:APM,
author = "Sanketh Nalli and Swapnil Haria and Mark D. Hill and
Michael M. Swift and Haris Volos and Kimberly Keeton",
title = "An Analysis of Persistent Memory Use with {WHISPER}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "135--148",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037730",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Emerging non-volatile memory (NVM) technologies
promise durability with read and write latencies
comparable to volatile memory (DRAM). We define
Persistent Memory (PM) as NVM accessed with byte
addressability at low latency via normal memory
instructions. Persistent-memory applications ensure the
consistency of persistent data by inserting ordering
points between writes to PM allowing the construction
of higher-level transaction mechanisms. An epoch is a
set of writes to PM between ordering points. To put
systems research in PM on a firmer footing, we
developed and analyzed a PM benchmark suite called
WHISPER (Wisconsin-HP Labs Suite for Persistence) that
comprises ten PM applications we gathered to cover all
current interfaces to PM. A quantitative analysis
reveals several insights: (a) only 4\% of writes in
PM-aware applications are to PM and the rest are to
volatile memory, (b) software transactions are often
implemented with 5 to 50 ordering points (c) 75\% of
epochs update exactly one 64B cache line, (d) 80\% of
epochs from the same thread depend on previous epochs
from the same thread, while few epochs depend on epochs
from other threads. Based on our analysis, we propose
the Hands-off Persistence System (HOPS) to track
updates to PM in hardware. Current hardware design
requires applications to force data to PM as each epoch
ends. HOPS provides high-level ISA primitives for
applications to express durability and ordering
constraints separately and enforces them automatically,
while achieving 24.3\% better performance over current
approaches to persistence.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2017:PPD,
author = "Tong Zhang and Changhee Jung and Dongyoon Lee",
title = "{ProRace}: Practical Data Race Detection for
Production Use",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "149--162",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037708",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents ProRace, a dynamic data race
detector practical for production runs. It is
lightweight, but still offers high race detection
capability. To track memory accesses, ProRace leverages
instruction sampling using the performance monitoring
unit (PMU) in commodity processors. Our PMU driver
enables ProRace to sample more memory accesses at a
lower cost compared to the state-of-the-art Linux
driver. Moreover, ProRace uses PMU-provided execution
contexts including register states and program path,
and reconstructs unsampled memory accesses offline.
This technique allows \ProRace to overcome inherent
limitations of sampling and improve the detection
coverage by performing data race detection on the trace
with not only sampled but also reconstructed memory
accesses. Experiments using racy production software
including apache and mysql shows that, with a
reasonable offline cost, ProRace incurs only 2.6\%
overhead at runtime with 27.5\% detection probability
with a sampling period of 10,000.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Olson:2017:CGM,
author = "Lena E. Olson and Mark D. Hill and David A. Wood",
title = "Crossing Guard: Mediating Host-Accelerator Coherence
Interactions",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "163--176",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037715",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Specialized hardware accelerators have performance and
energy-efficiency advantages over general-purpose
processors. To fully realize these benefits and aid
programmability, accelerators may share a physical and
virtual address space and full cache coherence with the
host system. However, allowing accelerators ---
particularly those designed by third parties --- to
directly communicate with host coherence protocols
poses several problems. Host coherence protocols are
complex, vary between companies, and may be
proprietary, increasing burden on accelerator
designers. Bugs in the accelerator implementation may
cause crashes and other serious consequences to the
host system. We propose Crossing Guard, a coherence
interface between the host coherence system and
accelerators. The Crossing Guard interface provides the
accelerator designer with a standardized set of
coherence messages that are simple enough to aid in
design of bug-free coherent caches. At the same time,
they are sufficiently complex to allow customized and
optimized accelerator caches with performance
comparable to using the host protocol. The Crossing
Guard hardware is implemented as part of the trusted
host, and provides complete safety to the host
coherence system, even in the presence of a
pathologically buggy accelerator cache.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{McMahan:2017:ASF,
author = "Joseph McMahan and Michael Christensen and Lawton
Nichols and Jared Roesch and Sung-Yee Guo and Ben
Hardekopf and Timothy Sherwood",
title = "An Architecture Supporting Formal and Compositional
Binary Analysis",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "177--191",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037733",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Building a trustworthy life-critical embedded system
requires deep reasoning about the potential effects
that sequences of machine instructions can have on full
system operation. Rather than trying to analyze
complete binaries and the countless ways their
instructions can interact with one another --- memory,
side effects, control registers, implicit state, etc.
--- we explore a new approach. We propose an
architecture controlled by a thin computational layer
designed to tightly correspond with the lambda
calculus, drawing on principles of functional
programming to bring the assembly much closer to myriad
reasoning frameworks, such as the Coq proof assistant.
This approach allows assembly-level verified versions
of critical code to operate safely in tandem with
arbitrary code, including imperative and unverified
system components, without the need for large
supporting trusted computing bases. We demonstrate that
this computational layer can be built in such a way as
to simultaneously provide full programmability and
compact, precise, and complete semantics, while still
using hardware resources comparable to normal embedded
systems. To demonstrate the practicality of this
approach, our FPGA-implemented prototype runs an
embedded medical application which monitors and treats
life-threatening arrhythmias. Though the system
integrates untrusted and imperative components, our
architecture allows for the formal verification of
multiple properties of the end-to-end system, including
a proof of correctness of the assembly-level
implementation of the core algorithm, the integrity of
trusted data via a non-interference proof, and a
guarantee that our prototype meets critical timing
requirements.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hsiao:2017:ASI,
author = "Chun-Hung Hsiao and Satish Narayanasamy and Essam
Muhammad Idris Khan and Cristiano L. Pereira and Gilles
A. Pokam",
title = "{AsyncClock}: Scalable Inference of Asynchronous Event
Causality",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "193--205",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037712",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Asynchronous programming model is commonly used in
mobile systems and Web 2.0 environments. Asynchronous
race detectors use algorithms that are an order of
magnitude performance and space inefficient compared to
conventional data race detectors. We solve this problem
by identifying and addressing two important problems in
reasoning about causality between asynchronous events.
Unlike conventional signal-wait operations,
establishing causal order between two asynchronous
events is fundamentally more challenging as there is no
common handle they operate on. We propose a new
primitive named AsyncClock that addresses this problem
by explicitly tracking causally preceding events, and
show that AsyncClock can handle a wide variety of
asynchronous causality models. We also address the
important scalability problem of efficiently
identifying heirless events whose metadata can be
reclaimed. We built the first single-pass,
non-graph-based Android race detector using our
algorithm and applied it to find errors in 20 popular
applications. Our tool incurs about 6x performance
overhead, which is several times more efficient than
the state-of-the-art solution. It also scales well with
the execution length. We used our tool to find 147
previously unknown harmful races.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Calciu:2017:BBC,
author = "Irina Calciu and Siddhartha Sen and Mahesh
Balakrishnan and Marcos K. Aguilera",
title = "Black-box Concurrent Data Structures for {NUMA}
Architectures",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "207--221",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037721",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "High-performance servers are Non-Uniform Memory Access
(NUMA) machines. To fully leverage these machines,
programmers need efficient concurrent data structures
that are aware of the NUMA performance artifacts. We
propose Node Replication (NR), a black-box approach to
obtaining such data structures. NR takes an arbitrary
sequential data structure and automatically transforms
it into a NUMA-aware concurrent data structure
satisfying linearizability. Using NR requires no
expertise in concurrent data structure design, and the
result is free of concurrency bugs. NR draws ideas from
two disciplines: shared-memory algorithms and
distributed systems. Briefly, NR implements a
NUMA-aware shared log, and then uses the log to
replicate data structures consistently across NUMA
nodes. NR is best suited for contended data structures,
where it can outperform lock-free algorithms by 3.1x,
and lock-based solutions by 30x. To show the benefits
of NR to a real application, we apply NR to the data
structures of Redis, an in-memory storage system. The
result outperforms other methods by up to 14x. The cost
of NR is additional memory for its log and replicas.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vora:2017:CCR,
author = "Keval Vora and Chen Tian and Rajiv Gupta and Ziang
Hu",
title = "{CoRAL}: Confined Recovery in Distributed Asynchronous
Graph Processing",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "223--236",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037747",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Existing distributed asynchronous graph processing
systems employ checkpointing to capture globally
consistent snapshots and rollback all machines to most
recent checkpoint to recover from machine failures. In
this paper we argue that recovery in distributed
asynchronous graph processing does not require the
entire execution state to be rolled back to a globally
consistent state due to the relaxed asynchronous
execution semantics. We define the properties required
in the recovered state for it to be usable for correct
asynchronous processing and develop CoRAL, a
lightweight checkpointing and recovery algorithm.
First, this algorithm carries out confined recovery
that only rolls back graph execution states of the
failed machines to affect recovery. Second, it relies
upon lightweight checkpoints that capture locally
consistent snapshots with a reduced peak network
bandwidth requirement. Our experiments using real-world
graphs show that our technique recovers from failures
and finishes processing 1.5x to 3.2x faster compared to
the traditional asynchronous checkpointing and recovery
mechanism when failures impact 1 to 6 machines of a 16
machine cluster. Moreover, capturing locally consistent
snapshots significantly reduces intermittent high peak
bandwidth usage required to save the snapshots --- the
average reduction in 99th percentile bandwidth ranges
from 22\% to 51\% while 1 to 6 snapshot replicas are
being maintained.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vora:2017:KFA,
author = "Keval Vora and Rajiv Gupta and Guoqing Xu",
title = "{KickStarter}: Fast and Accurate Computations on
Streaming Graphs via Trimmed Approximations",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "237--251",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037748",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Continuous processing of a streaming graph maintains
an approximate result of the iterative computation on a
recent version of the graph. Upon a user query, the
accurate result on the current graph can be quickly
computed by feeding the approximate results to the
iterative computation --- a form of incremental
computation that corrects the (small amount of) error
in the approximate result. Despite the effectiveness of
this approach in processing growing graphs, it is
generally not applicable when edge deletions are
present --- existing approximations can lead to either
incorrect results (e.g., monotonic computations
terminate at an incorrect minima/maxima) or poor
performance (e.g., with approximations, convergence
takes longer than performing the computation from
scratch). This paper presents KickStarter, a runtime
technique that can trim the approximate values for a
subset of vertices impacted by the deleted edges. The
trimmed approximation is both safe and profitable,
enabling the computation to produce correct results and
converge quickly. KickStarter works for a class of
monotonic graph algorithms and can be readily
incorporated in any existing streaming graph system.
Our experiments with four streaming algorithms on five
large graphs demonstrate that trimming not only
produces correct results but also accelerates these
algorithms by 8.5--23.7x.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Powers:2017:BBG,
author = "Bobby Powers and John Vilk and Emery D. Berger",
title = "{Browsix}: Bridging the Gap Between {Unix} and the
Browser",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "253--266",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037727",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Applications written to run on conventional operating
systems typically depend on OS abstractions like
processes, pipes, signals, sockets, and a shared file
system. Porting these applications to the web currently
requires extensive rewriting or hosting significant
portions of code server-side because browsers present a
nontraditional runtime environment that lacks OS
functionality. This paper presents Browsix, a framework
that bridges the considerable gap between conventional
operating systems and the browser, enabling unmodified
programs expecting a Unix-like environment to run
directly in the browser. Browsix comprises two core
parts: (1) a JavaScript-only system that makes core
Unix features (including pipes, concurrent processes,
signals, sockets, and a shared file system) available
to web applications; and (2) extended JavaScript
runtimes for C, C++, Go, and Node.js that support
running programs written in these languages as
processes in the browser. Browsix supports running a
POSIX shell, making it straightforward to connect
applications together via pipes. We illustrate
Browsix's capabilities via case studies that
demonstrate how it eases porting legacy applications to
the browser and enables new functionality. We
demonstrate a Browsix-enabled LaTeX editor that
operates by executing unmodified versions of pdfLaTeX
and BibTeX. This browser-only LaTeX editor can render
documents in seconds, making it fast enough to be
practical. We further demonstrate how Browsix lets us
port a client--server application to run entirely in
the browser for disconnected operation. Creating these
applications required less than 50 lines of glue code
and no code modifications, demonstrating how easily
Browsix can be used to build sophisticated web
applications from existing parts without
modification.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Rajbhandari:2017:OCM,
author = "Samyam Rajbhandari and Yuxiong He and Olatunji Ruwase
and Michael Carbin and Trishul Chilimbi",
title = "Optimizing {CNNs} on Multicores for Scalability,
Performance and Goodput",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "267--280",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037745",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Convolutional Neural Networks (CNN) are a class of Ar-
tificial Neural Networks (ANN) that are highly
efficient at the pattern recognition tasks that
underlie difficult AI prob- lems in a variety of
domains, such as speech recognition, object
recognition, and natural language processing. CNNs are,
however, computationally intensive to train. This paper
presents the first characterization of the per-
formance optimization opportunities for training CNNs
on CPUs. Our characterization includes insights based
on the structure of the network itself (i.e., intrinsic
arithmetic inten- sity of the convolution and its
scalability under parallelism) as well as dynamic
properties of its execution (i.e., sparsity of the
computation). Given this characterization, we present
an automatic framework called spg-CNN for optimizing
CNN training on CPUs. It comprises of a computation
scheduler for efficient parallel execution, and two
code generators: one that opti- mizes for sparsity, and
the other that optimizes for spatial reuse in
convolutions. We evaluate spg-CNN using convolutions
from a variety of real world benchmarks, and show that
spg-CNN can train CNNs faster than state-of-the-art
approaches by an order of magnitude.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Sundararajah:2017:LTN,
author = "Kirshanthan Sundararajah and Laith Sakka and Milind
Kulkarni",
title = "Locality Transformations for Nested Recursive
Iteration Spaces",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "281--295",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037720",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "There has been a significant amount of effort invested
in designing scheduling transformations such as loop
tiling and loop fusion that rearrange the execution of
dynamic instances of loop nests to place operations
that access the same data close together temporally. In
recent years, there has been interest in designing
similar transformations that operate on recursive
programs, but until now these transformations have only
considered simple scenarios: multiple recursions to be
fused, or a recursion nested inside a simple loop. This
paper develops the first set of scheduling
transformations for nested recursions: recursive
methods that call other recursive methods. These are
the recursive analog to nested loops. We present a
transformation called recursion twisting that
automatically improves locality at all levels of the
memory hierarchy, and show that this transformation can
yield substantial performance improvements across
several benchmarks that exhibit nested recursion.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2017:LAC,
author = "Ang Li and Shuaiwen Leon Song and Weifeng Liu and Xu
Liu and Akash Kumar and Henk Corporaal",
title = "Locality-Aware {CTA} Clustering for Modern {GPUs}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "297--311",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037709",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cache is designed to exploit locality; however, the
role of on-chip L1 data caches on modern GPUs is often
awkward. The locality among global memory requests from
different SMs (Streaming Multiprocessors) is
predominantly harvested by the commonly-shared L2 with
long access latency; while the in-core locality, which
is crucial for performance delivery, is handled
explicitly by user-controlled scratchpad memory. In
this work, we disclose another type of data locality
that has been long ignored but with performance
boosting potential --- the inter-CTA locality.
Exploiting such locality is rather challenging due to
unclear hardware feasibility, unknown and inaccessible
underlying CTA scheduler, and small in-core cache
capacity. To address these issues, we first conduct a
thorough empirical exploration on various modern GPUs
and demonstrate that inter-CTA locality can be
harvested, both spatially and temporally, on L1 or
L1/Tex unified cache. Through further quantification
process, we prove the significance and commonality of
such locality among GPU applications, and discuss
whether such reuse is exploitable. By leveraging these
insights, we propose the concept of CTA-Clustering and
its associated software-based techniques to reshape the
default CTA scheduling in order to group the CTAs with
potential reuse together on the same SM. Our techniques
require no hardware modification and can be directly
deployed on existing GPUs. In addition, we incorporate
these techniques into an integrated framework for
automatic inter-CTA locality optimization. We evaluate
our techniques using a wide range of popular GPU
applications on all modern generations of NVIDIA GPU
architectures. The results show that our proposed
techniques significantly improve cache performance
through reducing L2 cache transactions by 55\%, 65\%,
29\%, 28\% on average for Fermi, Kepler, Maxwell and
Pascal, respectively, leading to an average of 1.46x,
1.48x, 1.45x, 1.41x (up to 3.8x, 3.6x, 3.1x, 3.3x)
performance speedups for applications with
algorithm-related inter-CTA reuse.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Churchill:2017:SLS,
author = "Berkeley Churchill and Rahul Sharma and JF Bastien and
Alex Aiken",
title = "Sound Loop Superoptimization for {Google Native
Client}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "313--326",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037754",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Software fault isolation (SFI) is an important
technique for the construction of secure operating
systems, web browsers, and other extensible software.
We demonstrate that superoptimization can dramatically
improve the performance of Google Native Client, a SFI
system that ships inside the Google Chrome Browser. Key
to our results are new techniques for superoptimization
of loops: we propose a new architecture for
superoptimization tools that incorporates both a fully
sound verification technique to ensure correctness and
a bounded verification technique to guide the search to
optimized code. In our evaluation we optimize 13 libc
string functions, formally verify the correctness of
the optimizations and report a median and average
speedup of 25\% over the libraries shipped by Google.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bianchini:2017:IDE,
author = "Ricardo Bianchini",
title = "Improving Datacenter Efficiency",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "327--327",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3046426",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Internet companies can improve datacenter efficiency
and reduce costs, by minimizing resource waste while
avoiding (or limiting) performance degradation. In this
talk, I will first overview a few of the
efficiency-related efforts we are undertaking at
Microsoft, including leveraging workload history to
improve resource management. I will then discuss some
lessons from deploying these efforts in production and
how they relate to academic research.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liu:2017:DBD,
author = "Mengxing Liu and Mingxing Zhang and Kang Chen and
Xuehai Qian and Yongwei Wu and Weimin Zheng and Jinglei
Ren",
title = "{DudeTM}: Building Durable Transactions with
Decoupling for Persistent Memory",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "329--343",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037714",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Emerging non-volatile memory (NVM) offers
non-volatility, byte-addressability and fast access at
the same time. To make the best use of these
properties, it has been shown by empirical evidence
that programs should access NVM directly through CPU
load and store instructions, so that the overhead of a
traditional file system or database can be avoided.
Thus, durable transactions become a common choice of
applications for accessing persistent memory data in a
crash consistent manner. However, existing durable
transaction systems employ either undo logging, which
requires a fence for every memory write, or redo
logging, which requires intercepting all memory reads
within transactions. This paper presents DUDETM, a
crash-consistent durable transaction system that avoids
the drawbacks of both undo logging and redo logging.
DUDETM uses shadow DRAM to decouple the execution of a
durable transaction into three fully asynchronous
steps. The advantage is that only minimal fences and no
memory read instrumentation are required. This design
also enables an out-of-the-box transactional memory
(TM) to be used as an independent component in our
system. The evaluation results show that DUDETM adds
durability to a TM system with only 7.4 ~ 24.6\%
throughput degradation. Compared to the existing
durable transaction systems, DUDETM provides 1.7times
to 4.4times higher throughput. Moreover, DUDETM can be
implemented with existing hardware TMs with minor
hardware modifications, leading to a further 1.7times
speedup.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Klimovic:2017:RRF,
author = "Ana Klimovic and Heiner Litz and Christos Kozyrakis",
title = "{ReFlex}: Remote Flash $ \approx $ Local Flash",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "345--359",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037732",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Remote access to NVMe Flash enables flexible scaling
and high utilization of Flash capacity and IOPS within
a datacenter. However, existing systems for remote
Flash access either introduce significant performance
overheads or fail to isolate the multiple remote
clients sharing each Flash device. We present ReFlex, a
software-based system for remote Flash access, that
provides nearly identical performance to accessing
local Flash. ReFlex uses a dataplane kernel to closely
integrate networking and storage processing to achieve
low latency and high throughput at low resource
requirements. Specifically, ReFlex can serve up to 850K
IOPS per core over TCP/IP networking, while adding 21us
over direct access to local Flash. ReFlex uses a QoS
scheduler that can enforce tail latency and throughput
service-level objectives (SLOs) for thousands of remote
clients. We show that ReFlex allows applications to use
remote Flash while maintaining their original
performance with local Flash.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jevdjic:2017:ASC,
author = "Djordje Jevdjic and Karin Strauss and Luis Ceze and
Henrique S. Malvar",
title = "Approximate Storage of Compressed and Encrypted
Videos",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "361--373",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037718",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The popularization of video capture devices has
created strong storage demand for encoded videos.
Approximate storage can ease this demand by enabling
denser storage at the expense of occasional errors.
Unfortunately, even minor storage errors, such as bit
flips, can result in major visual damage in encoded
videos. Similarly, video encryption, widely employed
for privacy and digital rights management, may create
long dependencies between bits that show little or no
tolerance to storage errors. In this paper we propose
VideoApp, a novel and efficient methodology to compute
bit-level reliability requirements for encoded videos
by tracking visual and metadata dependencies within
encoded bitstreams. We further show how VideoApp can be
used to trade video quality for storage density in an
optimal way. We integrate our methodology into a
popular H.264 encoder to partition an encoded video
stream into multiple streams that can receive different
levels of error correction according to their
reliability needs. When applied to a dense and highly
error-prone multi-level cell storage substrate, our
variable error correction mechanism reduces the error
correction overhead by half under the most
error-intolerant encoder settings, achieving
quality/density points that neither compression nor
approximation can achieve alone. Finally, we define the
basic invariants needed to support encrypted
approximate video storage. We present an analysis of
block cipher modes of operation, showing that some are
fully compatible with approximation, enabling
approximate and secure video storage systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Elyasi:2017:EIR,
author = "Nima Elyasi and Mohammad Arjomand and Anand
Sivasubramaniam and Mahmut T. Kandemir and Chita R. Das
and Myoungsoo Jung",
title = "Exploiting Intra-Request Slack to Improve {SSD}
Performance",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "375--388",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037728",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With Solid State Disks (SSDs) offering high degrees of
parallelism, SSD controllers place data and direct
requests to exploit the maximum offered hardware
parallelism. In the quest to maximize parallelism and
utilization, sub-requests of a request that are
directed to different flash chips by the scheduler can
experience differential wait times since their
individual queues are not coordinated and load balanced
at all times. Since the macro request is considered
complete only when its last sub-request completes, some
of its sub-requests that complete earlier have to
necessarily wait for this last sub-request. This paper
opens the door to a new class of schedulers to leverage
such slack between sub-requests in order to improve
response times. Specifically, the paper presents the
design and implementation of a slack-enabled
re-ordering scheduler, called Slacker, for sub-requests
issued to each flash chip. Layered under a modern SSD
request scheduler, Slacker estimates the slack of each
incoming sub-request to a flash chip and allows them to
jump ahead of existing sub-requests with sufficient
slack so as to not detrimentally impact their response
times. Slacker is simple to implement and imposes only
marginal additions to the hardware. Using a spectrum of
21 workloads with diverse read-write characteristics,
we show that Slacker provides as much as 19.5\%, 13\%
and 14.5\% improvement in response times, with average
improvements of 12\%, 6.5\% and 8.5\%, for
write-intensive, read-intensive and read-write balanced
workloads, respectively.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wang:2017:GSM,
author = "Kai Wang and Aftab Hussain and Zhiqiang Zuo and
Guoqing Xu and Ardalan Amiri Sani",
title = "{Graspan}: a Single-machine Disk-based Graph System
for Interprocedural Static Analyses of Large-scale
Systems Code",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "389--404",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037744",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "There is more than a decade-long history of using
static analysis to find bugs in systems such as Linux.
Most of the existing static analyses developed for
these systems are simple checkers that find bugs based
on pattern matching. Despite the presence of many
sophisticated interprocedural analyses, few of them
have been employed to improve checkers for systems code
due to their complex implementations and poor
scalability. In this paper, we revisit the scalability
problem of interprocedural static analysis from a ``Big
Data'' perspective. That is, we turn sophisticated code
analysis into Big Data analytics and leverage novel
data processing techniques to solve this traditional
programming language problem. We develop Graspan, a
disk-based parallel graph system that uses an edge-pair
centric computation model to compute dynamic transitive
closures on very large program graphs. We implement
context-sensitive pointer/alias and dataflow analyses
on Graspan. An evaluation of these analyses on large
codebases such as Linux shows that their Graspan
implementations scale to millions of lines of code and
are much simpler than their original implementations.
Moreover, we show that these analyses can be used to
augment the existing checkers; these augmented checkers
uncovered 132 new NULL pointer bugs and 1308
unnecessary NULL tests in Linux 4.4.0-rc5, PostgreSQL
8.3.9, and Apache httpd 2.2.18.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ren:2017:SDH,
author = "Ao Ren and Zhe Li and Caiwen Ding and Qinru Qiu and
Yanzhi Wang and Ji Li and Xuehai Qian and Bo Yuan",
title = "{SC--DCNN}: Highly-Scalable Deep Convolutional Neural
Network using Stochastic Computing",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "405--418",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037746",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With the recent advance of wearable devices and
Internet of Things (IoTs), it becomes attractive to
implement the Deep Convolutional Neural Networks
(DCNNs) in embedded and portable systems. Currently,
executing the software-based DCNNs requires
high-performance servers, restricting the widespread
deployment on embedded and mobile IoT devices. To
overcome this obstacle, considerable research efforts
have been made to develop highly-parallel and
specialized DCNN accelerators using GPGPUs, FPGAs or
ASICs. Stochastic Computing (SC), which uses a
bit-stream to represent a number within [-1, 1] by
counting the number of ones in the bit-stream, has high
potential for implementing DCNNs with high scalability
and ultra-low hardware footprint. Since multiplications
and additions can be calculated using AND gates and
multiplexers in SC, significant reductions in power
(energy) and hardware footprint can be achieved
compared to the conventional binary arithmetic
implementations. The tremendous savings in power
(energy) and hardware resources allow immense design
space for enhancing scalability and robustness for
hardware DCNNs. This paper presents SC-DCNN, the first
comprehensive design and optimization framework of
SC-based DCNNs, using a bottom-up approach. We first
present the designs of function blocks that perform the
basic operations in DCNN, including inner product,
pooling, and activation function. Then we propose four
designs of feature extraction blocks, which are in
charge of extracting features from input feature maps,
by connecting different basic function blocks with
joint optimization. Moreover, the efficient weight
storage methods are proposed to reduce the area and
power (energy) consumption. Putting all together, with
feature extraction blocks carefully selected, SC-DCNN
is holistically optimized to minimize area and power
(energy) consumption while maintaining high network
accuracy. Experimental results demonstrate that the
LeNet5 implemented in SC-DCNN consumes only 17 mm$^2$
area and 1.53 W power, achieves throughput of 781250
images/s, area efficiency of 45946 images/s/ mm$^2$,
and energy efficiency of 510734 images/J.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ajay:2017:GIL,
author = "Jerry Ajay and Chen Song and Aditya Singh Rathore and
Chi Zhou and Wenyao Xu",
title = "{$3$DGates}: an Instruction-Level Energy Analysis and
Optimization of {$3$D} Printers",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "419--433",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037752",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As the next-generation manufacturing driven force, 3D
printing technology is having a transformative effect
on various industrial domains and has been widely
applied in a broad spectrum of applications. It also
progresses towards other versatile fields with portable
battery-powered 3D printers working on a limited energy
budget. While reducing manufacturing energy is an
essential challenge in industrial sustainability and
national economics, this growing trend motivates us to
explore the energy consumption of the 3D printer for
the purpose of energy efficiency. To this end, we
perform an in-depth analysis of energy consumption in
commercial, off-the-shelf 3D printers from an
instruction-level perspective. We build an
instruction-level energy model and an energy profiler
to analyze the energy cost during the fabrication
process. From the insights obtained by the energy
profiler, we propose and implement a cross-layer energy
optimization solution, called 3DGates, which spans the
instruction-set, the compiler and the firmware. We
evaluate 3DGates over 338 benchmarks on a 3D printer
and achieve an overall energy reduction of 25\%.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Cox:2017:EAT,
author = "Guilherme Cox and Abhishek Bhattacharjee",
title = "Efficient Address Translation for Architectures with
Multiple Page Sizes",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "435--448",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037704",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Processors and operating systems (OSes) support
multiple memory page sizes. Superpages increase
Translation Lookaside Buffer (TLB) hits, while small
pages provide fine-grained memory protection. Ideally,
TLBs should perform well for any distribution of page
sizes. In reality, set-associative TLBs --- used
frequently for their energy efficiency compared to
fully-associative TLBs --- cannot (easily) support
multiple page sizes concurrently. Instead, commercial
systems typically implement separate set-associative
TLBs for different page sizes. This means that when
superpages are allocated aggressively, TLB misses may,
counter intuitively, increase even if entries for small
pages remain unused (and vice-versa). We invent MIX
TLBs, energy-frugal set-associative structures that
concurrently support all page sizes by exploiting
superpage allocation patterns. MIX TLBs boost the
performance (often by 10-30\%) of big-memory
applications on native CPUs, virtualized CPUs, and
GPUs. MIX TLBs are simple and require no OS or program
changes.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lesokhin:2017:PFS,
author = "Ilya Lesokhin and Haggai Eran and Shachar Raindel and
Guy Shapiro and Sagi Grimberg and Liran Liss and Muli
Ben-Yehuda and Nadav Amit and Dan Tsafrir",
title = "Page Fault Support for Network Controllers",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "449--466",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037710",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Direct network I/O allows network controllers (NICs)
to expose multiple instances of themselves, to be used
by untrusted software without a trusted intermediary.
Direct I/O thus frees researchers from legacy software,
fueling studies that innovate in multitenant setups.
Such studies, however, overwhelmingly ignore one
serious problem: direct memory accesses (DMAs) of NICs
disallow page faults, forcing systems to either pin
entire address spaces to physical memory and thereby
hinder memory utilization, or resort to APIs that
pin/unpin memory buffers before/after they are DMAed,
which complicates the programming model and hampers
performance. We solve this problem by designing and
implementing page fault support for InfiniBand and
Ethernet NICs. A main challenge we tackle---unique to
NICs---is handling receive DMAs that trigger page
faults, leaving the NIC without memory to store the
incoming data. We demonstrate that our solution
provides all the benefits associated with ``regular''
virtual memory, notably (1) a simpler programming model
that rids users from the need to pin, and (2) the
ability to employ all the canonical memory
optimizations, such as memory overcommitment and
demand-paging based on actual use. We show that, as a
result, benchmark performance improves by up to 1.9x.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Hu:2017:TFC,
author = "Yang Hu and Mingcong Song and Tao Li",
title = "Towards ``Full Containerization'' in Containerized
Network Function Virtualization",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "467--481",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037713",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "With exploding traffic stuffing existing network
infra-structure, today's telecommunication and cloud
service providers resort to Network Function
Virtualization (NFV) for greater agility and economics.
Pioneer service provider such as AT{\&}T proposes to
adopt container in NFV to achieve shorter Virtualized
Network Function (VNF) provisioning time and better
runtime performance. However, we characterize typical
NFV work-loads on the containers and find that the
performance is unsatisfactory. We observe that the
shared host OS net-work stack is the main bottleneck,
where the traffic flow processing involves a large
amount of intermediate memory buffers and results in
significant last level cache pollution. Existing OS
memory allocation policies fail to exploit the locality
and data sharing information among buffers. In this
paper, we propose NetContainer, a software framework
that achieves fine-grained hardware resource management
for containerized NFV platform. NetContainer employs a
cache access overheads guided page coloring scheme to
coordinately address the inter-flow cache access
overheads and intra-flow cache access overheads. It
maps the memory buffer pages that manifest low cache
access overheads (across a flow or among the flows) to
the same last level cache partition. NetContainer
exploits a footprint theory based method to estimate
the cache access overheads and a Min-Cost Max-Flow
model to guide the memory buffer mappings. We implement
the NetContainer in Linux kernel and extensively
evaluate it with real NFV workloads. Exper-imental
results show that NetContainer outperforms conventional
page coloring-based memory allocator by 48\% in terms
of successful call rate.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Wu:2017:FEF,
author = "Bo Wu and Xu Liu and Xiaobo Zhou and Changjun Jiang",
title = "{FLEP}: Enabling Flexible and Efficient Preemption on
{GPUs}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "483--496",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037742",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "GPUs are widely adopted in HPC and cloud computing
platforms to accelerate general-purpose workloads.
However, modern GPUs do not support flexible
preemption, leading to performance and priority
inversion problems in multi-tasking environments. In
this paper, we propose and develop FLEP, the first
software system that enables flexible kernel preemption
and kernel scheduling on commodity GPUs. The FLEP
compilation engine transforms the GPU program into
preemptable forms, which can be interrupted during
execution and yield all or part of the streaming
multi-processors (SMs) in the GPU. The FLEP runtime
engine intercepts all kernel invocations and determines
which kernels and how those kernels should be preempted
and scheduled. Experimental results on two-kernel
co-runs demonstrate up to 24.2X speedup for
high-priority kernels and up to 27X improvement on
normalized average turnaround time for kernels with the
same priority. FLEP reduces the preemption latency by
up to 41\% compared to yielding the whole GPU when the
waiting kernels only need several SMs. With all the
benefits, FLEP only introduces 2.5\% runtime overhead,
which is substantially lower than the kernel slicing
approach.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Li:2017:SSA,
author = "Kaiwei Li and Jianfei Chen and Wenguang Chen and Jun
Zhu",
title = "{SaberLDA}: Sparsity-Aware Learning of Topic Models on
{GPUs}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "497--509",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037740",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Latent Dirichlet Allocation (LDA) is a popular tool
for analyzing discrete count data such as text and
images. Applications require LDA to handle both large
datasets and a large number of topics. Though
distributed CPU systems have been used, GPU-based
systems have emerged as a promising alternative because
of the high computational power and memory bandwidth of
GPUs. However, existing GPU-based LDA systems cannot
support a large number of topics because they use
algorithms on dense data structures whose time and
space complexity is linear to the number of topics. In
this paper, we propose SaberLDA, a GPU-based LDA system
that implements a sparsity-aware algorithm to achieve
sublinear time complexity and scales well to learn a
large number of topics. To address the challenges
introduced by sparsity, we propose a novel data layout,
a new warp-based sampling kernel, and an efficient
sparse count matrix updating algorithm that improves
locality, makes efficient utilization of GPU warps, and
reduces memory consumption. Experiments show that
SaberLDA can learn from billions-token-scale data with
up to 10,000 topics, which is almost two orders of
magnitude larger than that of the previous GPU-based
systems. With a single GPU card, SaberLDA is able to
learn 10,000 topics from a dataset of billions of
tokens in a few hours, which is only achievable with
clusters with tens of machines before.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Khazraee:2017:MNO,
author = "Moein Khazraee and Lu Zhang and Luis Vega and Michael
Bedford Taylor",
title = "Moonwalk: {NRE} Optimization in {ASIC} Clouds",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "511--526",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037749",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud services are becoming increasingly globalized
and data-center workloads are expanding exponentially.
GPU and FPGA-based clouds have illustrated improvements
in power and performance by accelerating
compute-intensive workloads. ASIC-based clouds are a
promising way to optimize the Total Cost of Ownership
(TCO) of a given datacenter computation (e.g. YouTube
transcoding) by reducing both energy consumption and
marginal computation cost. The feasibility of an ASIC
Cloud for a particular application is directly gated by
the ability to manage the Non-Recurring Engineering
(NRE) costs of designing and fabricating the ASIC, so
that it is significantly lower (e.g. 2X) than the TCO
of the best available alternative. In this paper, we
show that technology node selection is a major tool for
managing ASIC Cloud NRE, and allows the designer to
trade off an accelerator's excess energy efficiency and
cost performance for lower total cost. We explore NRE
and cross-technology optimization of ASIC Clouds for
four different applications: Bitcoin mining,
YouTube-style video transcoding, Litecoin, and Deep
Learning. We address these challenges and show large
reductions in the NRE, potentially enabling ASIC Clouds
to address a wider variety of datacenter workloads. Our
results suggest that advanced nodes like 16nm will lead
to sub-optimal TCO for many workloads, and that use of
older nodes like 65nm can enable a greater diversity of
ASIC Clouds.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Park:2017:DRM,
author = "Jason Jong Kyu Park and Yongjun Park and Scott
Mahlke",
title = "Dynamic Resource Management for Efficient Utilization
of Multitasking {GPUs}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "527--540",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037707",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "As graphics processing units (GPUs) are broadly
adopted, running multiple applications on a GPU at the
same time is beginning to attract wide attention.
Recent proposals on multitasking GPUs have focused on
either spatial multitasking, which partitions GPU
resource at a streaming multiprocessor (SM)
granularity, or simultaneous multikernel (SMK), which
runs multiple kernels on the same SM. However,
multitasking performance varies heavily depending on
the resource partitions within each scheme, and the
application mixes. In this paper, we propose GPU
Maestro that performs dynamic resource management for
efficient utilization of multitasking GPUs. GPU Maestro
can discover the best performing GPU resource partition
exploiting both spatial multitasking and SMK.
Furthermore, dynamism within a kernel and interference
between the kernels are automatically considered
because GPU Maestro finds the best performing partition
through direct measurements. Evaluations show that GPU
Maestro can improve average system throughput by 20.2\%
and 13.9\% over the baseline spatial multitasking and
SMK, respectively.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2017:ISC,
author = "Rui Zhang and Natalie Stanley and Christopher Griggs
and Andrew Chi and Cynthia Sturton",
title = "Identifying Security Critical Properties for the
Dynamic Verification of a Processor",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "541--554",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037734",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present a methodology for identifying security
critical properties for use in the dynamic verification
of a processor. Such verification has been shown to be
an effective way to prevent exploits of vulnerabilities
in the processor, given a meaningful set of security
properties. We use known processor errata to establish
an initial set of security-critical invariants of the
processor. We then use machine learning to infer an
additional set of invariants that are not tied to any
particular, known vulnerability, yet are critical to
security. We build a tool chain implementing the
approach and evaluate it for the open-source OR1200
RISC processor. We find that our tool can identify 19
(86.4\%) of the 22 manually crafted security-critical
properties from prior work and generates 3 new security
properties not covered in prior work.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ferraiuolo:2017:VPH,
author = "Andrew Ferraiuolo and Rui Xu and Danfeng Zhang and
Andrew C. Myers and G. Edward Suh",
title = "Verification of a Practical Hardware Security
Architecture Through Static Information Flow Analysis",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "555--568",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037739",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Hardware-based mechanisms for software isolation are
becoming increasingly popular, but implementing these
mechanisms correctly has proved difficult, undermining
the root of security. This work introduces an effective
way to formally verify important properties of such
hardware security mechanisms. In our approach, hardware
is developed using a lightweight security-typed
hardware description language (HDL) that performs
static information flow analysis. We show the
practicality of our approach by implementing and
verifying a simplified but realistic multi-core
prototype of the ARM TrustZone architecture. To make
the security-typed HDL expressive enough to verify a
realistic processor, we develop new type system
features. Our experiments suggest that information flow
analysis is efficient, and programmer effort is modest.
We also show that information flow constraints are an
effective way to detect hardware vulnerabilities,
including several found in commercial processors.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Chisnall:2017:CJS,
author = "David Chisnall and Brooks Davis and Khilan Gudka and
David Brazdil and Alexandre Joannou and Jonathan
Woodruff and A. Theodore Markettos and J. Edward Maste
and Robert Norton and Stacey Son and Michael Roe and
Simon W. Moore and Peter G. Neumann and Ben Laurie and
Robert N. M. Watson",
title = "{CHERI JNI}: Sinking the {Java} Security Model into
the {C}",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "569--583",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037725",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/java2010.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Java provides security and robustness by building a
high-level security model atop the foundation of memory
protection. Unfortunately, any native code linked into
a Java program --- including the million lines used to
implement the standard library --- is able to bypass
both the memory protection and the higher-level
policies. We present a hardware-assisted implementation
of the Java native code interface, which extends the
guarantees required for Java's security model to native
code. Our design supports safe direct access to buffers
owned by the JVM, including hardware-enforced read-only
access where appropriate. We also present Java language
syntax to declaratively describe isolated compartments
for native code. We show that it is possible to
preserve the memory safety and isolation requirements
of the Java security model in C code, allowing native
code to run in the same process as Java code with the
same impact on security as running equivalent Java
code. Our approach has a negligible impact on
performance, compared with the existing unsafe native
code interface. We demonstrate a prototype
implementation running on the CHERI microprocessor
synthesized in FPGA.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ge:2017:GGC,
author = "Xinyang Ge and Weidong Cui and Trent Jaeger",
title = "{GRIFFIN}: Guarding Control Flows Using {Intel}
Processor Trace",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "585--598",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037716",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Researchers are actively exploring techniques to
enforce control-flow integrity (CFI), which restricts
program execution to a predefined set of targets for
each indirect control transfer to prevent code-reuse
attacks. While hardware-assisted CFI enforcement may
have the potential for advantages in performance and
flexibility over software instrumentation, current
hardware-assisted defenses are either incomplete (i.e.,
do not enforce all control transfers) or less efficient
in comparison. We find that the recent introduction of
hardware features to log complete control-flow traces,
such as Intel Processor Trace (PT), provides an
opportunity to explore how efficient and flexible a
hardware-assisted CFI enforcement system may become.
While Intel PT was designed to aid in offline debugging
and failure diagnosis, we explore its effectiveness for
online CFI enforcement over unmodified binaries by
designing a parallelized method for enforcing various
types of CFI policies. We have implemented a prototype
called GRIFFIN in the Linux 4.2 kernel that enables
complete CFI enforcement over a variety of software,
including the Firefox browser and its jitted code. Our
experiments show that GRIFFIN can enforce fine-grained
CFI policies with shadow stack as recommended by
researchers at a performance that is comparable to
software-only instrumentation techniques. In addition,
we find that alternative logging approaches yield
significant performance improvements for trace
processing, identifying opportunities for further
hardware assistance.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Delimitrou:2017:BKW,
author = "Christina Delimitrou and Christos Kozyrakis",
title = "{Bolt}: {I} Know What You Did Last Summer \ldots{} In
The Cloud",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "599--613",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037703",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Cloud providers routinely schedule multiple
applications per physical host to increase efficiency.
The resulting interference on shared resources often
leads to performance degradation and, more importantly,
security vulnerabilities. Interference can leak
important information ranging from a service's
placement to confidential data, like private keys. We
present Bolt, a practical system that accurately
detects the type and characteristics of applications
sharing a cloud platform based on the interference an
adversary sees on shared resources. Bolt leverages
online data mining techniques that only require 2-5
seconds for detection. In a multi-user study on EC2,
Bolt correctly identifies the characteristics of 385
out of 436 diverse workloads. Extracting this
information enables a wide spectrum of
previously-impractical cloud attacks, including denial
of service attacks (DoS) that increase tail latency by
140x, as well as resource freeing (RFA) and
co-residency attacks. Finally, we show that while
advanced isolation mechanisms, such as cache
partitioning lower detection accuracy, they are
insufficient to eliminate these vulnerabilities
altogether. To do so, one must either disallow core
sharing, or only allow it between threads of the same
application, leading to significant inefficiencies and
performance penalties.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kang:2017:NCI,
author = "Yiping Kang and Johann Hauswald and Cao Gao and Austin
Rovinski and Trevor Mudge and Jason Mars and Lingjia
Tang",
title = "Neurosurgeon: Collaborative Intelligence Between the
Cloud and Mobile Edge",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "615--629",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037698",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The computation for today's intelligent personal
assistants such as Apple Siri, Google Now, and
Microsoft Cortana, is performed in the cloud. This
cloud-only approach requires significant amounts of
data to be sent to the cloud over the wireless network
and puts significant computational pressure on the
datacenter. However, as the computational resources in
mobile devices become more powerful and energy
efficient, questions arise as to whether this
cloud-only processing is desirable moving forward, and
what are the implications of pushing some or all of
this compute to the mobile devices on the edge. In this
paper, we examine the status quo approach of cloud-only
processing and investigate computation partitioning
strategies that effectively leverage both the cycles in
the cloud and on the mobile device to achieve low
latency, low energy consumption, and high datacenter
throughput for this class of intelligent applications.
Our study uses 8 intelligent applications spanning
computer vision, speech, and natural language domains,
all employing state-of-the-art Deep Neural Networks
(DNNs) as the core machine learning technique. We find
that given the characteristics of DNN algorithms, a
fine-grained, layer-level computation partitioning
strategy based on the data and computation variations
of each layer within a DNN has significant latency and
energy advantages over the status quo approach. Using
this insight, we design Neurosurgeon, a lightweight
scheduler to automatically partition DNN computation
between mobile devices and datacenters at the
granularity of neural network layers. Neurosurgeon does
not require per-application profiling. It adapts to
various DNN architectures, hardware platforms, wireless
networks, and server load levels, intelligently
partitioning computation for best latency or best
mobile energy. We evaluate Neurosurgeon on a
state-of-the-art mobile development platform and show
that it improves end-to-end latency by 3.1X on average
and up to 40.7X, reduces mobile energy consumption by
59.5\% on average and up to 94.7\%, and improves
datacenter throughput by 1.5X on average and up to
6.7X.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Agarwal:2017:TAT,
author = "Neha Agarwal and Thomas F. Wenisch",
title = "Thermostat: Application-transparent Page Management
for Two-tiered Main Memory",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "631--644",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037706",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The advent of new memory technologies that are denser
and cheaper than commodity DRAM has renewed interest in
two-tiered main memory schemes. Infrequently accessed
application data can be stored in such memories to
achieve significant memory cost savings. Past research
on two-tiered main memory has assumed a 4KB page size.
However, 2MB huge pages are performance critical in
cloud applications with large memory footprints,
especially in virtualized cloud environments, where
nested paging drastically increases the cost of 4KB
page management. We present Thermostat, an
application-transparent huge-page-aware mechanism to
place pages in a dual-technology hybrid memory system
while achieving both the cost advantages of two-tiered
memory and performance advantages of transparent huge
pages. We present an online page classification
mechanism that accurately classifies both 4KB and 2MB
pages as hot or cold while incurring no observable
performance overhead across several representative
cloud applications. We implement Thermostat in Linux
kernel version 4.5 and evaluate its effectiveness on
representative cloud computing workloads running under
KVM virtualization. We emulate slow memory with
performance characteristics approximating near-future
high-density memory technology and show that Thermostat
migrates up to 50\% of application footprint to slow
memory while limiting performance degradation to 3\%,
thereby reducing memory cost up to 30\%.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Barbalace:2017:BBH,
author = "Antonio Barbalace and Robert Lyerly and Christopher
Jelesnianski and Anthony Carno and Ho-Ren Chuang and
Vincent Legout and Binoy Ravindran",
title = "Breaking the Boundaries in Heterogeneous-{ISA}
Datacenters",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "645--659",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037738",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Energy efficiency is one of the most important design
considerations in running modern datacenters.
Datacenter operating systems rely on software
techniques such as execution migration to achieve
energy efficiency across pools of machines. Execution
migration is possible in datacenters today because they
consist mainly of homogeneous-ISA machines. However,
recent market trends indicate that alternate ISAs such
as ARM and PowerPC are pushing into the datacenter,
meaning current execution migration techniques are no
longer applicable. How can execution migration be
applied in future heterogeneous-ISA datacenters? In
this work we present a compiler, runtime, and an
operating system extension for enabling execution
migration between heterogeneous-ISA servers. We present
a new multi-ISA binary architecture and
heterogeneous-OS containers for facilitating efficient
migration of natively-compiled applications. We build
and evaluate a prototype of our design and demonstrate
energy savings of up to 66\% for a workload running on
an ARM and an x86 server interconnected by a high-speed
network.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lustig:2017:ASC,
author = "Daniel Lustig and Andrew Wright and Alexandros
Papakonstantinou and Olivier Giroux",
title = "Automated Synthesis of Comprehensive Memory Model
Litmus Test Suites",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "661--675",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037723",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The memory consistency model is a fundamental part of
any shared memory architecture or programming model.
Modern weak memory models are notoriously difficult to
define and to implement correctly. Most real-world
programming languages, compilers, and
(micro)architectures therefore rely heavily on
black-box testing methodologies. The success of such
techniques requires that the suite of litmus tests used
to perform the testing be comprehensive--it should
ideally stress all obscure corner cases of the model
and of its implementation. Most litmus test suites
today are generated from some combination of manual
effort and randomization; however, the complex and
subtle nature of contemporary memory models means that
manual effort is both error-prone and subject to
incomplete coverage. This paper presents a methodology
for synthesizing comprehensive litmus test suites
directly from a memory model specification. By
construction, these suites contain all tests satisfying
a minimality criterion: that no synchronization
mechanism in the test can be weakened without causing
new behaviors to become observable. We formalize this
notion using the Alloy modeling language, and we apply
it to a number of existing and newly-proposed memory
models. Our results show not only that this synthesis
technique can automatically reproduce all
manually-generated tests from existing suites, but also
that it discovers new tests that are not as well
studied.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liu:2017:DAD,
author = "Haopeng Liu and Guangpu Li and Jeffrey F. Lukman and
Jiaxin Li and Shan Lu and Haryadi S. Gunawi and Chen
Tian",
title = "{DCatch}: Automatically Detecting Distributed
Concurrency Bugs in Cloud Systems",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "677--691",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037735",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In big data and cloud computing era, reliability of
distributed systems is extremely important.
Unfortunately, distributed concurrency bugs, referred
to as DCbugs, widely exist. They hide in the large
state space of distributed cloud systems and manifest
non-deterministically depending on the timing of
distributed computation and communication. Effective
techniques to detect DCbugs are desired. This paper
presents a pilot solution, DCatch, in the world of
DCbug detection. DCatch predicts DCbugs by analyzing
correct execution of distributed systems. To build
DCatch, we design a set of happens-before rules that
model a wide variety of communication and concurrency
mechanisms in real-world distributed cloud systems. We
then build runtime tracing and trace analysis tools to
effectively identify concurrent conflicting memory
accesses in these systems. Finally, we design tools to
help prune false positives and trigger DCbugs. We have
evaluated DCatch on four representative open-source
distributed cloud systems, Cassandra, Hadoop MapReduce,
HBase, and ZooKeeper. By monitoring correct execution
of seven workloads on these systems, DCatch reports 32
DCbugs, with 20 of them being truly harmful.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mashtizadeh:2017:TPD,
author = "Ali Jos{\'e} Mashtizadeh and Tal Garfinkel and David
Terei and David Mazieres and Mendel Rosenblum",
title = "Towards Practical Default-On Multi-Core Record\slash
Replay",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "693--708",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037751",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present Castor, a record/replay system for
multi-core applications that provides consistently low
and predictable overheads. With Castor, developers can
leave record and replay on by default, making it
practical to record and reproduce production bugs, or
employ fault tolerance to recover from hardware
failures. Castor is inspired by several observations:
First, an efficient mechanism for logging
non-deterministic events is critical for recording
demanding workloads with low overhead. Through careful
use of hardware we were able to increase log throughput
by 10x or more, e.g., we could record a server handling
10x more requests per second for the same record
overhead. Second, most applications can be recorded
without modifying source code by using the compiler to
instrument language level sources of non-determinism,
in conjunction with more familiar techniques like
shared library interposition. Third, while Castor
cannot deterministically replay all data races, this
limitation is generally unimportant in practice,
contrary to what prior work has assumed. Castor
currently supports applications written in C, C++, and
Go on FreeBSD. We have evaluated Castor on parallel and
server workloads, including a commercial implementation
of memcached in Go, which runs Castor in production.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Huang:2017:PSA,
author = "Jian Huang and Michael Allen-Bond and Xuechen Zhang",
title = "{Pallas}: Semantic-Aware Checking for Finding Deep
Bugs in Fast Path",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "709--722",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037743",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Software optimization is constantly a serious concern
for developing high-performance systems. To accelerate
the workflow execution of a specific functionality,
software developers usually define and implement a fast
path to speed up the critical and commonly executed
functions in the workflow. However, producing a
bug-free fast path is nontrivial. Our study on the
Linux kernel discloses that a committed fast path can
have up to 19 follow-up patches for bug fixing, and
most of them are deep semantic bugs, which are
difficult to be pinpointed by existing bug-finding
tools. In this paper, we present such a new category of
software bugs based on our fast-path bug study across
various system software including virtual memory
manager, file systems, network, and device drivers. We
investigate their root causes and identify five
error-prone aspects in a fast path: path state, trigger
condition, path output, fault handling, and assistant
data structure. We find that many of the deep bugs can
be prevented by applying static analysis incorporating
simple semantic information. We extract a set of rules
based on our findings and build a toolkit PALLAS to
check fast-path bugs. The evaluation results show that
PALLAS can effectively reveal fast-path bugs in a
variety of systems including Linux kernel, mobile
operating system, software-defined networking system,
and web browser.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kotra:2017:HSC,
author = "Jagadish B. Kotra and Narges Shahidi and Zeshan A.
Chishti and Mahmut T. Kandemir",
title = "Hardware-Software Co-design to Mitigate {DRAM} Refresh
Overheads: a Case for Refresh-Aware Process
Scheduling",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "723--736",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037724",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "DRAM cells need periodic refresh to maintain data
integrity. With high capacity DRAMs, DRAM refresh poses
a significant performance bottleneck as the number of
rows to be refreshed (and hence the refresh cycle time,
tRFC) with each refresh command increases. Modern day
DRAMs perform refresh at a rank-level, while LPDDRs
used in mobile environments support refresh at a
per-bank level. Rank-level refresh degrades the
performance significantly since none of the banks in a
rank can serve the on-demand requests. Per-bank refresh
alleviates some of the performance bottlenecks as the
other banks in a rank are available for on-demand
requests. Typical DRAM retention time is in the order
several of milliseconds, viz, 64msec for environments
operating in temperatures below 85 deg C and 32msec for
environments operating above 85 deg C. With systems
moving towards increased consolidation (ex: virtualized
environments), DRAM refresh becomes a significant
bottleneck as it reduces the available overall DRAM
bandwidth per task. In this work, we propose a
hardware-software co-design to mitigate DRAM refresh
overheads by exposing the hardware address mapping and
DRAM refresh schedule to the Operating System. We
propose a novel DRAM refresh-aware process scheduling
algorithm in OS which schedules applications on cores
such that none of the on-demand requests from the
application are stalled by refreshes. Extensive
evaluation of our proposed co-design on
multi-programmed SPEC CPU2006 workloads show
significant performance improvement compared to the
previously proposed hardware only approaches.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kim:2017:KPC,
author = "Jinchun Kim and Elvira Teran and Paul V. Gratz and
Daniel A. Jim{\'e}nez and Seth H. Pugsley and Chris
Wilkerson",
title = "Kill the Program Counter: Reconstructing Program
Behavior in the Processor Cache Hierarchy",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "737--749",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037701",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Data prefetching and cache replacement algorithms have
been intensively studied in the design of high
performance microprocessors. Typically, the data
prefetcher operates in the private caches and does not
interact with the replacement policy in the shared
Last-Level Cache (LLC). Similarly, most replacement
policies do not consider demand and prefetch requests
as different types of requests. In particular, program
counter (PC)-based replacement policies cannot learn
from prefetch requests since the data prefetcher does
not generate a PC value. PC-based policies can also be
negatively affected by compiler optimizations. In this
paper, we propose a holistic cache management technique
called Kill-the-PC (KPC) that overcomes the weaknesses
of traditional prefetching and replacement policy
algorithms. KPC cache management has three novel
contributions. First, a prefetcher which approximates
the future use distance of prefetch requests based on
its prediction confidence. Second, a simple replacement
policy provides similar or better performance than
current state-of-the-art PC-based prediction using
global hysteresis. Third, KPC integrates prefetching
and replacement policy into a whole system which is
greater than the sum of its parts. Information from the
prefetcher is used to improve the performance of the
replacement policy and vice-versa. Finally, KPC removes
the need to propagate the PC through entire on-chip
cache hierarchy while providing a holistic cache
management approach with better performance than
state-of-the-art PC-, and non-PC-based schemes. Our
evaluation shows that KPC provides 8\% better
performance than the best combination of existing
prefetcher and replacement policy for multi-core
workloads.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gao:2017:TSE,
author = "Mingyu Gao and Jing Pu and Xuan Yang and Mark Horowitz
and Christos Kozyrakis",
title = "{TETRIS}: Scalable and Efficient Neural Network
Acceleration with {$3$D} Memory",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "751--764",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037702",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The high accuracy of deep neural networks (NNs) has
led to the development of NN accelerators that improve
performance by two orders of magnitude. However,
scaling these accelerators for higher performance with
increasingly larger NNs exacerbates the cost and energy
overheads of their memory systems, including the
on-chip SRAM buffers and the off-chip DRAM channels.
This paper presents the hardware architecture and
software scheduling and partitioning techniques for
TETRIS, a scalable NN accelerator using 3D memory.
First, we show that the high throughput and low energy
characteristics of 3D memory allow us to rebalance the
NN accelerator design, using more area for processing
elements and less area for SRAM buffers. Second, we
move portions of the NN computations close to the DRAM
banks to decrease bandwidth pressure and increase
performance and energy efficiency. Third, we show that
despite the use of small SRAM buffers, the presence of
3D memory simplifies dataflow scheduling for NN
computations. We present an analytical scheduling
scheme that matches the efficiency of schedules derived
through exhaustive search. Finally, we develop a hybrid
partitioning scheme that parallelizes the NN
computations over multiple accelerators. Overall, we
show that TETRIS improves mthe performance by 4.1x and
reduces the energy by 1.5x over NN accelerators with
conventional, low-power DRAM memory systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Song:2017:HBA,
author = "Wonjun Song and Gwangsun Kim and Hyungjoon Jung and
Jongwook Chung and Jung Ho Ahn and Jae W. Lee and John
Kim",
title = "History-Based Arbitration for Fairness in
Processor-Interconnect of {NUMA} Servers",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "765--777",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037753",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "NUMA (non-uniform memory access) servers are commonly
used in high-performance computing and datacenters.
Within each server, a processor-interconnect (e.g.,
Intel QPI, AMD HyperTransport) is used to communicate
between the different sockets or nodes. In this work,
we explore the impact of the processor-interconnect on
overall performance --- in particular, the performance
un- fairness caused by processor-interconnect
arbitration. It is well known that locally-fair
arbitration does not guarantee globally-fair bandwidth
sharing as closer nodes receive more bandwidth in a
multi-hop network. However, this work demonstrates that
the opposite can occur in a commodity NUMA server where
remote nodes receive higher bandwidth (and perform
better). We analyze this problem and iden- tify that
this occurs because of external concentration used in
router micro-architectures for processor-interconnects
without globally-aware arbitration. While accessing
remote memory can occur in any NUMA system, performance
un- fairness (or performance variation) is more
critical in cloud computing and virtual machines with
shared resources. We demonstrate how this unfairness
creates significant performance variation when a
workload is executed on the Xen virtualization
platform. We then provide analysis using synthetic
workloads to better understand the source of unfair-
ness and eliminate the impact of other shared
resources, including the shared last-level cache and
main memory. To provide fairness, we propose a novel,
history-based arbitration that tracks the history of
arbitration grants made in the previous history window.
A weighted arbitration is done based on the history to
provide global fairness. Through simulations, we show
our proposed history-based arbitration can provide
global fairness and minimize the processor-
interconnect performance unfairness at low cost.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Misra:2017:ELT,
author = "Pulkit A. Misra and Jeffrey S. Chase and Johannes
Gehrke and Alvin R. Lebeck",
title = "Enabling Lightweight Transactions with Precision
Time",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "779--794",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037722",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Distributed transactional storage is an important
service in today's data centers. Achieving high
performance without high complexity is often a
challenge for these systems due to sophisticated
consistency protocols and multiple layers of
abstraction. In this paper we show how to combine two
emerging technologies---Software-Defined Flash (SDF)
and precise synchronized clocks---to improve
performance and reduce complexity for transactional
storage within the data center. We present a
distributed transactional system (called MILANA) as a
layer above a durable multi-version key-value store
(called SEMEL) for read-heavy workloads within a data
center. SEMEL exploits write behavior of SSDs to
maintain a time-ordered sequence of versions for each
key efficiently and durably. MILANA adds a variant of
optimistic concurrency control above SEMEL's API to
service read requests from a consistent snapshot and to
enable clients to make fast local commit or abort
decisions for read-only transactions. Experiments with
the prototype reveal up to 43\% lower transaction abort
rates using IEEE Precision Time Protocol (PTP) vs. the
standard Network Time Protocol (NTP). Under the Retwis
benchmark, client-local validation of read-only
transactions yields a 35\% reduction in latency and
55\% increase in transaction throughput.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liu:2017:ITN,
author = "Ming Liu and Liang Luo and Jacob Nelson and Luis Ceze
and Arvind Krishnamurthy and Kishore Atreya",
title = "{IncBricks}: Toward In-Network Computation with an
In-Network Cache",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "795--809",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037731",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The emergence of programmable network devices and the
increasing data traffic of datacenters motivate the
idea of in-network computation. By offloading compute
operations onto intermediate networking devices (e.g.,
switches, network accelerators, middleboxes), one can
(1) serve network requests on the fly with low latency;
(2) reduce datacenter traffic and mitigate network
congestion; and (3) save energy by running servers in a
low-power mode. However, since (1) existing switch
technology doesn't provide general computing
capabilities, and (2) commodity datacenter networks are
complex (e.g., hierarchical fat-tree topologies,
multipath communication), enabling in-network
computation inside a datacenter is challenging. In this
paper, as a step towards in-network computing, we
present IncBricks, an in-network caching fabric with
basic computing primitives. IncBricks is a
hardware-software co-designed system that supports
caching in the network using a programmable network
middlebox. As a key-value store accelerator, our
prototype lowers request latency by over 30\% and
doubles throughput for 1024 byte values in a common
cluster configuration. Our results demonstrate the
effectiveness of in-network computing and that
efficient datacenter network request processing is
possible if we carefully split the computation across
the different programmable computing elements in a
datacenter, including programmable switches, network
accelerators, and end hosts.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Akturk:2017:AAA,
author = "Ismail Akturk and Ulya R. Karpuzcu",
title = "{AMNESIAC}: Amnesic Automatic Computer",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "811--824",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037741",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Due to imbalances in technology scaling, the energy
consumption of data storage and communication by far
exceeds the energy consumption of actual data
production, i.e., computation. As a consequence,
recomputing data can become more energy efficient than
storing and retrieving precomputed data. At the same
time, recomputation can relax the pressure on the
memory hierarchy and the communication bandwidth. This
study hence assesses the energy efficiency prospects of
trading computation for communication. We introduce an
illustrative proof-of-concept design, identify
practical limitations, and provide design guidelines.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Bai:2017:VRE,
author = "Yuxin Bai and Victor W. Lee and Engin Ipek",
title = "Voltage Regulator Efficiency Aware Power Management",
journal = j-OPER-SYS-REV,
volume = "51",
number = "2",
pages = "825--838",
month = jun,
year = "2017",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3093315.3037717",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jul 24 18:36:23 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Conventional off-chip voltage regulators are typically
bulky and slow, and are inefficient at exploiting
system and workload variability using Dynamic Voltage
and Frequency Scaling (DVFS). On-die integration of
voltage regulators has the potential to increase the
energy efficiency of computer systems by enabling power
control at a fine granularity in both space and time.
The energy conversion efficiency of on-chip regulators,
however, is typically much lower than off-chip
regulators, which results in significant energy losses.
Fine-grained power control and high voltage regulator
efficiency are difficult to achieve simultaneously,
with either emerging on-chip or conventional off-chip
regulators. A voltage conversion framework that relies
on a hierarchy of off-chip switching regulators and
on-chip linear regulators is proposed to enable
fine-grained power control with a regulator efficiency
greater than 90\%. A DVFS control policy that is based
on a reinforcement learning (RL) approach is developed
to exploit the proposed framework. Per-core RL agents
learn and improve their control policies independently,
while retaining the ability to coordinate their actions
to accomplish system level power management objectives.
When evaluated on a mix of 14 parallel and 13
multiprogrammed workloads, the proposed voltage
conversion framework achieves 18\% greater energy
efficiency than a conventional framework that uses
on-chip switching regulators. Moreover, when the RL
based DVFS control policy is used to control the
proposed voltage conversion framework, the system
achieves a 21\% higher energy efficiency over a
baseline oracle policy with coarse-grained power
control capability.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Alam:2018:DIY,
author = "Hanna Alam and Tianhao Zhang and Mattan Erez and Yoav
Etsion",
title = "Do-It-Yourself Virtual Memory Translation",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "1--12",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273984",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "In this paper, we introduce the Do-It-Yourself virtual
memory translation (DVMT) architecture as a flexible
complement for current hardware-fixed translation
flows. DVMT decouples the virtual-to-physical mapping
process from the access permissions, giving
applications freedom in choosing mapping schemes, while
maintaining security within the operating system.
Furthermore, DVMT is designed to support virtualized
environments, as a means to collapse the costly,
hardware-assisted two-dimensional translations. We
describe the architecture in detail and demonstrate its
effectiveness by evaluating several different DVMT
schemes on a range of virtualized applications with a
model based on measurements from a commercial system.
We show that different DVMT configurations preserve the
native performance, while achieving speedups of 1.2x to
2.0x in virtualized environments.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Kannan:2018:HDH,
author = "Sudarsun Kannan and Ada Gavrilovska and Vishal Gupta
and Karsten Schwan",
title = "{HeteroOS}: {OS} Design for Heterogeneous Memory
Management in Datacenters",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "13--26",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273985",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Heterogeneous memory management combined with server
virtualization in datacenters is expected to increase
the software and OS management complexity.
State-of-the-art solutions rely exclusively on the
hypervisor (VMM) for expensive page hotness tracking
and migrations, limiting the benefits from
heterogeneity. To address this, we design HeteroOS, a
novel application-transparent OS-level solution for
managing memory heterogeneity in virtualized systems.
The HeteroOS design first makes the guest-OSes
heterogeneity aware, and then extracts rich OS-level
information about applications' memory usage to place
data in the 'right' memory, avoiding page migrations.
When such proactive placements are not possible,
HeteroOS combines the power of the guest-OSes'
information about applications with the VMM's hardware
control to track for hotness and migrate only
performance-critical pages. Finally, HeteroOS also
designs an efficient heterogeneous memory sharing
across multiple guest-VMs. Evaluation of HeteroOS with
memory, storage, and network-intensive datacenter
applications show up to 2x performance improvement
compared to the state-of-the-art VMMexclusive
approach.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ausavarungnirun:2018:MEA,
author = "Rachata Ausavarungnirun and Joshua Landgraf and Vance
Miller and Saugata Ghose and Jayneel Gandhi and
Christopher J. Rossbach and Onur Mutlu",
title = "{Mosaic}: Enabling Application-Transparent Support for
Multiple Page Sizes in Throughput Processors",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "27--44",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273986",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Contemporary discrete GPUs support rich memory
management features such as virtual memory and demand
paging. These features simplify GPU programming by
providing a virtual address space abstraction similar
to CPUs and eliminating manual memory management, but
they introduce high performance overheads during (1)
address translation and (2) page faults. A GPU relies
on high degrees of thread-level parallelism (TLP) to
hide memory latency. Address translation can undermine
TLP, as a single miss in the translation lookaside
buffer (TLB) invokes an expensive serialized page table
walk that often stalls multiple threads. Demand paging
can also undermine TLP, as multiple threads often stall
while they wait for an expensive data transfer over the
system I/O (e.g., PCIe) bus when the GPU demands a
page. In modern GPUs, we face a trade-off on how the
page size used for memory management affects address
translation and demand paging. The address translation
overhead is lower when we employ a larger page size
(e.g., 2MB large pages, compared with conventional 4KB
base pages), which increases TLB coverage and thus
reduces TLB misses. Conversely, the demand paging
overhead is lower when we employ a smaller page size,
which decreases the system I/O bus transfer latency.
Support for multiple page sizes can help relax the page
size trade-off so that address translation and demand
paging optimizations work together synergistically.
However, existing page coalescing (i.e., merging base
pages into a large page) and splintering (i.e.,
splitting a large page into base pages) policies
require costly base page migrations that undermine the
benefits multiple page sizes provide. In this paper, we
observe that GPGPU applications present an opportunity
to support multiple page sizes without costly data
migration, as the applications perform most of their
memory allocation en masse (i.e., they allocate a large
number of base pages at once).We show that this en
masse allocation allows us to create intelligent memory
allocation policies which ensure that base pages that
are contiguous in virtual memory are allocated to
contiguous physical memory pages. As a result,
coalescing and splintering operations no longer need to
migrate base pages.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Dall:2018:AVP,
author = "Christoffer Dall and Shih-Wei Li and Jin Tack Lim and
Jason Nieh",
title = "{ARM} Virtualization: Performance and Architectural
Implications",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "45--56",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273987",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "ARM servers are becoming increasingly common, making
server technologies such as virtualization for ARM of
growing importance. We present the first study of ARM
virtualization performance on server hardware,
including multi-core measurements of two popular ARM
and x86 hypervisors, KVM and Xen. We show how ARM
hardware support for virtualization can enable much
faster transitions between VMs and the hypervisor, a
key hypervisor operation. However, current hypervisor
designs, including both Type 1 hypervisors such as Xen
and Type 2 hypervisors such as KVM, are not able to
leverage this performance benefit for real application
workloads on ARMv8.0. We discuss the reasons why and
show that other factors related to hypervisor software
design and implementation have a larger role in overall
performance. Based on our measurements, we discuss
software changes and new hardware features, the
Virtualization Host Extensions (VHE), added in ARMv8.1
that bridge the gap and bring ARM's faster
VM-to-hypervisor transition mechanism to modern Type 2
hypervisors running real applications.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Yan:2018:HTC,
author = "Zi Yan and J{\'a}n Vesel{\'y} and Guilherme Cox and
Abhishek Bhattacharjee",
title = "Hardware Translation Coherence for Virtualized
Systems",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "57--70",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273988",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "To improve system performance, operating systems
(OSes) often undertake activities that require
modification of virtual-to-physical address
translations. For example, the OS may migrate data
between physical pages to manage heterogeneous memory
devices. We refer to such activities as page
remappings. Unfortunately, page remappings are
expensive. We show that a big part of this cost arises
from address translation coherence, particularly on
systems employing virtualization. In response, we
propose hardware translation invalidation and coherence
or HATRIC, a readily implementable hardware mechanism
to piggyback translation coherence atop existing cache
coherence protocols. We perform detailed studies using
KVM-based virtualization, showing that HATRIC achieves
up to 30\% performance and 10\% energy benefits, for
per-CPU area overheads of 0.2\%. We also quantify
HATRIC's benefits on systems running Xen and find up to
33\% performance improvements.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Tseng:2018:MEP,
author = "Hung-Wei Tseng and Qianchen Zhao and Yuxiao Zhou and
Mark Gahagan and Steven Swanson",
title = "Morpheus: Exploring the Potential of Near-Data
Processing for Creating Application Objects in
Heterogeneous Computing",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "71--83",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273989",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "In modern computing systems, object deserialization
can become a surprisingly important bottleneck-in our
test, a set of general purpose, highly parallelized
applications spends 64\% of total execution time
deserializing data into objects. This paper presents
the Morpheus model, which allows applications to move
such computations to a storage device and bypass the
overhead on the host system. We use this model to
deserialize data into application objects inside
storage devices, rather than in the host CPU. Using the
Morpheus model for object deserialization avoids
unnecessary system overheads, frees up scarce CPU and
main memory resources for compute-intensive workloads,
saves I/O bandwidth, and reduces power consumption. In
heterogeneous, coprocessor- equipped systems, Morpheus
allows application objects to be sent directly from a
storage device to a co-processor (e.g., a GPU) by
peer-to-peer transfer, further improving application
performance as well as reducing the CPU and main memory
utilizations. This paper implements Morpheus-SSD, an
SSD supporting the Morpheus model. Morpheus-SSD
improves the performance of object deserialization by
1.66x, reduces power consumption by 7\%, uses 42\% less
energy, and speeds up the total execution time by
1.32x. By using NVMe-P2P that realizes peer-to-peer
communication between Morpheus-SSD and a GPU,
Morpheus-SSD can speed up the total execution time by
1.39x in a heterogeneous computing platform.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Shahar:2018:ACS,
author = "Sagi Shahar and Shai Bergman and Mark Silberstein",
title = "{ActivePointers}: a Case for Software Address
Translation on {GPUs}",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "84--95",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273990",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Modern discrete GPUs have been the processors of
choice for accelerating compute-intensive applications,
but using them in large-scale data processing is
extremely challenging. Unfortunately, they do not
provide important I/O abstractions long established in
the CPU context, such as memory mapped files, which
shield programmers from the complexity of buffer and
I/O device management. However, implementing these
abstractions on GPUs poses a problem: the limited GPU
virtual memory system provides no address space
management and page fault handling mechanisms to GPU
developers, and does not allow modifications to memory
mappings for running GPU programs. We implement
ActivePointers, a software address translation layer
and paging system that introduces native support for
page faults and virtual address space management to GPU
programs, and enables the implementation of fully
functional memory mapped files on commodity GPUs. Files
mapped into GPU memory are accessed using active
pointers, which behave like regular pointers but access
the GPU page cache under the hood, and trigger page
faults which are handled on the GPU. We design and
evaluate a number of novel mechanisms, including a
translation cache in hardware registers and translation
aggregation for deadlock-free page fault handling of
threads in a single warp. We extensively evaluate
ActivePointers on commodity NVIDIA GPUs using
microbenchmarks, and also implement a complex image
processing application that constructs a photo collage
from a subset of 10 million images stored in a 40GB
file. The GPU implementation maps the entire file into
GPU memory and accesses it via active pointers. The use
of active pointers adds only up to 1\% to the
application's runtime, while enabling speedups of up to
3.9x over a combined CPU+GPU implementation and 2.6x
over a 12-core CPU-only implementation which uses AVX
vector instructions.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Xie:2018:EDS,
author = "Shaolin Xie and Scott Davidson and Ikuo Magaki and
Moein Khazraee and Luis Vega and Lu Zhang and Michael
B. Taylor",
title = "Extreme Datacenter Specialization for Planet-Scale
Computing: {ASIC} Clouds",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "96--108",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273991",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Planet-scale applications are driving the exponential
growth of the cloud, and datacenter specialization is
the key enabler of this trend, providing order of
magnitudes improvements in cost-effectiveness and
energy-efficiency. While exascale computing remains a
goal for supercomputing, specialized datacenters have
emerged and have demonstrated beyond-exascale
performance and efficiency in specific domains. This
paper generalizes the applications, design methodology,
and deployment challenges of the most extreme form of
specialized datacenter: ASIC Clouds. It analyzes two
game-changing, real-world ASIC Clouds-Bitcoin
Cryptocurrency Clouds and Tensor Processing
Clouds-discuss their incentives, the empowering
technologies and how they benefit from the specialized
ASICs. Their business models, architectures and
deployment methods are useful for envisioning future
potential ASIC Clouds and forecasting how they will
transform computing, the economy and society.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Drumond:2018:AAC,
author = "Mario Drumond and Alexandros Daglis and Nooshin
Mirzadeh and Dmitrii Ustiugov and Javier Picorel and
Babak Falsafi and Boris Grot and Dionisios
Pnevmatikatos",
title = "Algorithm\slash Architecture Co-Design for Near-Memory
Processing",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "109--122",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273992",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With mainstream technologies to couple logic tightly
with memory on the horizon, near-memory processing has
re-emerged as a promising approach to improving
performance and energy for data-centric computing.
DRAM, however, is primarily designed for density and
low cost, with a rigid internal organization that
favors coarse-grain streaming rather than byte-level
random access. This paper makes the case that treating
DRAM as a block-oriented streaming device yields
significant efficiency and performance benefits, which
motivate for algorithm/architecture co-design to favor
streaming access patterns, even at the price of a
higher order algorithmic complexity. We present the
Mondrian Data Engine that drastically improves the
runtime and energy efficiency of basic in-memory
analytic operators, despite doing more work as compared
to traditional CPU-optimized algorithms, which heavily
rely on random accesses and deep cache hierarchies",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pettit:2018:BPH,
author = "Justin Pettit and Ben Pfaff and Joe Stringer and
Cheng-Chun Tu and Brenden Blanco and Alex Tessmer",
title = "Bringing Platform Harmony to {VMware NSX}",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "123--128",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273994",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "VMware NSX virtualizes network functionality in a
manner analogous to how hypervisors virtualize compute
resources. To do this, NSX must faithfully recreate
virtual versions of network components, such as
switches, routers, and firewalls. As this functionality
becomes commoditized, NSX must move ``up the stack'' to
provide more advanced features, such as load-balancers,
IDS/IPS (intrusion detection and prevention systems),
and DPI (deep packet inspection) for classification.
NSX is designed to work in all types of
deployments-even those without any other VMware
software. It integrates with ESXi, Linux KVM, and
Hyper-V hypervisors; it is even being made to work on
systems without a hypervisor, such as containers and
third-party clouds. Each of these platforms has its own
native forwarding plane. For the best user experience,
all of the forwarding planes should provide the same
behavior, but the disparate implementations make this
difficult in practice. As network functions become more
complex and as NSX supports more forwarding planes,
both duplication of effort and undesirable diversity of
behavior increases. We propose a new approach to
building advanced network functions in NSX. Under this
approach, identical code runs on all of NSX's supported
platforms. Applications will run at or near native
performance, but with better security and identical
cross-platform behavior. We demonstrate this by writing
a single application to provide DPI functionality that
runs in the fast paths of each of NSX's primary
platforms: ESXi, Linux, and Edge gateway appliance. We
evaluate the performance and correctness of our
implementation on the three platforms.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Ott:2018:SDI,
author = "David E. Ott",
title = "Software Defined Infrastructure: Rethinking
Cybersecurity with a More Capable Toolset",
journal = j-OPER-SYS-REV,
volume = "52",
number = "1",
pages = "129--133",
month = jul,
year = "2018",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3273982.3273995",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "In Software Defined Infrastructure (SDI),
virtualization techniques are used to decouple
applications and higher-level services from their
underlying physical compute, storage, and network
resources. The approach offers a set of powerful new
capabilities (isolation, encapsulation, portability,
interposition), including the formation of a
software-based, infrastructure-wide control plane for
orchestrated management. In this position paper, we
identify opportunities for revisiting ongoing
cybersecurity challenges using SDI as a powerful new
toolset. Benefits of this approach can be broadly
utilized in public, private, and hybrid clouds, data
centers, enterprise computing, IoT deployments, and
more. The discussion motivates the research challenge
underlying VMware's partnership with the National
Science Foundation to fund novel and foundational
research in this area. Known as the NSF/VMware
Partnership on Software Defined Infrastructure as a
Foundation for Clean-Slate Computing Security
(SDI-CSCS), the jointly funded university research
program is set to begin in the fall of 2017.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Krishnan:2019:AIR,
author = "Sanjay Krishnan and Aaron J. Elmore and Michael
Franklin and John Paparrizos and Zechao Shang and Adam
Dziedzic and Rui Liu",
title = "Artificial Intelligence in Resource-Constrained and
Shared Environments",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "1--6",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352022",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The computational demands of modern AI techniques are
immense, and as the number of practical applications
grows, there will be an increasing burden on shared
computing infrastructure. We envision a forthcoming era
of ``AI Systems'' research where reducing resource
consumption, reasoning about transient resource
availability, trading off resource consumption for
accuracy, and managing contention on specialized
hardware will become the community's main research
focus. This paper overviews the history of AI systems
research, a vision for the future, and the open
challenges ahead.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Birman:2019:CHI,
author = "Ken Birman and Bharath Hariharan and Christopher {De
Sa}",
title = "Cloud-Hosted Intelligence for Real-time {IoT}
Applications",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "7--13",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352023",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Deploying machine learning into IoT cloud settings
will require an evolution of the cloud infrastructure.
In this white paper, we justify this assertion and
identify new capabilities needed for real-time
intelligent systems. We also outline our initial
efforts to create a new edge architecture more suitable
for ML. Although the work is still underway, several
components exist, and we review them. We then point to
open technical problems that will need to be solved as
we progress further in this direction.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Coleman:2019:ADT,
author = "Cody Coleman and Daniel Kang and Deepak Narayanan and
Luigi Nardi and Tian Zhao and Jian Zhang and Peter
Bailis and Kunle Olukotun and Chris R{\'e} and Matei
Zaharia",
title = "Analysis of {DAWNBench}, a Time-to-Accuracy Machine
Learning Performance Benchmark",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "14--25",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352024",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Researchers have proposed hardware, software, and
algorithmic optimizations to improve the computational
performance of deep learning. While some of these
optimizations perform the same operations faster (e.g.,
increasing GPU clock speed), many others modify the
semantics of the training procedure (e.g., reduced
precision), and can impact the final model's accuracy
on unseen data. Due to a lack of standard evaluation
criteria that considers these trade-offs, it is
difficult to directly compare these optimizations. To
address this problem, we recently introduced DAWNBENCH,
a benchmark competition focused on end-to-end training
time to achieve near-state-of-the-art accuracy on an
unseen dataset-a combined metric called
time-to-accuracy (TTA). In this work, we analyze the
entries from DAWNBENCH, which received optimized
submissions from multiple industrial groups, to
investigate the behavior of TTA as a metric as well as
trends in the best-performing entries. We show that TTA
has a low coefficient of variation and that models
optimized for TTA generalize nearly as well as those
trained using standard methods. Additionally, even
though DAWNBENCH entries were able to train ImageNet
models in under 3 minutes, we find they still
underutilize hardware capabilities such as Tensor
Cores. Furthermore, we find that distributed entries
can spend more than half of their time on
communication. We show similar findings with entries to
the MLPERF v0.5 benchmark.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Jeong:2019:SSG,
author = "Eunji Jeong and Sungwoo Cho and Gyeong-In Yu and Joo
Seong Jeong and Dong-Jin Shin and Taebum Kim and
Byung-Gon Chun",
title = "Speculative Symbolic Graph Execution of Imperative
Deep Learning Programs",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "26--33",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352025",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/python.bib",
abstract = "The rapid evolution of deep neural networks is
demanding deep learning (DL) frameworks not only to
satisfy the requirement of quickly executing large
computations, but also to support straightforward
programming models for quickly implementing and
experimenting with complex network structures. However,
existing frameworks fail to excel in both departments
simultaneously, leading to diverged efforts for
optimizing performance and improving usability. This
paper presents JANUS, a system that combines the
advantages from both sides by transparently converting
an imperative DL program written in Python, a de-facto
scripting language for DL, into an efficiently
executable symbolic dataflow graph. JANUS can convert
various dynamic features of Python, including dynamic
control flow, dynamic types, and impure functions, into
elements of a symbolic dataflow graph. Our experiments
show that JANUS can achieve fast DL training by
exploiting the techniques imposed by symbolic
graph-based DL frameworks, while maintaining the simple
and flexible programmability of imperative DL
frameworks at the same time.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Gan:2019:LDL,
author = "Yu Gan and Yanqi Zhang and Kelvin Hu and Dailun Cheng
and Yuan He and Meghna Pancholi and Christina
Delimitrou",
title = "Leveraging Deep Learning to Improve Performance
Predictability in Cloud Microservices with {Seer}",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "34--39",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352026",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Performance unpredictability is a major roadblock
towards cloud adoption, and has performance, cost, and
revenue ramifications. Predictable performance is even
more critical as cloud services transition from
monolithic designs to microservices. Detecting UOS
violations after they occur in systems with
microservices results in long recovery times, as
hotspots propagate and amplify across dependent
services.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Zhang:2019:LOS,
author = "Yiying Zhang and Yutong Huang",
title = "``{Learned}'': Operating Systems",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "40--45",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352027",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "With operating systems being at the core of computer
systems, decades of research and engineering efforts
have been put into the development of OSes. To keep
pace with the speed of modern hardware and application
evolvement, we argue that a different approach should
be taken in future OS development. Instead of relying
solely on human wisdom, we should also leverage AI and
machine learning techniques to automatically ``learn''
how to build and tune an OS. This paper explores the
opportunities and challenges of the ``learned'' OS
approach and makes recommendation for future
researchers and practitioners on building such an OS.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Vengerov:2019:MLA,
author = "David Vengerov and Sesh Jalagam",
title = "A Machine Learning Approach to Recommending Files in a
Collaborative Work Environment",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "46--51",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352028",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Recommendation of items to users is a problem faced by
many companies in a wide spectrum of industries. This
problem was traditionally approached in a one-shot
manner, such as recommending movies to users based on
all the movie ratings observed so far. The evolution of
user activity over time was relatively unexplored. This
paper presents a Machine Learning approach developed at
Box Inc. for making repeated recommendations of files
to users in a collaborative work environment. Our
results on historical data show that this approach
noticeably outperforms the approach currently
implemented at Box and also the traditional Matrix
Factorization approach.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Mai:2019:THP,
author = "Luo Mai and Alexandros Koliousis and Guo Li and
Andrei-Octavian Brabete and Peter Pietzuch",
title = "Taming Hyper-parameters in Deep Learning Systems",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "52--58",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352029",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Deep learning (DL) systems expose many tuning
parameters (``hyper-parameters'') that affect the
performance and accuracy of trained models.
Increasingly users struggle to configure
hyper-parameters, and a substantial portion of time is
spent tuning them empirically. We argue that future DL
systems should be designed to help manage
hyper-parameters. We describe how a distributed DL
system can (i) remove the impact of hyper-parameters on
both performance and accuracy, thus making it easier to
decide on a good setting, and (ii) support more
powerful dynamic policies for adapting
hyper-parameters, which take monitored training metrics
into account. We report results from prototype
implementations that show the practicality of DL system
designs that are hyper-parameter-friendly.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Pei:2019:BER,
author = "Kexin Pei and Shiqi Wang and Yuchi Tian and Justin
Whitehouse and Carl Vondrick and Yinzhi Cao and
Baishakhi Ray and Suman Jana and Junfeng Yang",
title = "Bringing Engineering Rigor to Deep Learning",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "59--67",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352030",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Deep learning (DL) systems are increasingly deployed
in safety- and security-critical domains including
autonomous driving, robotics, and malware detection,
where the correctness and predictability of a system on
corner-case inputs are of great importance.
Unfortunately, the common practice to validating a deep
neural network (DNN) --- measuring overall accuracy on
a randomly selected test set --- is not designed to
surface corner-case errors. As recent work shows, even
DNNs with state-of-the-art accuracy are easily fooled
by human-imperceptible, adversarial perturbations to
the inputs. Questions such as how to test corner-case
behaviors more thoroughly and whether all adversarial
samples have been found remain unanswered. In the last
few years, we have been working on bringing more
engineering rigor into deep learning. Towards this
goal, we have built five systems to test DNNs more
thoroughly and verify the absence of adversarial
samples for given datasets. These systems check a broad
spectrum of properties (e.g., rotating an image should
never change its classification) and find thousands of
error-inducing samples for popular DNNs in critical
domains (e.g., ImageNet, autonomous driving, and
malware detection). Our DNN verifiers are also orders
of magnitude (e.g., 5,000$ \times $) faster than
similar tools. This article overviews our systems and
discusses three open research challenges to hopefully
inspire more future research towards testing and
verifying DNNs.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Liang:2019:CLS,
author = "Chieh-Jan Mike Liang and Hui Xue and Mao Yang and
Lidong Zhou",
title = "The Case for Learning-and-System Co-design",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "68--74",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352031",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "While decision-makings in systems are commonly solved
with explicit rules and heuristics, machine learning
(ML) and deep learning (DL) have been driving a
paradigm shift in modern system design. Based on our
decade of experience in operationalizing a large
production cloud system, Web Search, learning fills the
gap in comprehending and taming the system design and
operation complexity. However, rather than just
improving specific ML/DL algorithms or system features,
we posit that the key to unlocking the full potential
of learning-augmented systems is a principled
methodology promoting learning-and-system co-design. On
this basis, we present the AutoSys, a common framework
for the development of learning-augmented systems.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Lecuyer:2019:PAQ,
author = "Mathias L`ecuyer and Riley Spahn and Kiran Vodrahalli
and Roxana Geambasu and Daniel Hsu",
title = "Privacy Accounting and Quality Control in the {Sage}
Differentially Private {ML} Platform",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "75--84",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352032",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "We present Sage, the first ML platform that enforces a
global differential privacy (DP) guarantee across all
models produced from a sensitive data stream. Sage
extends the Tensorflow-Extended ML platform with novel
mechanisms and DP theory to address operational
challenges that arise from incorporating DP into ML
training processes. First, to avoid the typical problem
with DP systems of ``running out of privacy budget''
after a pre-established number of training processes,
we develop block composition. It is a new DP
composition theory that leverages the time-bounded
structure of training processes to keep training models
endlessly on a sensitive data stream while enforcing
event-level DP on the stream. Second, to control the
quality of ML models produced by Sage, we develop a
novel iterative training process that trains a model on
increasing amounts of data from a stream until, with
high probability, the model meets developer-configured
quality criteria.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Du:2019:WPC,
author = "Yifan Du and Val{\'e}rie Issarny and Fran{\c{c}}oise
Sailhan",
title = "When the Power of the Crowd Meets the Intelligence of
the Middleware: The Mobile Phone Sensing Case",
journal = j-OPER-SYS-REV,
volume = "53",
number = "1",
pages = "85--90",
month = jul,
year = "2019",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3352020.3352033",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Oct 16 11:56:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "The data gluttony of AI is well known: Data fuels the
artificial intelligence. Technologies that help to
gather the needed data are then essential, among which
the IoT. However, the deployment of IoT solutions
raises significant challenges, especially regarding the
resource and financial costs at stake. It is our view
that mobile crowdsensing, aka phone sensing, has a
major role to play because it potentially contributes
massive data at a relatively low cost. Still,
crowdsensing is useless, and even harmful, if the
contributed data are not properly analyzed. This paper
surveys our work on the development of systems facing
this challenge, which also illustrates the virtuous
circles of AI. We specifically focus on how intelligent
crowdsensing middleware leverages on-device machine
learning to enhance the reported physical observations.
Keywords: Crowdsensing, Middleware, Online learning.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
}
@Article{Heiser:2020:TPT,
author = "Gernot Heiser and Toby Murray and Gerwin Klein",
title = "Towards Provable Timing-Channel Prevention",
journal = j-OPER-SYS-REV,
volume = "54",
number = "1",
pages = "1--7",
month = aug,
year = "2020",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3421473.3421475",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 1 12:58:05 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3421473.3421475",
abstract = "We describe our ongoing research that aims to
eliminate microarchitectural timing channels through
time protection, which eliminates the root cause of
these channels, competition for capacity-limited
hardware resources. A proof-of-concept implementation
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Vasudevan:2020:UPP,
author = "Amit Vasudevan and Petros Maniatis and Ruben Martins",
title = "{{\"u}berSpark}: Practical, Provable, End-to-End
Guarantees on Commodity Heterogeneous Interconnected
Computing Platforms",
journal = j-OPER-SYS-REV,
volume = "54",
number = "1",
pages = "8--22",
month = aug,
year = "2020",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3421473.3421476",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 1 12:58:05 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3421473.3421476",
abstract = "Today's computing ecosystem, comprising commodity
heterogeneous interconnected computing (CHIC)
platforms, is increasingly being employed for critical
applications, consequently demanding fairly strong
end-to-end assurances. However, the generality and
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Erbsen:2020:SHL,
author = "Andres Erbsen and Jade Philipoom and Jason Gross and
Robert Sloan and Adam Chlipala",
title = "Simple High-Level Code For Cryptographic Arithmetic:
With Proofs, Without Compromises",
journal = j-OPER-SYS-REV,
volume = "54",
number = "1",
pages = "23--30",
month = aug,
year = "2020",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3421473.3421477",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 1 12:58:05 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3421473.3421477",
abstract = "We introduce an unusual approach for implementing
cryptographic arithmetic in short high-level code with
machine-checked proofs of functional correctness. We
further demonstrate that simple partial evaluation is
sufficient to transform such initial code into highly
competitive C code, breaking the decades-old pattern
that the only fast implementations are those whose
instruction-level steps were written out by
hand.\par
These techniques were used to build an elliptic-curve
library that achieves competitive performance for a
wide range of prime fields and multiple CPU
architectures, showing that implementation and proof
effort scales with the number and complexity of
conceptually different algorithms, not their use cases.
As one outcome, we present the first verified
high-performance implementation of P-256, the most
widely used elliptic curve. Implementations from our
library were included in BoringSSL to replace existing
specialized code, for inclusion in several large
deployments for Chrome, Android, and
CloudFlare.\par
This is an abridged version of the full paper
originally presented in IEEE S&P 2019 [10]. We have
omitted most proof-engineering details in favor of a
focus on the system's functional capabilities.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Nelson:2020:NSS,
author = "Luke Nelson and James Bornholt and Arvind
Krishnamurthy and Emina Torlak and Xi Wang",
title = "Noninterference specifications for secure systems",
journal = j-OPER-SYS-REV,
volume = "54",
number = "1",
pages = "31--39",
month = aug,
year = "2020",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3421473.3421478",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 1 12:58:05 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3421473.3421478",
abstract = "This paper presents an analysis of noninterference
specifications used in a range of formally verified
systems. The main findings are that these systems use
distinct specifications and that they often employ
small variations, both complicating their \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Setty:2020:VSM,
author = "Srinath Setty and Sebastian Angel and Jonathan Lee",
title = "Verifiable state machines: Proofs that untrusted
services operate correctly",
journal = j-OPER-SYS-REV,
volume = "54",
number = "1",
pages = "40--46",
month = aug,
year = "2020",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3421473.3421479",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 1 12:58:05 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3421473.3421479",
abstract = "This article describes recent progress in realizing
verifiable state machines, a primitive that enables
untrusted services to provide cryptographic proofs that
they operate correctly. Applications of this primitive
range from proving the correct operation of distributed
and concurrent cloud services to reducing blockchain
transaction costs by leveraging inexpensive off-chain
computation without trust.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{McKenney:2020:RUL,
author = "Paul E. McKenney and Joel Fernandes and Silas
Boyd-Wickizer and Jonathan Walpole",
title = "{RCU} Usage In the {Linux} Kernel: Eighteen Years
Later",
journal = j-OPER-SYS-REV,
volume = "54",
number = "1",
pages = "47--63",
month = aug,
year = "2020",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3421473.3421481",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 1 12:58:05 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "https://dl.acm.org/doi/10.1145/3421473.3421481",
abstract = "Read-copy update (RCU) is a scalable high-performance
synchronization mechanism implemented in the Linux
kernel. RCU's novel properties include support for
concurrent forward progress for readers and writers as
well as highly optimized inter-CPU synchronization. RCU
was introduced into the Linux kernel eighteen years ago
and most subsystems now use RCU. This paper discusses
the requirements that drove the development of RCU, the
design and API of the Linux RCU implementation, and how
kernel developers apply RCU.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Ferles:2020:SRA,
author = "Kostas Ferles and Jacob {Van Geffen} and Isil Dillig
and Yannis Smaragdakis",
title = "Symbolic Reasoning for Automatic Signal Placement",
journal = j-OPER-SYS-REV,
volume = "54",
number = "1",
pages = "64--76",
month = aug,
year = "2020",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3421473.3421482",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Tue Sep 1 12:58:05 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3421473.3421482",
abstract = "Explicit signaling between threads is a perennial
cause of bugs in concurrent programs. While there are
several runtime techniques to automatically notify
threads upon the availability of some shared resource,
such techniques are not widely-adopted due \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Jamshidi:2021:DDP,
author = "Kasra Jamshidi and Keval Vora",
title = "A Deeper Dive into Pattern-Aware Subgraph Exploration
with {PEREGRINE}",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "1--10",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469381",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469381",
abstract = "Graph mining workloads aim to extract structural
properties of a graph by exploring its subgraph
structures. PEREGRINE is a general-purpose graph mining
system that provides a generic runtime to efficiently
explore subgraph structures of interest and \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Jiang:2021:VES,
author = "Xiaolin Jiang and Chengshuo Xu and Rajiv Gupta",
title = "{VRGQ}: Evaluating a Stream of Iterative Graph Queries
via Value Reuse",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "11--20",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469382",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469382",
abstract = "While much of the research on graph analytics over
large power-law graphs has focused on developing
algorithms for evaluating a single global graph query,
in practice we may be faced with a stream of queries.
We observe that, due to their global nature, \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Mawhirter:2021:GHP,
author = "Daniel Mawhirter and Sam Reinehr and Connor Holmes and
Tongping Liu and Bo Wu",
title = "{GraphZero}: a High-Performance Subgraph Matching
System",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "21--37",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469383",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469383",
abstract = "Subgraph matching is a fundamental task in many
applications which identifies all the embeddings of a
query pattern in an input graph. Compilation-based
subgraph matching systems generate specialized
implementations for the provided patterns and often
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Wang:2021:GFG,
author = "Yiqiu Wang and Shangdi Yu and Laxman Dhulipala and Yan
Gu and Julian Shun",
title = "{GeoGraph}: a Framework for Graph Processing on
Geometric Data",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "38--46",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469384",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469384",
abstract = "In many applications of graph processing, the input
data is often generated from an underlying geometric
point data set. However, existing high-performance
graph processing frameworks assume that the input data
is given as a graph. Therefore, to use \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Hoang:2021:CCS,
author = "Loc Hoang and Roshan Dathathri and Gurbinder Gill and
Keshav Pingali",
title = "{CuSP}: a Customizable Streaming Edge Partitioner for
Distributed Graph Analytics",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "47--60",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469385",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469385",
abstract = "Graph analytics systems must analyze graphs with
billions of vertices and edges which require several
terabytes of storage. Distributed-memory clusters are
often used for analyzing such large graphs since the
main memory of a single machine is usually \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Bowman:2021:TNG,
author = "Benjamin Bowman and H. Howie Huang",
title = "Towards Next-Generation Cybersecurity with Graph
{AI}",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "61--67",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469386",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469386",
abstract = "Cybersecurity professionals are inundated with large
amounts of data, and require intelligent algorithms
capable of distinguishing vulnerable from patched,
normal from anomalous, and malicious from benign.
Unfortunately, not all machine learning (ML) \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Serafini:2021:SGN,
author = "Marco Serafini",
title = "Scalable Graph Neural Network Training: The Case for
Sampling",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "68--76",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469387",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469387",
abstract = "Graph Neural Networks (GNNs) are a new and
increasingly popular family of deep neural network
architectures to perform learning on graphs. Training
them efficiently is challenging due to the irregular
nature of graph data. The problem becomes even more
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Chen:2021:WDF,
author = "Rong Chen and Haibo Chen",
title = "{Wukong}: a Distributed Framework for Fast and
Concurrent Graph Querying",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "77--83",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469388",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469388",
abstract = "Querying graph data is becoming increasingly prevalent
and important across many application domains, like
social networking, urban monitoring, electronic
payment, and semantic webs. In the last few years, we
have ben working on improving the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Zhu:2021:TPF,
author = "Xiaowei Zhu and Zhisong Fu and Zhenxuan Pan and Jin
Jiang and Chuntao Hong and Yongchao Liu and Yang Fang
and Wenguang Chen and Changhua He",
title = "Taking the Pulse of Financial Activities with Online
Graph Processing",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "84--87",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469389",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469389",
abstract = "Graph processing has been widely adopted in various
financial scenarios at Ant Group to detect malicious
and prohibited user behaviors. The low latency
requirement under big data volume and high throughput
raises rigorous challenges for efficient online
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Naas:2021:EUK,
author = "Mohammed Islam Naas and Fran{\c{c}}ois Trahay and
Alexis Colin and Pierre Olivier and St{\'e}phane Rubini
and Frank Singhoff and Jalil Boukhobza",
title = "{EZIOTracer}: Unifying Kernel and User Space {I/O}
Tracing for Data-Intensive Applications",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "88--98",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469391",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469391",
abstract = "Tracing is a popular method for evaluating,
investigating, and modeling the performance of today's
storage systems. Tracing has become crucial with the
increase in complexity of modern storage
applications/systems, that are manipulating an ever-.
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Thomas:2021:PFL,
author = "Luis Thomas and Sebastien Gougeaud and St{\'e}phane
Rubini and Philippe Deniel and Jalil Boukhobza",
title = "Predicting file lifetimes for data placement in
multi-tiered storage systems for {HPC}",
journal = j-OPER-SYS-REV,
volume = "55",
number = "1",
pages = "99--107",
month = jun,
year = "2021",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3469379.3469392",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Mon Jun 7 07:48:41 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3469379.3469392",
abstract = "The emergence of Exascale machines in HPC will have
the foreseen consequence of putting more pressure on
the storage systems in place, not only in terms of
capacity but also bandwidth and latency. With limited
budget we cannot imagine using only storage \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Li:2022:IFT,
author = "Yichen Li and Xu Zhang and Shilin He and Zhuangbin
Chen and Yu Kang and Jinyang Liu and Liqun Li and
Yingnong Dang and Feng Gao and Zhangwei Xu and Saravan
Rajmohan and Qingwei Lin and Dongmei Zhang and Michael
R. Lyu",
title = "An Intelligent Framework for Timely, Accurate, and
Comprehensive Cloud Incident Detection",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "1--7",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544499",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544499",
abstract = "Cloud incidents (service interruptions or performance
degradation) dramatically degrade the reliability of
large-scale cloud systems, causing customer
dissatisfaction and revenue loss. With years of
efforts, cloud providers are able to solve most
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Shkuro:2022:PPS,
author = "Yuri Shkuro and Benjamin Renard and Atul Singh",
title = "Positional Paper: Schema-First Application Telemetry",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "8--17",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544500",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544500",
abstract = "Application telemetry refers to measurements taken
from software systems to assess their performance,
availability, correctness, efficiency, and other
aspects useful to operators, as well as to troubleshoot
them when they behave abnormally. Many modern
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Jiang:2022:MMF,
author = "Yuting Jiang and Yifan Xiong and Lei Qu and Cheng Luo
Luo and Chen Tian and Peng Cheng and Yongqiang Xiong",
title = "{Moneo}: Monitoring Fine-grained Metrics
Nonintrusively in {AI} Infrastructure",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "18--25",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544501",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544501",
abstract = "Cloud-based AI infrastructure is becoming increasingly
important, especially on large-scale distributed
training. To improve its efficiency and serviceability,
real-time monitoring of the infrastructure and workload
profiling are proved to be the \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Ugur:2022:OPF,
author = "Muhammed Ugur and Cheng Jiang and Alex Erf and Tanvir
Ahmed Khan and Baris Kasikci",
title = "One Profile Fits All: Profile-Guided {Linux} Kernel
Optimizations for Data Center Applications",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "26--33",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544502",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544502",
abstract = "Modern data center applications have multi-megabyte
instruction footprints that easily exhaust on-chip
cache structures, which typically have a size of only a
couple hundred kilobytes. Consequently, today's data
center applications suffer from \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Gan:2022:EPC,
author = "Yu Gan and Mingyu Liang and Sundar Dev and David Lo
and Christina Delimitrou",
title = "Enabling Practical Cloud Performance Debugging with
Unsupervised Learning",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "34--41",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544503",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544503",
abstract = "Abstract-Cloud applications are increasingly shifting
from large monolithic services to complex graphs of
loosely-coupled microservices. Despite their benefits,
microservices are prone to cascading performance
issues, and can lead to prolonged periods \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Toslali:2022:VVD,
author = "Mert Toslali and Emre Ates and Darby Huye and Zhaoqi
Zhang and Lan Liu and Samantha Puterman and Ayse K.
Coskun and Raja R. Sambasivan",
title = "{VAIF}: Variance-driven Automated Instrumentation
Framework",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "42--50",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544504",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544504",
abstract = "Developers use logs to diagnose performance problems
in distributed applications. But, it is difficult to
know a priori where logs are needed and what
information in them is needed to help diagnose problems
that may occur in the future. We summarize our
\ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Vippagunta:2022:POP,
author = "Srinivas Vippagunta and Ken Finnigan and Kishore
Pusukuri",
title = "{Pharos}: The Observability Platform at Workday",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "51--54",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544505",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544505",
abstract = "Observability is a necessary capability of modern
distributed systems as it allows us to gain actionable
insights about reliability, availability, performance,
etc., of the system.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Purandare:2022:AWC,
author = "Devashish R. Purandare and Daniel Bittman and Ethan L.
Miller",
title = "Analysis and Workload Characterization of the {CERN
EOS} Storage System",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "55--61",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544507",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544507",
abstract = "Modern, large-scale scientific computing runs on
complex exascale storage systems that support even more
complex data workloads. Understanding the data access
and movement patterns is vital for informing the design
of future iterations of existing \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Plehn:2022:DAC,
author = "Julius Plehn and Anna Fuchs and Michael Kuhn and Jakob
L{\"u}ttgau and Thomas Ludwig",
title = "Data-Aware Compression for {HPC} using Machine
Learning",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "62--69",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544508",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544508",
abstract = "While compression can provide significant storage and
cost savings, its use within HPC applications is often
only of secondary concern. This is in part due to the
inflexibility of existing approaches where a single
compression algorithm has to be used \ldots{}",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Nicolas:2022:SSL,
author = "Louis-Marie Nicolas and Luis Thomas and Yassine
Hadjadj-Aoul and Jalil Boukhobza",
title = "{SLRL}: a Simple Least Remaining Lifetime File
Eviction policy for {HPC} multi-tier storage systems",
journal = j-OPER-SYS-REV,
volume = "56",
number = "1",
pages = "70--76",
month = jun,
year = "2022",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3544497.3544509",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Jun 15 05:59:06 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3544497.3544509",
abstract = "HPC systems are composed of multiple tiers of storage,
from the top high performance tier (high speed SSDs) to
the bottom capacitive one (tapes). File placement in
such architecture is managed through prefetchers
(bottom-up) and eviction policies (top-. \ldots{})",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Zhang:2023:MIR,
author = "Yiying Zhang",
title = "Make It Real: an End-to-End Implementation of a
Physically Disaggregated Data Center",
journal = j-OPER-SYS-REV,
volume = "57",
number = "1",
pages = "1--9",
month = jun,
year = "2023",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3606557.3606559",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 1 13:18:59 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3606557.3606559",
abstract = "Resource disaggregation is an approach to separate
different hardware resources into independent pools in
a data center, so that these pools can be easily
managed and their resources can be allocated in a tight
but unbounded way. The past decade has \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Fingler:2023:DGA,
author = "Henrique Fingler and Zhiting Zhu and Esther Yoon and
Zhipeng Jia and Emmett Witchel and Christopher J.
Rossbach",
title = "Disaggregated {GPU} Acceleration for Serverless
Applications",
journal = j-OPER-SYS-REV,
volume = "57",
number = "1",
pages = "10--20",
month = jun,
year = "2023",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3606557.3606560",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 1 13:18:59 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3606557.3606560",
abstract = "Serverless platforms have been attracting applications
from traditional platforms because infrastructure
management responsibilities are shifted from users to
providers. Many applications well-suited to serverless
environments could leverage GPU \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Calciu:2023:ULC,
author = "Irina Calciu and M. Talha Imran and Ivan Puddu and
Sanidhya Kashyap and Hasan {Al Maruf} and Onur Mutlu
and Aasheesh Kolli",
title = "Using Local Cache Coherence for Disaggregated Memory
Systems",
journal = j-OPER-SYS-REV,
volume = "57",
number = "1",
pages = "21--28",
month = jun,
year = "2023",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3606557.3606561",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 1 13:18:59 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3606557.3606561",
abstract = "Disaggregated memory provides many cost savings and
resource provisioning benefits for current datacenters,
but software systems enabling disaggregated memory
access result in high performance penalties. These
systems require intrusive code changes to \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{AlMaruf:2023:MDA,
author = "Hasan {Al Maruf} and Mosharaf Chowdhury",
title = "Memory Disaggregation: Advances and Open Challenges",
journal = j-OPER-SYS-REV,
volume = "57",
number = "1",
pages = "29--37",
month = jun,
year = "2023",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3606557.3606562",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 1 13:18:59 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3606557.3606562",
abstract = "Compute and memory are tightly coupled within each
server in traditional datacenters. Large-scale
datacenter operators have identified this coupling as a
root cause behind fleetwide resource underutilization
and increasing Total Cost of Ownership (TCO).
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Aguilera:2023:MDW,
author = "Marcos K. Aguilera and Emmanuel Amaro and Nadav Amit
and Erika Hunhoff and Anil Yelam and Gerd Zellweger",
title = "Memory disaggregation: why now and what are the
challenges",
journal = j-OPER-SYS-REV,
volume = "57",
number = "1",
pages = "38--46",
month = jun,
year = "2023",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3606557.3606563",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 1 13:18:59 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3606557.3606563",
abstract = "Hardware disaggregation has emerged as one of the most
fundamental shifts in how we build computer systems
over the past decades. While disaggregation has been
successful for several types of resources (storage,
power, and others), memory disaggregation \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Saxena:2023:NPE,
author = "Divyanshu Saxena and Tao Ji and Arjun Singhvi and
Junaid Khalid and Aditya Akella",
title = "Navigating Performance--Efficiency Tradeoffs in
Serverless Computing: Deduplication to the Rescue!",
journal = j-OPER-SYS-REV,
volume = "57",
number = "1",
pages = "47--53",
month = jun,
year = "2023",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3606557.3606564",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Jul 1 13:18:59 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3606557.3606564",
abstract = "Navigating the performance and efficiency trade-offs
is critical for serverless platforms, where the
providers ideally want to give the illusion of warm
function startups while maintaining low resource costs.
Limited controls, provided via toggling \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Balakrishnan:2024:TCW,
author = "Mahesh Balakrishnan",
title = "Taming Consensus in the Wild (with the Shared Log
Abstraction)",
journal = j-OPER-SYS-REV,
volume = "58",
number = "1",
pages = "1--6",
month = jun,
year = "2024",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3689051.3689053",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 15 06:03:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3689051.3689053",
abstract = "The shared log is an abstraction for building layered
consensus systems that are simple to develop, deploy,
evolve, and operate. Shared logs emerged from systems
research and have seen significant traction in industry
over the past decade. In this paper, \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "Oper. Syst. Rev.",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Jia:2024:KIB,
author = "Zhipeng Jia and Emmett Witchel",
title = "The Key Ideas Behind {Boki}'s Shared Logs",
journal = j-OPER-SYS-REV,
volume = "58",
number = "1",
pages = "7--14",
month = jun,
year = "2024",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3689051.3689054",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 15 06:03:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3689051.3689054",
abstract = "The shared log approach has emerged as an attractive
state management option for distributed systems. A
shared log not only serves as persistent, strongly
consistent, and faulttolerant storage, its ability to
provide a total order enables fine-grained \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "Oper. Syst. Rev.",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Wu:2024:TTA,
author = "Chenyuan Wu and Haoyun Qin and Mohammad Javad Amiri
and Boon Thau Loo and Dahlia Malkhi and Ryan Marcus",
title = "Towards Truly Adaptive {Byzantine} Fault-Tolerant
Consensus",
journal = j-OPER-SYS-REV,
volume = "58",
number = "1",
pages = "15--22",
month = jun,
year = "2024",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3689051.3689055",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 15 06:03:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3689051.3689055",
abstract = "To acheive maximum performance, Byzantine
fault-tolerant (BFT) systems must be manually tuned
when hardware, network, or workload properties change.
This paper presents our vision for a reinforcement
learning (RL) based Byzantine fault-tolerant (BFT)
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "Oper. Syst. Rev.",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Las-Casas:2024:LAA,
author = "Pedro Las-Casas and Alok Gautum Kumbhare and Rodrigo
Fonseca and Sharad Agarwal",
title = "{LLexus}: an {AI} agent system for incident
management",
journal = j-OPER-SYS-REV,
volume = "58",
number = "1",
pages = "23--36",
month = jun,
year = "2024",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3689051.3689056",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 15 06:03:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3689051.3689056",
abstract = "When operating a software service on a cloud, the
complexity of keeping multiple distributed components
responsive is a significant challenge for engineering
teams. Engineers frequently rely on Troubleshooting
Guides (TSGs) to navigate how to mitigate \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "Oper. Syst. Rev.",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Logan:2024:EDS,
author = "Luke Logan and Jay Lofstead and Xian-He Sun and
Anthony Kougkas",
title = "An Evaluation of {DAOS} for Simulation and Deep
Learning {HPCWorkloads}",
journal = j-OPER-SYS-REV,
volume = "58",
number = "1",
pages = "37--44",
month = jun,
year = "2024",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3689051.3689058",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 15 06:03:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3689051.3689058",
abstract = "Traditionally, distributed storage systems have relied
upon the interfaces provided by OS kernels to interact
with storage hardware. However, much research has shown
that OSes impose serious overheads on every I/O
operation, especially on high-. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "Oper. Syst. Rev.",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Rolon:2024:BMP,
author = "Sebasti{\'a}n Rol{\'o}n and Oana Balmau",
title = "Is Bare-metal {I/O} Performance with User-defined
Storage Drives Inside {VMs} Possible? {Benchmarking}
{\tt libvfio-user} vs. Common Storage Virtualization
Configurations",
journal = j-OPER-SYS-REV,
volume = "58",
number = "1",
pages = "45--52",
month = jun,
year = "2024",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3689051.3689059",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 15 06:03:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3689051.3689059",
abstract = "It is a critical concern for cloud computing providers
to identify and adopt optimal virtual machine (VM) I/O
storage paths. In Linux, these involve NVMe hardware,
PCIe passthrough with vfio, and userspace drivers (e.g.
SPDK). One project tying together \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "Oper. Syst. Rev.",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Article{Doekemeijer:2024:ZRA,
author = "Krijn Doekemeijer and Zebin Ren and Nick Tehrany and
Animesh Trivedi",
title = "{ZWAL}: Rethinking Write-ahead Logs for {ZNS SSDs}
with Zone Appends",
journal = j-OPER-SYS-REV,
volume = "58",
number = "1",
pages = "53--60",
month = jun,
year = "2024",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/3689051.3689060",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Aug 15 06:03:40 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
URL = "https://dl.acm.org/doi/10.1145/3689051.3689060",
abstract = "KV-stores are extensively used databases that require
performance stability. Zoned Namespace (ZNS) is an
emerging interface for flash storage devices that
provides such stability. Due to their sequential write
access patterns, LSM trees, ubiquitous data \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "Oper. Syst. Rev.",
fjournal = "Operating Systems Review",
journal-URL = "https://dl.acm.org/loi/sigops",
}
@Book{McNamara:1977:TAD,
author = "John E. McNamara",
title = "Technical aspects of data communication",
publisher = "Digital Press, Educational Services Dept.",
address = "Bedford, MA, USA",
pages = "xi + 387",
year = "1977",
ISBN = "0-932376-01-0",
ISBN-13 = "978-0-932376-01-5",
LCCN = "TK5105 .M33 1978",
bibdate = "Sat Aug 26 16:05:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Data transmission systems",
}
@Book{Ousterhout:1981:MDO,
author = "John K. Ousterhout",
title = "{Medusa}, a distributed operating system",
volume = "1",
publisher = "UMI Research Press",
address = "Ann Arbor, Mich.",
pages = "xii + 139",
year = "1981",
ISBN = "0-8357-1201-X",
ISBN-13 = "978-0-8357-1201-9",
LCCN = "QA76.6 .O92 1981",
bibdate = "Sat Aug 26 16:03:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
series = "Computer science. Data bases and distributed systems",
acknowledgement = ack-nhfb,
remark = "A revision of the author's thesis---Carnegie-Mellon
University, 1980.",
subject = "Medusa (Computer system); Electronic data processing;
Distributed processing; Operating systems (Computers)",
}
@Book{McNamara:1982:TAD,
author = "John E. McNamara",
title = "Technical aspects of data communication",
publisher = "Digital Press",
address = "Bedford, MA, USA",
edition = "Second",
pages = "xi + 330",
year = "1982",
ISBN = "0-932376-18-5",
ISBN-13 = "978-0-932376-18-3",
LCCN = "TK5105 .M4 1982",
bibdate = "Sat Aug 26 16:05:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$32.00",
acknowledgement = ack-nhfb,
subject = "Data transmission systems",
}
@Book{Trivedi:1982:PSR,
author = "Kishor Shridharbhai Trivedi",
title = "Probability and statistics with reliability, queuing,
and computer science applications",
publisher = pub-PH,
address = pub-PH:adr,
pages = "x + 624",
year = "1982",
ISBN = "0-13-711564-4",
ISBN-13 = "978-0-13-711564-8",
LCCN = "QA273.19.E4 T74 1982",
bibdate = "Sat Aug 26 15:59:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Probabilities; Data processing; Mathematical
statistics; Computer algorithms",
}
@Book{Svigals:1983:PFM,
author = "Jerome Svigals",
title = "Planning for future market events using data
processing support: a five-step growth plan process",
publisher = pub-MACMILLAN,
address = pub-MACMILLAN:adr,
pages = "xii + 180",
year = "1983",
ISBN = "0-02-949740-X",
ISBN-13 = "978-0-02-949740-1",
LCCN = "HG1709 .S87 1983",
bibdate = "Sat Aug 26 16:07:09 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Banks and banking; Data processing; Business; Market
surveys",
}
@Book{Kenah:1984:VVI,
author = "Lawrence J. Kenah and Simon F. Bate",
title = "{VAX\slash VMS} internals and data structures",
publisher = pub-DP,
address = pub-DP:adr,
pages = "xix + 795",
year = "1984",
ISBN = "0-932376-52-5 (paperback)",
ISBN-13 = "978-0-932376-52-7 (paperback)",
LCCN = "QA76.76.O63 K46 1984",
bibdate = "Sat Aug 26 16:10:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "VAX/VMS; VAX-11 (Computer); Programming; Data
structures (Computer science)",
}
@Book{Kenah:1988:VVI,
author = "Lawrence J. Kenah and Ruth E. Goldenberg and Simon F.
Bate",
title = "{VAX\slash VMS} internals and data structures: version
4.4",
publisher = pub-DP,
address = pub-DP:adr,
pages = "xvii + 979",
year = "1988",
ISBN = "1-55558-008-4 (paperback)",
ISBN-13 = "978-1-55558-008-7 (paperback)",
LCCN = "QA76.76.O63 K47 1988",
bibdate = "Sat Aug 26 16:10:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "VAX/VMS; VAX-11 (Computer); Programming; Data
structures (Computer science)",
}
@Book{McNamara:1988:TAD,
author = "John E. McNamara",
title = "Technical aspects of data communication",
publisher = "Digital Press",
address = "Rockport, MA",
edition = "Third",
pages = "xi + 383",
year = "1988",
ISBN = "1-55558-007-6",
ISBN-13 = "978-1-55558-007-0",
LCCN = "TK5105 .M33 1988",
bibdate = "Sat Aug 26 16:05:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$42.00",
acknowledgement = ack-nhfb,
subject = "Data transmission systems",
}
@Book{Goldenberg:1991:VVI,
author = "Ruth E. Goldenberg and Lawrence J. Kenah and Denise E.
Dumas",
title = "{VAX\slash VMS} internals and data structures: version
5.2",
publisher = pub-DP,
address = pub-DP:adr,
pages = "xxvi + 1427",
year = "1991",
ISBN = "1-55558-059-9",
ISBN-13 = "978-1-55558-059-9",
LCCN = "QA76.76.O63 G638 1991",
bibdate = "Sat Aug 26 16:10:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "VAX/VMS; VAX computers; Programming; Data structures
(Computer science)",
}
@Book{Trivedi:2002:PSR,
author = "Kishor Shridharbhai Trivedi",
title = "Probability and statistics with reliability, queuing,
and computer science applications",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Second",
pages = "xv + 830",
year = "2002",
ISBN = "0-471-33341-7 (cloth)",
ISBN-13 = "978-0-471-33341-8 (cloth)",
LCCN = "QA273.19.E4 T74 2002",
bibdate = "Sat Aug 26 15:59:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/wiley046/2001026951.html;
http://www.loc.gov/catdir/description/wiley0310/2001026951.html;
http://www.loc.gov/catdir/toc/onix05/2001026951.html",
acknowledgement = ack-nhfb,
subject = "Probabilities; Data processing; Mathematical
statistics; Computer algorithms",
}
@Proceedings{Olle:1982:ISD,
editor = "T. William Olle and H. G. (Henk G.) Sol and A. A.
{Verrijn Stuart}",
booktitle = "{Information systems design methodologies: a
comparative review: proceedings of the IFIP WG 8.1
Working Conference on Comparative Review of Information
Systems Design Methodologies, Noordwijkerhout, The
Netherlands, 10--14 May 1982}",
title = "{Information systems design methodologies: a
comparative review: proceedings of the IFIP WG 8.1
Working Conference on Comparative Review of Information
Systems Design Methodologies, Noordwijkerhout, The
Netherlands, 10--14 May 1982}",
publisher = pub-NORTH-HOLLAND,
address = pub-NORTH-HOLLAND:adr,
pages = "x + 648",
year = "1982",
ISBN = "0-444-86407-5",
ISBN-13 = "978-0-444-86407-9",
LCCN = "Z699.A1 I37 1982",
bibdate = "Sat Aug 26 16:13:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
meetingname = "IFIP WG 8.1 Working Conference on Comparative Review
of Information Systems Design Methodologies (1982 :
Noordwijkerhout, Netherlands)",
subject = "Information storage and retrieval systems;
Methodology; Congresses",
}
@Proceedings{Feak:1983:SIS,
editor = "Viiveke F{\^e}ak",
booktitle = "{Security, IFIP/Sec'83: proceedings of the First
Security Conference, Stockholm, Sweden, 16--19 May
1983}",
title = "{Security, IFIP/Sec'83: proceedings of the First
Security Conference, Stockholm, Sweden, 16--19 May
1983}",
publisher = pub-NORTH-HOLLAND,
address = pub-NORTH-HOLLAND:adr,
pages = "xxxvi + 328",
year = "1983",
ISBN = "0-444-86669-8 (Elsevier)",
ISBN-13 = "978-0-444-86669-1 (Elsevier)",
LCCN = "QA76.9.A25 S4 1983",
bibdate = "Sat Aug 26 16:08:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
meetingname = "Security Conference (1st : 1983 : Stockholm, Sweden)",
remark = "Organized by Swedish Society for Information
Processing (SSI) under the auspices of the
International Federation for Information Processing
(IFIP).",
subject = "Computer security; Congresses; Electronic data
processing departments; Security measures",
}
@Proceedings{Olle:1983:ISD,
editor = "T. William Olle and H. G. (Henk G.) Sol and C. J.
(Colin J.) Tully",
booktitle = "{Information systems design methodologies: a feature
analysis: Proceedings of the IFIP WG 8.1 Working
Conference on Feature Analysis of Information Systems
Design Methodologies, York, U.K., 5--7 July, 1983}",
title = "{Information systems design methodologies: a feature
analysis: Proceedings of the IFIP WG 8.1 Working
Conference on Feature Analysis of Information Systems
Design Methodologies, York, U.K., 5--7 July, 1983}",
publisher = pub-NORTH-HOLLAND,
address = pub-NORTH-HOLLAND:adr,
pages = "x + 266",
year = "1983",
ISBN = "0-444-86705-8 (U.S.)",
ISBN-13 = "978-0-444-86705-6 (U.S.)",
LCCN = "QA76.9.S88 I35 1983",
bibdate = "Sat Aug 26 16:13:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
meetingname = "IFIP WG 8.1 Working Conference on Feature Analysis of
Information Systems Design Methodologies (1983 : York,
England)",
subject = "System design; Congresses",
}
@Proceedings{Olle:1986:ISD,
editor = "T. William Olle and H. G. (Henk G.) Sol and A. A.
{Verrijn Stuart}",
booktitle = "{Information systems design methodologies: improving
the practice: proceedings of the IFIP WG 8.1 Working
Conference on Comparative Review of Information Systems
Design Methodologies, Improving the Practice,
Noordwijkerhout, The Netherlands, 5--7 May, 1986}",
title = "{Information systems design methodologies: improving
the practice: proceedings of the IFIP WG 8.1 Working
Conference on Comparative Review of Information Systems
Design Methodologies, Improving the Practice,
Noordwijkerhout, The Netherlands, 5--7 May, 1986}",
publisher = pub-NORTH-HOLLAND,
address = pub-NORTH-HOLLAND:adr,
edition = "Post-conference",
pages = "xiii + 318",
year = "1986",
ISBN = "0-444-70014-5 (U.S.)",
ISBN-13 = "978-0-444-70014-8 (U.S.)",
LCCN = "QA76.9.S88 I345 1986",
bibdate = "Sat Aug 26 16:13:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
meetingname = "IFIP WG 8.1 Working Conference on Comparative Review
of Information Systems design Methodologies: Improving
the Practice (1986 : Noordwijkerhout, Netherlands)",
subject = "System design; Congresses; Management information
systems",
}
